About the Execution of 2023-gold for AutonomousCar-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.792 | 3600000.00 | 12283382.00 | 12110.60 | FFFFFF???F??FFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180400223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is AutonomousCar-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 865K May 18 16:42 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 AutonomousCar-PT-09b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-09b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716319517718
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 19:25:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:25:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:25:20] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2024-05-21 19:25:20] [INFO ] Transformed 391 places.
[2024-05-21 19:25:20] [INFO ] Transformed 1554 transitions.
[2024-05-21 19:25:20] [INFO ] Found NUPN structural information;
[2024-05-21 19:25:20] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-09b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 334 transition count 1497
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 334 transition count 1497
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 438 place count 334 transition count 1173
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 450 place count 322 transition count 1161
Iterating global reduction 1 with 12 rules applied. Total rules applied 462 place count 322 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 463 place count 321 transition count 1160
Iterating global reduction 1 with 1 rules applied. Total rules applied 464 place count 321 transition count 1160
Applied a total of 464 rules in 152 ms. Remains 321 /391 variables (removed 70) and now considering 1160/1554 (removed 394) transitions.
// Phase 1: matrix 1160 rows 321 cols
[2024-05-21 19:25:21] [INFO ] Computed 14 invariants in 44 ms
[2024-05-21 19:25:21] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-21 19:25:21] [INFO ] Invariant cache hit.
[2024-05-21 19:25:22] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-21 19:25:22] [INFO ] Invariant cache hit.
[2024-05-21 19:25:23] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 321/391 places, 1160/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 321/391 places, 1160/1554 transitions.
Support contains 43 out of 321 places after structural reductions.
[2024-05-21 19:25:23] [INFO ] Flatten gal took : 317 ms
[2024-05-21 19:25:23] [INFO ] Flatten gal took : 166 ms
[2024-05-21 19:25:24] [INFO ] Input system was already deterministic with 1160 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 26) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-21 19:25:25] [INFO ] Invariant cache hit.
[2024-05-21 19:25:26] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-21 19:25:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-21 19:25:30] [INFO ] After 3384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-21 19:25:31] [INFO ] Deduced a trap composed of 5 places in 505 ms of which 8 ms to minimize.
[2024-05-21 19:25:32] [INFO ] Deduced a trap composed of 15 places in 487 ms of which 2 ms to minimize.
[2024-05-21 19:25:32] [INFO ] Deduced a trap composed of 27 places in 434 ms of which 2 ms to minimize.
[2024-05-21 19:25:33] [INFO ] Deduced a trap composed of 24 places in 475 ms of which 1 ms to minimize.
[2024-05-21 19:25:33] [INFO ] Deduced a trap composed of 46 places in 451 ms of which 2 ms to minimize.
[2024-05-21 19:25:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2757 ms
[2024-05-21 19:25:36] [INFO ] After 9227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 2617 ms.
[2024-05-21 19:25:38] [INFO ] After 12273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 329 ms.
Support contains 37 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 257 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 13 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1580 edges and 319 vertex of which 317 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 317 transition count 1041
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 167 rules applied. Total rules applied 284 place count 204 transition count 987
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 316 place count 172 transition count 987
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 172 transition count 981
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 166 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 329 place count 165 transition count 980
Iterating global reduction 3 with 1 rules applied. Total rules applied 330 place count 165 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 164 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 164 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 334 place count 164 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 163 transition count 969
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 437 place count 112 transition count 918
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 438 place count 112 transition count 917
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 443 place count 107 transition count 880
Iterating global reduction 6 with 5 rules applied. Total rules applied 448 place count 107 transition count 880
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 452 place count 107 transition count 876
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 454 place count 106 transition count 875
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 476 place count 106 transition count 853
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 498 place count 84 transition count 853
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 506 place count 84 transition count 853
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 507 place count 83 transition count 852
Applied a total of 507 rules in 509 ms. Remains 83 /321 variables (removed 238) and now considering 852/1160 (removed 308) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 83/321 places, 852/1160 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 852 rows 83 cols
[2024-05-21 19:25:40] [INFO ] Computed 14 invariants in 9 ms
[2024-05-21 19:25:40] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-21 19:25:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-21 19:25:42] [INFO ] After 2103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-21 19:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:25:44] [INFO ] After 1797ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-21 19:25:46] [INFO ] After 3880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1827 ms.
[2024-05-21 19:25:48] [INFO ] After 7952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 161 ms.
Support contains 34 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 852/852 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 82 transition count 851
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 851
Applied a total of 2 rules in 71 ms. Remains 82 /83 variables (removed 1) and now considering 851/852 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 82/83 places, 851/852 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 17) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 851 rows 82 cols
[2024-05-21 19:25:49] [INFO ] Computed 14 invariants in 24 ms
[2024-05-21 19:25:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 19:25:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 19:25:50] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 19:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:25:51] [INFO ] After 471ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 19:25:51] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 480 ms.
[2024-05-21 19:25:52] [INFO ] After 2230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 55 ms.
Support contains 20 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 851/851 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 842
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 842
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 81 transition count 841
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 1 with 6 rules applied. Total rules applied 9 place count 78 transition count 838
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 76 transition count 836
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 76 transition count 832
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 48 place count 72 transition count 805
Applied a total of 48 rules in 142 ms. Remains 72 /82 variables (removed 10) and now considering 805/851 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 72/82 places, 805/851 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 595276 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{0=1}
Probabilistic random walk after 595276 steps, saw 89292 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 805 rows 72 cols
[2024-05-21 19:25:55] [INFO ] Computed 14 invariants in 9 ms
[2024-05-21 19:25:55] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:25:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 19:25:56] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 19:25:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:25:56] [INFO ] After 278ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:25:57] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 278 ms.
[2024-05-21 19:25:57] [INFO ] After 1455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 14 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 805/805 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 68 transition count 792
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 68 transition count 792
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 67 transition count 791
Applied a total of 10 rules in 70 ms. Remains 67 /72 variables (removed 5) and now considering 791/805 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 67/72 places, 791/805 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 649530 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649530 steps, saw 93172 distinct states, run finished after 3002 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 791 rows 67 cols
[2024-05-21 19:26:01] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 19:26:01] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:26:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-21 19:26:01] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 19:26:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:02] [INFO ] After 282ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:26:02] [INFO ] After 588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 273 ms.
[2024-05-21 19:26:02] [INFO ] After 1432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 14 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 791/791 transitions.
Applied a total of 0 rules in 39 ms. Remains 67 /67 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 67/67 places, 791/791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 791/791 transitions.
Applied a total of 0 rules in 37 ms. Remains 67 /67 variables (removed 0) and now considering 791/791 (removed 0) transitions.
[2024-05-21 19:26:02] [INFO ] Invariant cache hit.
[2024-05-21 19:26:02] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 19:26:02] [INFO ] Invariant cache hit.
[2024-05-21 19:26:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:03] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [62, 66]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 668 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 790/791 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 789
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 64 transition count 788
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 788
Applied a total of 4 rules in 82 ms. Remains 63 /65 variables (removed 2) and now considering 788/790 (removed 2) transitions.
// Phase 1: matrix 788 rows 63 cols
[2024-05-21 19:26:03] [INFO ] Computed 12 invariants in 5 ms
[2024-05-21 19:26:03] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 19:26:03] [INFO ] Invariant cache hit.
[2024-05-21 19:26:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:04] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/67 places, 788/791 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1385 ms. Remains : 63/67 places, 788/791 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 589210 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589210 steps, saw 86040 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-21 19:26:07] [INFO ] Invariant cache hit.
[2024-05-21 19:26:07] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:26:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 19:26:08] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 19:26:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:08] [INFO ] After 266ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 19:26:08] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 269 ms.
[2024-05-21 19:26:08] [INFO ] After 1414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 788/788 transitions.
Applied a total of 0 rules in 36 ms. Remains 63 /63 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 63/63 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 788/788 transitions.
Applied a total of 0 rules in 35 ms. Remains 63 /63 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2024-05-21 19:26:09] [INFO ] Invariant cache hit.
[2024-05-21 19:26:09] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-21 19:26:09] [INFO ] Invariant cache hit.
[2024-05-21 19:26:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:09] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-21 19:26:09] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-21 19:26:09] [INFO ] Invariant cache hit.
[2024-05-21 19:26:10] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 63/63 places, 788/788 transitions.
Graph (complete) has 862 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 787
Applied a total of 2 rules in 42 ms. Remains 62 /63 variables (removed 1) and now considering 787/788 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 787 rows 62 cols
[2024-05-21 19:26:10] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 19:26:10] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 19:26:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 19:26:11] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 19:26:11] [INFO ] After 883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 282 ms.
[2024-05-21 19:26:11] [INFO ] After 1210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA AutonomousCar-PT-09b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 49 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 20 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 16 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:26:12] [INFO ] Computed 14 invariants in 6 ms
[2024-05-21 19:26:12] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-21 19:26:12] [INFO ] Invariant cache hit.
[2024-05-21 19:26:12] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2024-05-21 19:26:12] [INFO ] Invariant cache hit.
[2024-05-21 19:26:14] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2075 ms. Remains : 319/321 places, 1158/1160 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 357 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (EQ s4 0) (EQ s11 0) (EQ s260 0) (EQ s285 0)) (OR (EQ s59 0) (EQ s89 0) (EQ s114 0) (EQ s134 0) (EQ s159 0) (EQ s189 0) (EQ s209 0) (EQ s239 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 7 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-01 finished in 2537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 18 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
[2024-05-21 19:26:14] [INFO ] Invariant cache hit.
[2024-05-21 19:26:15] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-21 19:26:15] [INFO ] Invariant cache hit.
[2024-05-21 19:26:16] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2024-05-21 19:26:16] [INFO ] Invariant cache hit.
[2024-05-21 19:26:16] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2491 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-02 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s4 1) (NEQ s18 1) (NEQ s260 1) (NEQ s285 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15363 steps with 124 reset in 124 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-02 finished in 2861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 15 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 282 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 166 rules applied. Total rules applied 281 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 32 rules applied. Total rules applied 313 place count 173 transition count 990
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 314 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 329 place count 163 transition count 981
Iterating global reduction 4 with 3 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 463 place count 98 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 464 place count 98 transition count 905
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 479 place count 83 transition count 772
Iterating global reduction 7 with 15 rules applied. Total rules applied 494 place count 83 transition count 772
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 502 place count 83 transition count 764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 506 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 508 place count 79 transition count 760
Applied a total of 508 rules in 422 ms. Remains 79 /321 variables (removed 242) and now considering 760/1160 (removed 400) transitions.
// Phase 1: matrix 760 rows 79 cols
[2024-05-21 19:26:17] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 19:26:17] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 19:26:17] [INFO ] Invariant cache hit.
[2024-05-21 19:26:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 662 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/321 places, 760/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 759
Applied a total of 2 rules in 79 ms. Remains 76 /77 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 76 cols
[2024-05-21 19:26:18] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 19:26:18] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-21 19:26:18] [INFO ] Invariant cache hit.
[2024-05-21 19:26:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:19] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/321 places, 759/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1877 ms. Remains : 76/321 places, 759/1160 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s49 1), p1:(OR (AND (EQ s1 1) (EQ s6 1) (EQ s27 1) (EQ s71 1)) (AND (EQ s17 1) (EQ s21 1) (EQ s31 1) (EQ s35 1) (EQ s44 1) (EQ s50 1) (EQ s56 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-04 finished in 2022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 15 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 19 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:26:19] [INFO ] Computed 14 invariants in 6 ms
[2024-05-21 19:26:19] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 19:26:19] [INFO ] Invariant cache hit.
[2024-05-21 19:26:20] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2024-05-21 19:26:20] [INFO ] Invariant cache hit.
[2024-05-21 19:26:21] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2072 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s59 1) (EQ s84 1) (EQ s109 1) (EQ s139 1) (EQ s164 1) (EQ s189 1) (EQ s214 1) (EQ s239 1) (EQ s259 1) (EQ s286 1)), p0:(OR (EQ s27 1) (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-05 finished in 2275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1) U X(p2))||p0))))'
Support contains 14 out of 321 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 272 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 166 rules applied. Total rules applied 281 place count 204 transition count 991
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 312 place count 173 transition count 991
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 312 place count 173 transition count 985
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 324 place count 167 transition count 985
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 327 place count 164 transition count 982
Iterating global reduction 3 with 3 rules applied. Total rules applied 330 place count 164 transition count 982
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 163 transition count 973
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 163 transition count 973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 334 place count 163 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 162 transition count 971
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 451 place count 104 transition count 912
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 104 transition count 911
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 462 place count 94 transition count 828
Iterating global reduction 6 with 10 rules applied. Total rules applied 472 place count 94 transition count 828
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 480 place count 94 transition count 820
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 484 place count 92 transition count 818
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 486 place count 90 transition count 816
Applied a total of 486 rules in 287 ms. Remains 90 /321 variables (removed 231) and now considering 816/1160 (removed 344) transitions.
// Phase 1: matrix 816 rows 90 cols
[2024-05-21 19:26:21] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 19:26:22] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 19:26:22] [INFO ] Invariant cache hit.
[2024-05-21 19:26:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:22] [INFO ] Implicit Places using invariants and state equation in 460 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 657 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/321 places, 816/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 815
Applied a total of 2 rules in 48 ms. Remains 87 /88 variables (removed 1) and now considering 815/816 (removed 1) transitions.
// Phase 1: matrix 815 rows 87 cols
[2024-05-21 19:26:22] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 19:26:23] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-21 19:26:23] [INFO ] Invariant cache hit.
[2024-05-21 19:26:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:23] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/321 places, 815/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1737 ms. Remains : 87/321 places, 815/1160 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s7 0) (EQ s53 0) (EQ s82 0)), p2:(AND (EQ s15 1) (EQ s24 1) (EQ s32 1) (EQ s37 1) (EQ s44 1) (EQ s56 1) (EQ s64 1) (EQ s69 1) (EQ s76...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 173 reset in 236 ms.
Product exploration explored 100000 steps with 53 reset in 292 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 314 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725462 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725462 steps, saw 113535 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:26:27] [INFO ] Invariant cache hit.
[2024-05-21 19:26:27] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:26:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:26:27] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:28] [INFO ] After 168ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:28] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-21 19:26:28] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 14 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 815/815 transitions.
Graph (complete) has 973 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 812
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 1 with 6 rules applied. Total rules applied 9 place count 83 transition count 809
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 81 transition count 789
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 81 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 79 transition count 787
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 79 transition count 772
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 47 place count 64 transition count 772
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 773
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 63 transition count 773
Applied a total of 54 rules in 182 ms. Remains 63 /87 variables (removed 24) and now considering 773/815 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 63/87 places, 773/815 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 773933 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :{}
Probabilistic random walk after 773933 steps, saw 114025 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 773 rows 63 cols
[2024-05-21 19:26:31] [INFO ] Computed 11 invariants in 9 ms
[2024-05-21 19:26:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:26:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2024-05-21 19:26:32] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:32] [INFO ] After 154ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:32] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2024-05-21 19:26:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2024-05-21 19:26:32] [INFO ] After 705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-21 19:26:33] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 37 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 63/63 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 33 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2024-05-21 19:26:33] [INFO ] Invariant cache hit.
[2024-05-21 19:26:33] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 19:26:33] [INFO ] Invariant cache hit.
[2024-05-21 19:26:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:26:33] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-21 19:26:33] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-21 19:26:33] [INFO ] Invariant cache hit.
[2024-05-21 19:26:34] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 63/63 places, 773/773 transitions.
Applied a total of 0 rules in 34 ms. Remains 63 /63 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 19:26:34] [INFO ] Invariant cache hit.
[2024-05-21 19:26:34] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:26:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 19:26:34] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 1 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2024-05-21 19:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 737 ms
[2024-05-21 19:26:35] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-21 19:26:35] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 14 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 815/815 transitions.
Applied a total of 0 rules in 36 ms. Remains 87 /87 variables (removed 0) and now considering 815/815 (removed 0) transitions.
// Phase 1: matrix 815 rows 87 cols
[2024-05-21 19:26:36] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:26:36] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-21 19:26:36] [INFO ] Invariant cache hit.
[2024-05-21 19:26:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:36] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-21 19:26:36] [INFO ] Redundant transitions in 50 ms returned [578]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 814 rows 87 cols
[2024-05-21 19:26:36] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:26:37] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 814/815 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 812
Applied a total of 2 rules in 45 ms. Remains 85 /87 variables (removed 2) and now considering 812/814 (removed 2) transitions.
// Phase 1: matrix 812 rows 85 cols
[2024-05-21 19:26:37] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 19:26:37] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 19:26:37] [INFO ] Invariant cache hit.
[2024-05-21 19:26:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:37] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/87 places, 812/815 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1804 ms. Remains : 85/87 places, 812/815 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 336 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 718614 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :{}
Probabilistic random walk after 718614 steps, saw 116352 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:26:41] [INFO ] Invariant cache hit.
[2024-05-21 19:26:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:26:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:26:41] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:42] [INFO ] After 234ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:26:42] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2024-05-21 19:26:43] [INFO ] Deduced a trap composed of 9 places in 369 ms of which 1 ms to minimize.
[2024-05-21 19:26:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 845 ms
[2024-05-21 19:26:43] [INFO ] After 1246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-21 19:26:43] [INFO ] After 1937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 812/812 transitions.
Graph (complete) has 966 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 810
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 1 with 6 rules applied. Total rules applied 8 place count 81 transition count 807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 79 transition count 787
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 79 transition count 787
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 77 transition count 785
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 77 transition count 770
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 62 transition count 770
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 62 transition count 770
Applied a total of 51 rules in 137 ms. Remains 62 /85 variables (removed 23) and now considering 770/812 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 62/85 places, 770/812 transitions.
Finished random walk after 1861 steps, including 8 resets, run visited all 1 properties in 22 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 568 reset in 194 ms.
Product exploration explored 100000 steps with 104 reset in 115 ms.
Built C files in :
/tmp/ltsmin4758927203491509124
[2024-05-21 19:26:44] [INFO ] Computing symmetric may disable matrix : 812 transitions.
[2024-05-21 19:26:44] [INFO ] Computation of Complete disable matrix. took 112 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:44] [INFO ] Computing symmetric may enable matrix : 812 transitions.
[2024-05-21 19:26:44] [INFO ] Computation of Complete enable matrix. took 96 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:44] [INFO ] Computing Do-Not-Accords matrix : 812 transitions.
[2024-05-21 19:26:44] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:44] [INFO ] Built C files in 487ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4758927203491509124
Running compilation step : cd /tmp/ltsmin4758927203491509124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4758927203491509124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4758927203491509124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 14 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 812/812 transitions.
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 0 with 6 rules applied. Total rules applied 6 place count 82 transition count 809
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 789
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 789
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 78 transition count 787
Applied a total of 14 rules in 61 ms. Remains 78 /85 variables (removed 7) and now considering 787/812 (removed 25) transitions.
// Phase 1: matrix 787 rows 78 cols
[2024-05-21 19:26:47] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 19:26:48] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 19:26:48] [INFO ] Invariant cache hit.
[2024-05-21 19:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:26:48] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-21 19:26:48] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-21 19:26:48] [INFO ] Invariant cache hit.
[2024-05-21 19:26:49] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/85 places, 787/812 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1275 ms. Remains : 78/85 places, 787/812 transitions.
Built C files in :
/tmp/ltsmin17571379268460815117
[2024-05-21 19:26:49] [INFO ] Computing symmetric may disable matrix : 787 transitions.
[2024-05-21 19:26:49] [INFO ] Computation of Complete disable matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:49] [INFO ] Computing symmetric may enable matrix : 787 transitions.
[2024-05-21 19:26:49] [INFO ] Computation of Complete enable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:49] [INFO ] Computing Do-Not-Accords matrix : 787 transitions.
[2024-05-21 19:26:49] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:26:49] [INFO ] Built C files in 386ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17571379268460815117
Running compilation step : cd /tmp/ltsmin17571379268460815117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17571379268460815117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17571379268460815117;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:26:52] [INFO ] Flatten gal took : 172 ms
[2024-05-21 19:26:53] [INFO ] Flatten gal took : 141 ms
[2024-05-21 19:26:53] [INFO ] Time to serialize gal into /tmp/LTL17011483536418739911.gal : 32 ms
[2024-05-21 19:26:53] [INFO ] Time to serialize properties into /tmp/LTL10312804878453758811.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17011483536418739911.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17560945528979489925.hoa' '-atoms' '/tmp/LTL10312804878453758811.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10312804878453758811.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17560945528979489925.hoa
Detected timeout of ITS tools.
[2024-05-21 19:27:08] [INFO ] Flatten gal took : 138 ms
[2024-05-21 19:27:08] [INFO ] Flatten gal took : 133 ms
[2024-05-21 19:27:08] [INFO ] Time to serialize gal into /tmp/LTL3443750268549166719.gal : 43 ms
[2024-05-21 19:27:08] [INFO ] Time to serialize properties into /tmp/LTL12367330716706773075.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3443750268549166719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12367330716706773075.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((p6==0)||(p17==0))||((p222==0)||(p348==0)))")||((G("(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==...350
Formula 0 simplified : FG(!"(((p6==0)||(p17==0))||((p222==0)||(p348==0)))" & (F!"(((((p65==1)&&(p102==1))&&((p127==1)&&(p164==1)))&&(((p189==1)&&(p220==1))...341
Detected timeout of ITS tools.
[2024-05-21 19:27:23] [INFO ] Flatten gal took : 111 ms
[2024-05-21 19:27:23] [INFO ] Applying decomposition
[2024-05-21 19:27:23] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18192785279985536853.txt' '-o' '/tmp/graph18192785279985536853.bin' '-w' '/tmp/graph18192785279985536853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18192785279985536853.bin' '-l' '-1' '-v' '-w' '/tmp/graph18192785279985536853.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:27:24] [INFO ] Decomposing Gal with order
[2024-05-21 19:27:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:27:24] [INFO ] Removed a total of 5649 redundant transitions.
[2024-05-21 19:27:24] [INFO ] Flatten gal took : 384 ms
[2024-05-21 19:27:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 82 ms.
[2024-05-21 19:27:25] [INFO ] Time to serialize gal into /tmp/LTL14612304538798509648.gal : 5 ms
[2024-05-21 19:27:25] [INFO ] Time to serialize properties into /tmp/LTL11468490342080895983.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14612304538798509648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11468490342080895983.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((i1.u0.p6==0)||(i1.u0.p17==0))||((i1.u0.p222==0)||(i1.u0.p348==0)))")||((G("(((((i0.u1.p65==1)&&(i0.u4.p102==1))&&((i0.u5.p...502
Formula 0 simplified : FG(!"(((i1.u0.p6==0)||(i1.u0.p17==0))||((i1.u0.p222==0)||(i1.u0.p348==0)))" & (F!"(((((i0.u1.p65==1)&&(i0.u4.p102==1))&&((i0.u5.p127...493
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9913351269260119620
[2024-05-21 19:27:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9913351269260119620
Running compilation step : cd /tmp/ltsmin9913351269260119620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9913351269260119620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9913351269260119620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-06 finished in 81488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 481 place count 89 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 896
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 499 place count 72 transition count 742
Iterating global reduction 6 with 17 rules applied. Total rules applied 516 place count 72 transition count 742
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 523 place count 72 transition count 735
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 527 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 528 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 68 transition count 731
Applied a total of 530 rules in 261 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-05-21 19:27:43] [INFO ] Computed 13 invariants in 5 ms
[2024-05-21 19:27:43] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 19:27:43] [INFO ] Invariant cache hit.
[2024-05-21 19:27:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:27:44] [INFO ] Implicit Places using invariants and state equation in 624 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 996 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 731/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 730
Applied a total of 2 rules in 54 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-05-21 19:27:44] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:27:44] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 19:27:44] [INFO ] Invariant cache hit.
[2024-05-21 19:27:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:45] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/321 places, 730/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2200 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s8 0) (EQ s53 0) (EQ s61 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 107 reset in 149 ms.
Product exploration explored 100000 steps with 478 reset in 316 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 538 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 727457 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727457 steps, saw 115609 distinct states, run finished after 3004 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:27:49] [INFO ] Invariant cache hit.
[2024-05-21 19:27:49] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:27:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 19:27:49] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:27:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:49] [INFO ] After 89ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:27:49] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-21 19:27:49] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 130 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 53/65 places, 718/730 transitions.
Finished random walk after 5008 steps, including 66 resets, run visited all 1 properties in 58 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 53 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-05-21 19:27:50] [INFO ] Invariant cache hit.
[2024-05-21 19:27:50] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 19:27:50] [INFO ] Invariant cache hit.
[2024-05-21 19:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:51] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-05-21 19:27:51] [INFO ] Redundant transitions in 26 ms returned [555]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 729 rows 65 cols
[2024-05-21 19:27:51] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 19:27:51] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 727
Applied a total of 2 rules in 54 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-05-21 19:27:51] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:27:52] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 19:27:52] [INFO ] Invariant cache hit.
[2024-05-21 19:27:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:52] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2382 ms. Remains : 63/65 places, 727/730 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 556 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 791610 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :{}
Probabilistic random walk after 791610 steps, saw 125418 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:27:55] [INFO ] Invariant cache hit.
[2024-05-21 19:27:55] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:27:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:27:56] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:27:56] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:27:56] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-21 19:27:56] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 83 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 52/63 places, 715/727 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished Best-First random walk after 700 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=350 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1345 reset in 234 ms.
Product exploration explored 100000 steps with 675 reset in 177 ms.
Built C files in :
/tmp/ltsmin17720770945037550871
[2024-05-21 19:27:57] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2024-05-21 19:27:57] [INFO ] Computation of Complete disable matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:27:57] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2024-05-21 19:27:57] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:27:57] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2024-05-21 19:27:57] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:27:57] [INFO ] Built C files in 330ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17720770945037550871
Running compilation step : cd /tmp/ltsmin17720770945037550871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17720770945037550871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17720770945037550871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 47 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-05-21 19:28:00] [INFO ] Invariant cache hit.
[2024-05-21 19:28:01] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 19:28:01] [INFO ] Invariant cache hit.
[2024-05-21 19:28:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:28:01] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-05-21 19:28:01] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-21 19:28:01] [INFO ] Invariant cache hit.
[2024-05-21 19:28:02] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1349 ms. Remains : 63/63 places, 727/727 transitions.
Built C files in :
/tmp/ltsmin18015557705933441155
[2024-05-21 19:28:02] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2024-05-21 19:28:02] [INFO ] Computation of Complete disable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:28:02] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2024-05-21 19:28:02] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:28:02] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2024-05-21 19:28:02] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:28:02] [INFO ] Built C files in 327ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18015557705933441155
Running compilation step : cd /tmp/ltsmin18015557705933441155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18015557705933441155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18015557705933441155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:28:05] [INFO ] Flatten gal took : 112 ms
[2024-05-21 19:28:05] [INFO ] Flatten gal took : 104 ms
[2024-05-21 19:28:05] [INFO ] Time to serialize gal into /tmp/LTL7213133020793611733.gal : 14 ms
[2024-05-21 19:28:05] [INFO ] Time to serialize properties into /tmp/LTL12779260853520787133.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7213133020793611733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4742993136759271329.hoa' '-atoms' '/tmp/LTL12779260853520787133.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12779260853520787133.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4742993136759271329.hoa
Detected timeout of ITS tools.
[2024-05-21 19:28:21] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:28:21] [INFO ] Flatten gal took : 96 ms
[2024-05-21 19:28:21] [INFO ] Time to serialize gal into /tmp/LTL15908575970806311592.gal : 14 ms
[2024-05-21 19:28:21] [INFO ] Time to serialize properties into /tmp/LTL2016132958312916972.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15908575970806311592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2016132958312916972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p6==0)||(p18==0))||((p308==0)||(p348==0)))"))))
Formula 0 simplified : GF!"(((p6==0)||(p18==0))||((p308==0)||(p348==0)))"
Detected timeout of ITS tools.
[2024-05-21 19:28:36] [INFO ] Flatten gal took : 105 ms
[2024-05-21 19:28:36] [INFO ] Applying decomposition
[2024-05-21 19:28:36] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12510280799906965273.txt' '-o' '/tmp/graph12510280799906965273.bin' '-w' '/tmp/graph12510280799906965273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12510280799906965273.bin' '-l' '-1' '-v' '-w' '/tmp/graph12510280799906965273.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:28:36] [INFO ] Decomposing Gal with order
[2024-05-21 19:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:28:36] [INFO ] Removed a total of 5424 redundant transitions.
[2024-05-21 19:28:36] [INFO ] Flatten gal took : 151 ms
[2024-05-21 19:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 50 ms.
[2024-05-21 19:28:37] [INFO ] Time to serialize gal into /tmp/LTL13729054379594833600.gal : 12 ms
[2024-05-21 19:28:37] [INFO ] Time to serialize properties into /tmp/LTL8298194340275316127.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13729054379594833600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8298194340275316127.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u0.p6==0)||(u0.p18==0))||((i3.u17.p308==0)||(u0.p348==0)))"))))
Formula 0 simplified : GF!"(((u0.p6==0)||(u0.p18==0))||((i3.u17.p308==0)||(u0.p348==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3651558236328238176
[2024-05-21 19:28:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3651558236328238176
Running compilation step : cd /tmp/ltsmin3651558236328238176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3651558236328238176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3651558236328238176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-07 finished in 72024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 15 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:28:55] [INFO ] Computed 14 invariants in 5 ms
[2024-05-21 19:28:55] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 19:28:55] [INFO ] Invariant cache hit.
[2024-05-21 19:28:56] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-05-21 19:28:56] [INFO ] Invariant cache hit.
[2024-05-21 19:28:57] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2315 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s252 1), p0:(OR (EQ s4 0) (EQ s15 0) (EQ s245 0) (EQ s285 0))], 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]]
Product exploration explored 100000 steps with 819 reset in 381 ms.
Product exploration explored 100000 steps with 829 reset in 348 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:28:58] [INFO ] Invariant cache hit.
[2024-05-21 19:28:58] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:28:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-21 19:28:59] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:29:00] [INFO ] Deduced a trap composed of 31 places in 501 ms of which 1 ms to minimize.
[2024-05-21 19:29:00] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 0 ms to minimize.
[2024-05-21 19:29:01] [INFO ] Deduced a trap composed of 31 places in 453 ms of which 1 ms to minimize.
[2024-05-21 19:29:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1630 ms
[2024-05-21 19:29:01] [INFO ] After 2292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-21 19:29:01] [INFO ] After 2493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 302 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 738
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 738
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 69 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 529 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 539 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 549 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 57 transition count 718
Applied a total of 551 rules in 220 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 57/319 places, 718/1158 transitions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished Best-First random walk after 675 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=225 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2024-05-21 19:29:02] [INFO ] Invariant cache hit.
[2024-05-21 19:29:02] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-05-21 19:29:02] [INFO ] Invariant cache hit.
[2024-05-21 19:29:03] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-21 19:29:03] [INFO ] Invariant cache hit.
[2024-05-21 19:29:04] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2232 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:29:04] [INFO ] Invariant cache hit.
[2024-05-21 19:29:04] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:29:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-21 19:29:05] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:29:05] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 1 ms to minimize.
[2024-05-21 19:29:06] [INFO ] Deduced a trap composed of 31 places in 487 ms of which 1 ms to minimize.
[2024-05-21 19:29:06] [INFO ] Deduced a trap composed of 31 places in 467 ms of which 1 ms to minimize.
[2024-05-21 19:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1631 ms
[2024-05-21 19:29:07] [INFO ] After 2321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2024-05-21 19:29:07] [INFO ] After 2522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 302 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 482 place count 87 transition count 902
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 87 transition count 901
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 501 place count 69 transition count 738
Iterating global reduction 4 with 18 rules applied. Total rules applied 519 place count 69 transition count 738
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 527 place count 69 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 529 place count 68 transition count 729
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 539 place count 68 transition count 719
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 549 place count 58 transition count 719
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 58 transition count 719
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 57 transition count 718
Applied a total of 551 rules in 217 ms. Remains 57 /319 variables (removed 262) and now considering 718/1158 (removed 440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 57/319 places, 718/1158 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Finished Best-First random walk after 698 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=349 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 212 reset in 190 ms.
Product exploration explored 100000 steps with 404 reset in 255 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 317 transition count 1156
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 135 place count 317 transition count 1135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 135 place count 317 transition count 1135
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 158 place count 317 transition count 1135
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 254 place count 221 transition count 1039
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 350 place count 221 transition count 1039
Performed 89 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 439 place count 221 transition count 1051
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 441 place count 221 transition count 1049
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 515 place count 147 transition count 830
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 3 with 74 rules applied. Total rules applied 589 place count 147 transition count 830
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 605 place count 147 transition count 814
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 614 place count 138 transition count 805
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 623 place count 138 transition count 805
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 624 place count 138 transition count 805
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 626 place count 136 transition count 803
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 628 place count 136 transition count 803
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 629 place count 136 transition count 805
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 629 rules in 220 ms. Remains 136 /319 variables (removed 183) and now considering 805/1158 (removed 353) transitions.
[2024-05-21 19:29:09] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 805 rows 136 cols
[2024-05-21 19:29:09] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 19:29:09] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/319 places, 805/1158 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 810 ms. Remains : 136/319 places, 805/1158 transitions.
Built C files in :
/tmp/ltsmin17549114829060138161
[2024-05-21 19:29:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17549114829060138161
Running compilation step : cd /tmp/ltsmin17549114829060138161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17549114829060138161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17549114829060138161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 10 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:29:12] [INFO ] Computed 14 invariants in 11 ms
[2024-05-21 19:29:13] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-21 19:29:13] [INFO ] Invariant cache hit.
[2024-05-21 19:29:14] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2024-05-21 19:29:14] [INFO ] Invariant cache hit.
[2024-05-21 19:29:15] [INFO ] Dead Transitions using invariants and state equation in 1086 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2419 ms. Remains : 319/319 places, 1158/1158 transitions.
Built C files in :
/tmp/ltsmin4999676541955480537
[2024-05-21 19:29:15] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4999676541955480537
Running compilation step : cd /tmp/ltsmin4999676541955480537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4999676541955480537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4999676541955480537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:29:18] [INFO ] Flatten gal took : 78 ms
[2024-05-21 19:29:18] [INFO ] Flatten gal took : 78 ms
[2024-05-21 19:29:18] [INFO ] Time to serialize gal into /tmp/LTL2717097112534844347.gal : 15 ms
[2024-05-21 19:29:18] [INFO ] Time to serialize properties into /tmp/LTL13004284474549183998.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2717097112534844347.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2299304612889404504.hoa' '-atoms' '/tmp/LTL13004284474549183998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13004284474549183998.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2299304612889404504.hoa
Detected timeout of ITS tools.
[2024-05-21 19:29:33] [INFO ] Flatten gal took : 91 ms
[2024-05-21 19:29:33] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:29:33] [INFO ] Time to serialize gal into /tmp/LTL10459967793902098052.gal : 25 ms
[2024-05-21 19:29:33] [INFO ] Time to serialize properties into /tmp/LTL17999947012937001402.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10459967793902098052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17999947012937001402.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p6==0)||(p18==0))||((p296==0)||(p348==0)))")||(X(G("(p304==1)")))))))
Formula 0 simplified : XF(!"(((p6==0)||(p18==0))||((p296==0)||(p348==0)))" & XF!"(p304==1)")
Detected timeout of ITS tools.
[2024-05-21 19:29:48] [INFO ] Flatten gal took : 78 ms
[2024-05-21 19:29:48] [INFO ] Applying decomposition
[2024-05-21 19:29:48] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1968926144468752973.txt' '-o' '/tmp/graph1968926144468752973.bin' '-w' '/tmp/graph1968926144468752973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1968926144468752973.bin' '-l' '-1' '-v' '-w' '/tmp/graph1968926144468752973.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:29:49] [INFO ] Decomposing Gal with order
[2024-05-21 19:29:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:29:49] [INFO ] Removed a total of 6152 redundant transitions.
[2024-05-21 19:29:49] [INFO ] Flatten gal took : 175 ms
[2024-05-21 19:29:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 31 ms.
[2024-05-21 19:29:49] [INFO ] Time to serialize gal into /tmp/LTL10694996618116791313.gal : 6 ms
[2024-05-21 19:29:49] [INFO ] Time to serialize properties into /tmp/LTL13851256026147106159.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10694996618116791313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13851256026147106159.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((i0.u2.p6==0)||(i0.u2.p18==0))||((i1.i2.u91.p296==0)||(i0.u2.p348==0)))")||(X(G("(i1.i2.u94.p304==1)")))))))
Formula 0 simplified : XF(!"(((i0.u2.p6==0)||(i0.u2.p18==0))||((i1.i2.u91.p296==0)||(i0.u2.p348==0)))" & XF!"(i1.i2.u94.p304==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10147822605903839971
[2024-05-21 19:30:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10147822605903839971
Running compilation step : cd /tmp/ltsmin10147822605903839971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10147822605903839971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10147822605903839971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 72523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 303 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 479 place count 90 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 480 place count 90 transition count 897
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 496 place count 74 transition count 752
Iterating global reduction 6 with 16 rules applied. Total rules applied 512 place count 74 transition count 752
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 518 place count 74 transition count 746
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 522 place count 72 transition count 744
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 524 place count 72 transition count 744
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 70 transition count 742
Applied a total of 526 rules in 244 ms. Remains 70 /321 variables (removed 251) and now considering 742/1160 (removed 418) transitions.
// Phase 1: matrix 742 rows 70 cols
[2024-05-21 19:30:07] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 19:30:08] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 19:30:08] [INFO ] Invariant cache hit.
[2024-05-21 19:30:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:30:08] [INFO ] Implicit Places using invariants and state equation in 563 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 909 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/321 places, 742/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 741
Applied a total of 2 rules in 58 ms. Remains 67 /68 variables (removed 1) and now considering 741/742 (removed 1) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-21 19:30:08] [INFO ] Computed 11 invariants in 6 ms
[2024-05-21 19:30:09] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-21 19:30:09] [INFO ] Invariant cache hit.
[2024-05-21 19:30:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:09] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/321 places, 741/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2078 ms. Remains : 67/321 places, 741/1160 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s45 1) (EQ s63 1)), p1:(OR (EQ s1 0) (EQ s5 0) (EQ s33 0) (EQ s63 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-09 finished in 2212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 481 place count 89 transition count 897
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 482 place count 89 transition count 896
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 499 place count 72 transition count 742
Iterating global reduction 6 with 17 rules applied. Total rules applied 516 place count 72 transition count 742
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 523 place count 72 transition count 735
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 527 place count 70 transition count 733
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 528 place count 70 transition count 733
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 68 transition count 731
Applied a total of 530 rules in 243 ms. Remains 68 /321 variables (removed 253) and now considering 731/1160 (removed 429) transitions.
// Phase 1: matrix 731 rows 68 cols
[2024-05-21 19:30:10] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 19:30:10] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-21 19:30:10] [INFO ] Invariant cache hit.
[2024-05-21 19:30:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:30:11] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [63, 67]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 897 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/321 places, 731/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 730
Applied a total of 2 rules in 54 ms. Remains 65 /66 variables (removed 1) and now considering 730/731 (removed 1) transitions.
// Phase 1: matrix 730 rows 65 cols
[2024-05-21 19:30:11] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 19:30:11] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-21 19:30:11] [INFO ] Invariant cache hit.
[2024-05-21 19:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:11] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/321 places, 730/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2056 ms. Remains : 65/321 places, 730/1160 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s9 0) (EQ s43 0) (EQ s61 0))], 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 1036 reset in 193 ms.
Product exploration explored 100000 steps with 552 reset in 160 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 511 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 778188 steps, run timeout after 3001 ms. (steps per millisecond=259 ) properties seen :{}
Probabilistic random walk after 778188 steps, saw 122284 distinct states, run finished after 3005 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:30:15] [INFO ] Invariant cache hit.
[2024-05-21 19:30:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:30:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:30:16] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:30:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:16] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:30:16] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-21 19:30:16] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 730/730 transitions.
Graph (complete) has 867 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 13 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 53 transition count 718
Applied a total of 25 rules in 116 ms. Remains 53 /65 variables (removed 12) and now considering 718/730 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 53/65 places, 718/730 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Finished Best-First random walk after 528 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=528 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 730/730 transitions.
Applied a total of 0 rules in 45 ms. Remains 65 /65 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-05-21 19:30:16] [INFO ] Invariant cache hit.
[2024-05-21 19:30:17] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-21 19:30:17] [INFO ] Invariant cache hit.
[2024-05-21 19:30:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:17] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2024-05-21 19:30:17] [INFO ] Redundant transitions in 26 ms returned [555]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 729 rows 65 cols
[2024-05-21 19:30:17] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:30:18] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 729/730 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 727
Applied a total of 2 rules in 55 ms. Remains 63 /65 variables (removed 2) and now considering 727/729 (removed 2) transitions.
// Phase 1: matrix 727 rows 63 cols
[2024-05-21 19:30:18] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:30:18] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-21 19:30:18] [INFO ] Invariant cache hit.
[2024-05-21 19:30:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:19] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/65 places, 727/730 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2480 ms. Remains : 63/65 places, 727/730 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 553 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 792791 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :{}
Probabilistic random walk after 792791 steps, saw 125635 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:30:22] [INFO ] Invariant cache hit.
[2024-05-21 19:30:22] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:30:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:30:22] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:30:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:23] [INFO ] After 88ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:30:23] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-21 19:30:23] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 727/727 transitions.
Graph (complete) has 860 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 725
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 12 place count 62 transition count 715
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 52 transition count 715
Applied a total of 22 rules in 81 ms. Remains 52 /63 variables (removed 11) and now considering 715/727 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 52/63 places, 715/727 transitions.
Finished random walk after 2734 steps, including 16 resets, run visited all 1 properties in 32 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1910 reset in 355 ms.
Product exploration explored 100000 steps with 571 reset in 222 ms.
Built C files in :
/tmp/ltsmin15630142373325859746
[2024-05-21 19:30:24] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2024-05-21 19:30:24] [INFO ] Computation of Complete disable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:24] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2024-05-21 19:30:24] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:24] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2024-05-21 19:30:24] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:24] [INFO ] Built C files in 323ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15630142373325859746
Running compilation step : cd /tmp/ltsmin15630142373325859746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15630142373325859746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15630142373325859746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 727/727 transitions.
Applied a total of 0 rules in 51 ms. Remains 63 /63 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-05-21 19:30:27] [INFO ] Invariant cache hit.
[2024-05-21 19:30:27] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 19:30:27] [INFO ] Invariant cache hit.
[2024-05-21 19:30:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:30:28] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2024-05-21 19:30:28] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-21 19:30:28] [INFO ] Invariant cache hit.
[2024-05-21 19:30:29] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1503 ms. Remains : 63/63 places, 727/727 transitions.
Built C files in :
/tmp/ltsmin6355353193407801760
[2024-05-21 19:30:29] [INFO ] Computing symmetric may disable matrix : 727 transitions.
[2024-05-21 19:30:29] [INFO ] Computation of Complete disable matrix. took 91 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:29] [INFO ] Computing symmetric may enable matrix : 727 transitions.
[2024-05-21 19:30:29] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:29] [INFO ] Computing Do-Not-Accords matrix : 727 transitions.
[2024-05-21 19:30:29] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:30:29] [INFO ] Built C files in 392ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6355353193407801760
Running compilation step : cd /tmp/ltsmin6355353193407801760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6355353193407801760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6355353193407801760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:30:32] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:30:32] [INFO ] Flatten gal took : 98 ms
[2024-05-21 19:30:32] [INFO ] Time to serialize gal into /tmp/LTL8209587182716153279.gal : 12 ms
[2024-05-21 19:30:32] [INFO ] Time to serialize properties into /tmp/LTL250844952771681031.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8209587182716153279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1077874793832233244.hoa' '-atoms' '/tmp/LTL250844952771681031.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL250844952771681031.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1077874793832233244.hoa
Detected timeout of ITS tools.
[2024-05-21 19:30:47] [INFO ] Flatten gal took : 93 ms
[2024-05-21 19:30:48] [INFO ] Flatten gal took : 93 ms
[2024-05-21 19:30:48] [INFO ] Time to serialize gal into /tmp/LTL4583175586568375103.gal : 11 ms
[2024-05-21 19:30:48] [INFO ] Time to serialize properties into /tmp/LTL9577759304585365834.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4583175586568375103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9577759304585365834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p6==0)||(p19==0))||((p246==0)||(p348==0)))"))))
Formula 0 simplified : FG!"(((p6==0)||(p19==0))||((p246==0)||(p348==0)))"
Detected timeout of ITS tools.
[2024-05-21 19:31:03] [INFO ] Flatten gal took : 98 ms
[2024-05-21 19:31:03] [INFO ] Applying decomposition
[2024-05-21 19:31:03] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4729264921005442975.txt' '-o' '/tmp/graph4729264921005442975.bin' '-w' '/tmp/graph4729264921005442975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4729264921005442975.bin' '-l' '-1' '-v' '-w' '/tmp/graph4729264921005442975.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:31:03] [INFO ] Decomposing Gal with order
[2024-05-21 19:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:31:03] [INFO ] Removed a total of 5424 redundant transitions.
[2024-05-21 19:31:03] [INFO ] Flatten gal took : 144 ms
[2024-05-21 19:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 29 ms.
[2024-05-21 19:31:03] [INFO ] Time to serialize gal into /tmp/LTL7971656274291020044.gal : 14 ms
[2024-05-21 19:31:03] [INFO ] Time to serialize properties into /tmp/LTL9939462220330819072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7971656274291020044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9939462220330819072.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u0.p6==0)||(u0.p19==0))||((i3.u13.p246==0)||(u0.p348==0)))"))))
Formula 0 simplified : FG!"(((u0.p6==0)||(u0.p19==0))||((i3.u13.p246==0)||(u0.p348==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5033585022314822852
[2024-05-21 19:31:18] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5033585022314822852
Running compilation step : cd /tmp/ltsmin5033585022314822852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033585022314822852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033585022314822852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-10 finished in 72031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 287 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 331 place count 162 transition count 980
Iterating global reduction 3 with 3 rules applied. Total rules applied 334 place count 162 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 161 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 161 transition count 971
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 338 place count 161 transition count 969
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 339 place count 160 transition count 969
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 465 place count 97 transition count 905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 466 place count 97 transition count 904
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 479 place count 84 transition count 791
Iterating global reduction 6 with 13 rules applied. Total rules applied 492 place count 84 transition count 791
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 500 place count 84 transition count 783
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 504 place count 82 transition count 781
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 506 place count 80 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 507 place count 79 transition count 779
Applied a total of 507 rules in 174 ms. Remains 79 /321 variables (removed 242) and now considering 779/1160 (removed 381) transitions.
// Phase 1: matrix 779 rows 79 cols
[2024-05-21 19:31:22] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 19:31:22] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-21 19:31:22] [INFO ] Invariant cache hit.
[2024-05-21 19:31:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:31:22] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [74, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 668 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/321 places, 779/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 778
Applied a total of 2 rules in 45 ms. Remains 76 /77 variables (removed 1) and now considering 778/779 (removed 1) transitions.
// Phase 1: matrix 778 rows 76 cols
[2024-05-21 19:31:22] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 19:31:23] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-21 19:31:23] [INFO ] Invariant cache hit.
[2024-05-21 19:31:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:23] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/321 places, 778/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1507 ms. Remains : 76/321 places, 778/1160 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s13 1) (NEQ s22 1) (NEQ s26 1) (NEQ s33 1) (NEQ s42 1) (NEQ s48 1) (NEQ s54 1) (NEQ s58 1) (NEQ s65 1) (NEQ s72 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 52 reset in 80 ms.
Product exploration explored 100000 steps with 522 reset in 178 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 405 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Finished Best-First random walk after 2088 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=522 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 778/778 transitions.
Applied a total of 0 rules in 37 ms. Remains 76 /76 variables (removed 0) and now considering 778/778 (removed 0) transitions.
[2024-05-21 19:31:24] [INFO ] Invariant cache hit.
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-21 19:31:24] [INFO ] Invariant cache hit.
[2024-05-21 19:31:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:24] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-21 19:31:24] [INFO ] Redundant transitions in 27 ms returned [568]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 777 rows 76 cols
[2024-05-21 19:31:24] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 19:31:25] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/76 places, 777/778 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 775
Applied a total of 2 rules in 44 ms. Remains 74 /76 variables (removed 2) and now considering 775/777 (removed 2) transitions.
// Phase 1: matrix 775 rows 74 cols
[2024-05-21 19:31:25] [INFO ] Computed 10 invariants in 4 ms
[2024-05-21 19:31:25] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-21 19:31:25] [INFO ] Invariant cache hit.
[2024-05-21 19:31:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:26] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/76 places, 775/778 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2126 ms. Remains : 74/76 places, 775/778 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 399 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Finished Best-First random walk after 6977 steps, including 24 resets, run visited all 1 properties in 12 ms. (steps per millisecond=581 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 534 reset in 156 ms.
Product exploration explored 100000 steps with 245 reset in 120 ms.
Built C files in :
/tmp/ltsmin9072096192381153992
[2024-05-21 19:31:27] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2024-05-21 19:31:27] [INFO ] Computation of Complete disable matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:27] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2024-05-21 19:31:27] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:27] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2024-05-21 19:31:27] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:27] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9072096192381153992
Running compilation step : cd /tmp/ltsmin9072096192381153992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9072096192381153992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9072096192381153992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 775/775 transitions.
Applied a total of 0 rules in 38 ms. Remains 74 /74 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2024-05-21 19:31:30] [INFO ] Invariant cache hit.
[2024-05-21 19:31:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 19:31:30] [INFO ] Invariant cache hit.
[2024-05-21 19:31:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:31:31] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-21 19:31:31] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-21 19:31:31] [INFO ] Invariant cache hit.
[2024-05-21 19:31:32] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1422 ms. Remains : 74/74 places, 775/775 transitions.
Built C files in :
/tmp/ltsmin16673153956132315262
[2024-05-21 19:31:32] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2024-05-21 19:31:32] [INFO ] Computation of Complete disable matrix. took 137 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:32] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2024-05-21 19:31:32] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:32] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2024-05-21 19:31:32] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:31:32] [INFO ] Built C files in 379ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16673153956132315262
Running compilation step : cd /tmp/ltsmin16673153956132315262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16673153956132315262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16673153956132315262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:31:35] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:31:35] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:31:35] [INFO ] Time to serialize gal into /tmp/LTL1567997354907115232.gal : 12 ms
[2024-05-21 19:31:35] [INFO ] Time to serialize properties into /tmp/LTL15434637383844386996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1567997354907115232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1306521723999154594.hoa' '-atoms' '/tmp/LTL15434637383844386996.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15434637383844386996.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1306521723999154594.hoa
Detected timeout of ITS tools.
[2024-05-21 19:31:51] [INFO ] Flatten gal took : 89 ms
[2024-05-21 19:31:51] [INFO ] Flatten gal took : 88 ms
[2024-05-21 19:31:51] [INFO ] Time to serialize gal into /tmp/LTL13460566541104429513.gal : 12 ms
[2024-05-21 19:31:51] [INFO ] Time to serialize properties into /tmp/LTL4935426363443577756.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13460566541104429513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4935426363443577756.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((p65!=1)||(p102!=1))||((p127!=1)||(p158!=1)))||(((p195!=1)||(p226!=1))||((p257!=1)||(p282!=1))))||((p313!=1)||(p349!=1)))"...159
Formula 0 simplified : FG!"(((((p65!=1)||(p102!=1))||((p127!=1)||(p158!=1)))||(((p195!=1)||(p226!=1))||((p257!=1)||(p282!=1))))||((p313!=1)||(p349!=1)))"
Detected timeout of ITS tools.
[2024-05-21 19:32:06] [INFO ] Flatten gal took : 99 ms
[2024-05-21 19:32:06] [INFO ] Applying decomposition
[2024-05-21 19:32:06] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16096475114961726096.txt' '-o' '/tmp/graph16096475114961726096.bin' '-w' '/tmp/graph16096475114961726096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16096475114961726096.bin' '-l' '-1' '-v' '-w' '/tmp/graph16096475114961726096.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:32:06] [INFO ] Decomposing Gal with order
[2024-05-21 19:32:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:32:06] [INFO ] Removed a total of 5612 redundant transitions.
[2024-05-21 19:32:06] [INFO ] Flatten gal took : 124 ms
[2024-05-21 19:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 19 ms.
[2024-05-21 19:32:06] [INFO ] Time to serialize gal into /tmp/LTL6752473861811138604.gal : 2 ms
[2024-05-21 19:32:06] [INFO ] Time to serialize properties into /tmp/LTL8902250877007952357.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6752473861811138604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8902250877007952357.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((i0.u0.p65!=1)||(i0.u3.p102!=1))||((i0.u4.p127!=1)||(i0.u7.p158!=1)))||(((i0.u10.p195!=1)||(i0.u12.p226!=1))||((i0.u14.p25...224
Formula 0 simplified : FG!"(((((i0.u0.p65!=1)||(i0.u3.p102!=1))||((i0.u4.p127!=1)||(i0.u7.p158!=1)))||(((i0.u10.p195!=1)||(i0.u12.p226!=1))||((i0.u14.p257!...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1774377145970332592
[2024-05-21 19:32:21] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1774377145970332592
Running compilation step : cd /tmp/ltsmin1774377145970332592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1774377145970332592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1774377145970332592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-11 finished in 62920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 304 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 318 transition count 1043
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 1 with 163 rules applied. Total rules applied 278 place count 204 transition count 994
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 307 place count 175 transition count 994
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 307 place count 175 transition count 986
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 323 place count 167 transition count 986
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 326 place count 164 transition count 983
Iterating global reduction 3 with 3 rules applied. Total rules applied 329 place count 164 transition count 983
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 163 transition count 974
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 163 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 333 place count 163 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 480 place count 89 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 481 place count 89 transition count 897
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 499 place count 71 transition count 734
Iterating global reduction 6 with 18 rules applied. Total rules applied 517 place count 71 transition count 734
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 525 place count 71 transition count 726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 529 place count 69 transition count 724
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 531 place count 67 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 532 place count 66 transition count 722
Applied a total of 532 rules in 173 ms. Remains 66 /321 variables (removed 255) and now considering 722/1160 (removed 438) transitions.
// Phase 1: matrix 722 rows 66 cols
[2024-05-21 19:32:25] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 19:32:25] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-21 19:32:25] [INFO ] Invariant cache hit.
[2024-05-21 19:32:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:32:25] [INFO ] Implicit Places using invariants and state equation in 567 ms returned [61, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 934 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/321 places, 722/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 721
Applied a total of 2 rules in 48 ms. Remains 63 /64 variables (removed 1) and now considering 721/722 (removed 1) transitions.
// Phase 1: matrix 721 rows 63 cols
[2024-05-21 19:32:26] [INFO ] Computed 10 invariants in 5 ms
[2024-05-21 19:32:26] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 19:32:26] [INFO ] Invariant cache hit.
[2024-05-21 19:32:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:32:26] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/321 places, 721/1160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2038 ms. Remains : 63/321 places, 721/1160 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-09b-LTLFireability-12 finished in 2092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Support contains 11 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 320 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 320 transition count 1159
Applied a total of 2 rules in 17 ms. Remains 320 /321 variables (removed 1) and now considering 1159/1160 (removed 1) transitions.
// Phase 1: matrix 1159 rows 320 cols
[2024-05-21 19:32:26] [INFO ] Computed 14 invariants in 5 ms
[2024-05-21 19:32:27] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 19:32:27] [INFO ] Invariant cache hit.
[2024-05-21 19:32:28] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2024-05-21 19:32:28] [INFO ] Invariant cache hit.
[2024-05-21 19:32:28] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/321 places, 1159/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 320/321 places, 1159/1160 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s157 0), p1:(OR (EQ s59 0) (EQ s89 0) (EQ s114 0) (EQ s139 0) (EQ s159 0) (EQ s190 0) (EQ s215 0) (EQ s235 0) (EQ s265 0) (EQ s287 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 160 reset in 212 ms.
Product exploration explored 100000 steps with 91 reset in 168 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-21 19:32:30] [INFO ] Invariant cache hit.
[2024-05-21 19:32:30] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:32:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-21 19:32:30] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 7 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2024-05-21 19:32:30] [INFO ] Invariant cache hit.
[2024-05-21 19:32:30] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 19:32:30] [INFO ] Invariant cache hit.
[2024-05-21 19:32:31] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2024-05-21 19:32:31] [INFO ] Invariant cache hit.
[2024-05-21 19:32:32] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2026 ms. Remains : 320/320 places, 1159/1159 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 9348 steps, including 77 resets, run visited all 1 properties in 48 ms. (steps per millisecond=194 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 398 reset in 292 ms.
Product exploration explored 100000 steps with 215 reset in 391 ms.
Built C files in :
/tmp/ltsmin12078383314122388634
[2024-05-21 19:32:34] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12078383314122388634
Running compilation step : cd /tmp/ltsmin12078383314122388634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12078383314122388634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12078383314122388634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 1159/1159 transitions.
Applied a total of 0 rules in 9 ms. Remains 320 /320 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2024-05-21 19:32:37] [INFO ] Invariant cache hit.
[2024-05-21 19:32:37] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 19:32:37] [INFO ] Invariant cache hit.
[2024-05-21 19:32:38] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2024-05-21 19:32:38] [INFO ] Invariant cache hit.
[2024-05-21 19:32:39] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2332 ms. Remains : 320/320 places, 1159/1159 transitions.
Built C files in :
/tmp/ltsmin3163937291902547344
[2024-05-21 19:32:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3163937291902547344
Running compilation step : cd /tmp/ltsmin3163937291902547344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3163937291902547344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3163937291902547344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:32:42] [INFO ] Flatten gal took : 86 ms
[2024-05-21 19:32:42] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:32:42] [INFO ] Time to serialize gal into /tmp/LTL13347273972804736043.gal : 12 ms
[2024-05-21 19:32:42] [INFO ] Time to serialize properties into /tmp/LTL11659919245492038541.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13347273972804736043.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4351784632212322367.hoa' '-atoms' '/tmp/LTL11659919245492038541.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11659919245492038541.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4351784632212322367.hoa
Detected timeout of ITS tools.
[2024-05-21 19:32:57] [INFO ] Flatten gal took : 76 ms
[2024-05-21 19:32:57] [INFO ] Flatten gal took : 83 ms
[2024-05-21 19:32:58] [INFO ] Time to serialize gal into /tmp/LTL14166366538400951136.gal : 13 ms
[2024-05-21 19:32:58] [INFO ] Time to serialize properties into /tmp/LTL5646564206418040925.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14166366538400951136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5646564206418040925.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p187==0)")||(X(("(p187==0)")&&(G(F("(((((p65==0)||(p102==0))||((p133==0)||(p164==0)))||(((p189==0)||(p226==0))||((p257==0)||...202
Formula 0 simplified : GF(!"(p187==0)" & X(!"(p187==0)" | FG!"(((((p65==0)||(p102==0))||((p133==0)||(p164==0)))||(((p189==0)||(p226==0))||((p257==0)||(p282...190
Detected timeout of ITS tools.
[2024-05-21 19:33:13] [INFO ] Flatten gal took : 76 ms
[2024-05-21 19:33:13] [INFO ] Applying decomposition
[2024-05-21 19:33:13] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10120613154684260441.txt' '-o' '/tmp/graph10120613154684260441.bin' '-w' '/tmp/graph10120613154684260441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10120613154684260441.bin' '-l' '-1' '-v' '-w' '/tmp/graph10120613154684260441.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:33:13] [INFO ] Decomposing Gal with order
[2024-05-21 19:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:33:13] [INFO ] Removed a total of 6157 redundant transitions.
[2024-05-21 19:33:13] [INFO ] Flatten gal took : 143 ms
[2024-05-21 19:33:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 24 ms.
[2024-05-21 19:33:13] [INFO ] Time to serialize gal into /tmp/LTL7929682481172217371.gal : 4 ms
[2024-05-21 19:33:13] [INFO ] Time to serialize properties into /tmp/LTL3426215901666605723.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7929682481172217371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3426215901666605723.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i4.u59.p187==0)")||(X(("(i4.u59.p187==0)")&&(G(F("(((((i4.u20.p65==0)||(i4.u32.p102==0))||((i4.u41.p133==0)||(i4.u51.p164==0...286
Formula 0 simplified : GF(!"(i4.u59.p187==0)" & X(!"(i4.u59.p187==0)" | FG!"(((((i4.u20.p65==0)||(i4.u32.p102==0))||((i4.u41.p133==0)||(i4.u51.p164==0)))||...274
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin45328186377478336
[2024-05-21 19:33:28] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin45328186377478336
Running compilation step : cd /tmp/ltsmin45328186377478336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin45328186377478336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin45328186377478336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 64841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((!p1||X(G(!p1))))))'
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 319 transition count 1158
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 319 transition count 1158
Applied a total of 4 rules in 17 ms. Remains 319 /321 variables (removed 2) and now considering 1158/1160 (removed 2) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:33:31] [INFO ] Computed 14 invariants in 5 ms
[2024-05-21 19:33:32] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-21 19:33:32] [INFO ] Invariant cache hit.
[2024-05-21 19:33:33] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-05-21 19:33:33] [INFO ] Invariant cache hit.
[2024-05-21 19:33:34] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1158/1160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2238 ms. Remains : 319/321 places, 1158/1160 transitions.
Stuttering acceptance computed with spot in 273 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s16 1) (EQ s79 1) (EQ s285 1)), p0:(AND (EQ s4 1) (EQ s14 1) (EQ s185 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25043 reset in 640 ms.
Product exploration explored 100000 steps with 24977 reset in 514 ms.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 123 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 293725 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293725 steps, saw 53355 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 19:33:39] [INFO ] Invariant cache hit.
[2024-05-21 19:33:39] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-21 19:33:40] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-21 19:33:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-21 19:33:41] [INFO ] After 939ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 19:33:41] [INFO ] Deduced a trap composed of 31 places in 485 ms of which 2 ms to minimize.
[2024-05-21 19:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 570 ms
[2024-05-21 19:33:42] [INFO ] After 2100ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 513 ms.
[2024-05-21 19:33:42] [INFO ] After 2740ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 480 place count 88 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 88 transition count 902
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 498 place count 71 transition count 749
Iterating global reduction 4 with 17 rules applied. Total rules applied 515 place count 71 transition count 749
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 523 place count 71 transition count 741
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 70 transition count 740
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 536 place count 70 transition count 729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 547 place count 59 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 548 place count 59 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 58 transition count 728
Applied a total of 549 rules in 226 ms. Remains 58 /319 variables (removed 261) and now considering 728/1158 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 58/319 places, 728/1158 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Finished Best-First random walk after 3600 steps, including 2 resets, run visited all 4 properties in 8 ms. (steps per millisecond=450 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2024-05-21 19:33:43] [INFO ] Invariant cache hit.
[2024-05-21 19:33:44] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-21 19:33:44] [INFO ] Invariant cache hit.
[2024-05-21 19:33:45] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2024-05-21 19:33:45] [INFO ] Invariant cache hit.
[2024-05-21 19:33:46] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2305 ms. Remains : 319/319 places, 1158/1158 transitions.
Computed a total of 48 stabilizing places and 49 stable transitions
Computed a total of 48 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 313536 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313536 steps, saw 56842 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 19:33:49] [INFO ] Invariant cache hit.
[2024-05-21 19:33:49] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2024-05-21 19:33:50] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 19:33:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-21 19:33:51] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 1 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2024-05-21 19:33:52] [INFO ] After 1492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2024-05-21 19:33:52] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1578 edges and 317 vertex of which 315 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 315 transition count 1037
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 169 rules applied. Total rules applied 288 place count 200 transition count 983
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 320 place count 168 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 320 place count 168 transition count 977
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 332 place count 162 transition count 977
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 480 place count 88 transition count 903
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 88 transition count 902
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 498 place count 71 transition count 749
Iterating global reduction 4 with 17 rules applied. Total rules applied 515 place count 71 transition count 749
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 523 place count 71 transition count 741
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 70 transition count 740
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 536 place count 70 transition count 729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 547 place count 59 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 548 place count 59 transition count 729
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 58 transition count 728
Applied a total of 549 rules in 215 ms. Remains 58 /319 variables (removed 261) and now considering 728/1158 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 58/319 places, 728/1158 transitions.
Finished random walk after 1030 steps, including 7 resets, run visited all 2 properties in 29 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 33335 reset in 303 ms.
Product exploration explored 100000 steps with 33429 reset in 320 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Graph (trivial) has 300 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 317 transition count 1156
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 136 place count 317 transition count 1135
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 136 place count 317 transition count 1135
Deduced a syphon composed of 137 places in 1 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 159 place count 317 transition count 1135
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 257 place count 219 transition count 1037
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 355 place count 219 transition count 1037
Performed 89 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 444 place count 219 transition count 1048
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 446 place count 219 transition count 1046
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 521 place count 144 transition count 835
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 3 with 75 rules applied. Total rules applied 596 place count 144 transition count 835
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 612 place count 144 transition count 819
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 621 place count 135 transition count 810
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 630 place count 135 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 631 place count 135 transition count 810
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 633 place count 133 transition count 808
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 635 place count 133 transition count 808
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 636 place count 133 transition count 810
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 636 rules in 151 ms. Remains 133 /319 variables (removed 186) and now considering 810/1158 (removed 348) transitions.
[2024-05-21 19:33:54] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 810 rows 133 cols
[2024-05-21 19:33:54] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 19:33:54] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/319 places, 810/1158 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 133/319 places, 810/1158 transitions.
Built C files in :
/tmp/ltsmin11574308738865384910
[2024-05-21 19:33:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11574308738865384910
Running compilation step : cd /tmp/ltsmin11574308738865384910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11574308738865384910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11574308738865384910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 319 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1158/1158 transitions.
Applied a total of 0 rules in 8 ms. Remains 319 /319 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
// Phase 1: matrix 1158 rows 319 cols
[2024-05-21 19:33:57] [INFO ] Computed 14 invariants in 4 ms
[2024-05-21 19:33:58] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-21 19:33:58] [INFO ] Invariant cache hit.
[2024-05-21 19:33:59] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2024-05-21 19:33:59] [INFO ] Invariant cache hit.
[2024-05-21 19:34:00] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2252 ms. Remains : 319/319 places, 1158/1158 transitions.
Built C files in :
/tmp/ltsmin17823709648352194360
[2024-05-21 19:34:00] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17823709648352194360
Running compilation step : cd /tmp/ltsmin17823709648352194360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17823709648352194360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17823709648352194360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:34:03] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:34:03] [INFO ] Flatten gal took : 78 ms
[2024-05-21 19:34:03] [INFO ] Time to serialize gal into /tmp/LTL2469457376967168137.gal : 13 ms
[2024-05-21 19:34:03] [INFO ] Time to serialize properties into /tmp/LTL2739013637017689214.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2469457376967168137.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2226523358306278630.hoa' '-atoms' '/tmp/LTL2739013637017689214.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2739013637017689214.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2226523358306278630.hoa
Detected timeout of ITS tools.
[2024-05-21 19:34:18] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:34:18] [INFO ] Flatten gal took : 79 ms
[2024-05-21 19:34:18] [INFO ] Time to serialize gal into /tmp/LTL11696168284052386238.gal : 13 ms
[2024-05-21 19:34:18] [INFO ] Time to serialize properties into /tmp/LTL14754154624563915713.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11696168284052386238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14754154624563915713.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X("(((p6==1)&&(p17==1))&&((p222==1)&&(p348==1)))"))U(G((!("(((p6==1)&&(p19==1))&&((p91==1)&&(p348==1)))"))||(X(G(!("(((p6==1)&&(p1...194
Formula 0 simplified : X!"(((p6==1)&&(p17==1))&&((p222==1)&&(p348==1)))" R F("(((p6==1)&&(p19==1))&&((p91==1)&&(p348==1)))" & XF"(((p6==1)&&(p19==1))&&((p9...175
Detected timeout of ITS tools.
[2024-05-21 19:34:33] [INFO ] Flatten gal took : 78 ms
[2024-05-21 19:34:33] [INFO ] Applying decomposition
[2024-05-21 19:34:33] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9382285966884543953.txt' '-o' '/tmp/graph9382285966884543953.bin' '-w' '/tmp/graph9382285966884543953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9382285966884543953.bin' '-l' '-1' '-v' '-w' '/tmp/graph9382285966884543953.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:34:34] [INFO ] Decomposing Gal with order
[2024-05-21 19:34:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:34:34] [INFO ] Removed a total of 6144 redundant transitions.
[2024-05-21 19:34:34] [INFO ] Flatten gal took : 158 ms
[2024-05-21 19:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 27 ms.
[2024-05-21 19:34:34] [INFO ] Time to serialize gal into /tmp/LTL17415201033879891201.gal : 6 ms
[2024-05-21 19:34:34] [INFO ] Time to serialize properties into /tmp/LTL3190711487651609976.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17415201033879891201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3190711487651609976.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(((i5.u1.p6==1)&&(i5.u1.p17==1))&&((i4.u68.p222==1)&&(i5.u1.p348==1)))"))U(G((!("(((i5.u1.p6==1)&&(i5.u1.p19==1))&&((i1.u27.p91...269
Formula 0 simplified : X!"(((i5.u1.p6==1)&&(i5.u1.p17==1))&&((i4.u68.p222==1)&&(i5.u1.p348==1)))" R F("(((i5.u1.p6==1)&&(i5.u1.p19==1))&&((i1.u27.p91==1)&&...250
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5087865153951207430
[2024-05-21 19:34:49] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5087865153951207430
Running compilation step : cd /tmp/ltsmin5087865153951207430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5087865153951207430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5087865153951207430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-15 finished in 80628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1) U X(p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-08
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 302 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 318 transition count 1044
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 164 rules applied. Total rules applied 278 place count 205 transition count 993
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 31 rules applied. Total rules applied 309 place count 175 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 174 transition count 992
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 310 place count 174 transition count 986
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 322 place count 168 transition count 986
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 325 place count 165 transition count 983
Iterating global reduction 4 with 3 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 329 place count 164 transition count 974
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 164 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 332 place count 164 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 333 place count 163 transition count 972
Performed 72 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 477 place count 91 transition count 899
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 478 place count 91 transition count 898
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 495 place count 74 transition count 744
Iterating global reduction 7 with 17 rules applied. Total rules applied 512 place count 74 transition count 744
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 519 place count 74 transition count 737
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 523 place count 72 transition count 735
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 525 place count 70 transition count 733
Applied a total of 525 rules in 152 ms. Remains 70 /321 variables (removed 251) and now considering 733/1160 (removed 427) transitions.
// Phase 1: matrix 733 rows 70 cols
[2024-05-21 19:34:53] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 19:34:53] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 19:34:53] [INFO ] Invariant cache hit.
[2024-05-21 19:34:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:34:53] [INFO ] Implicit Places using invariants and state equation in 554 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 907 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/321 places, 733/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 732
Applied a total of 2 rules in 23 ms. Remains 67 /68 variables (removed 1) and now considering 732/733 (removed 1) transitions.
// Phase 1: matrix 732 rows 67 cols
[2024-05-21 19:34:54] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:34:54] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-21 19:34:54] [INFO ] Invariant cache hit.
[2024-05-21 19:34:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:34:54] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 67/321 places, 732/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1998 ms. Remains : 67/321 places, 732/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s55 1), p0:(OR (EQ s1 0) (EQ s8 0) (EQ s53 0) (EQ s63 0))], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 638 reset in 156 ms.
Product exploration explored 100000 steps with 671 reset in 191 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 505 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:34:55] [INFO ] Invariant cache hit.
[2024-05-21 19:34:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:34:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:34:55] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:34:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:34:56] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:34:56] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-21 19:34:56] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 732/732 transitions.
Graph (complete) has 869 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 727
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 27 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 53 transition count 718
Applied a total of 29 rules in 118 ms. Remains 53 /67 variables (removed 14) and now considering 718/732 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 53/67 places, 718/732 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Finished Best-First random walk after 706 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=353 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 732/732 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-21 19:34:56] [INFO ] Invariant cache hit.
[2024-05-21 19:34:57] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 19:34:57] [INFO ] Invariant cache hit.
[2024-05-21 19:34:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:34:57] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2024-05-21 19:34:57] [INFO ] Invariant cache hit.
[2024-05-21 19:34:58] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1272 ms. Remains : 67/67 places, 732/732 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 513 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:34:58] [INFO ] Invariant cache hit.
[2024-05-21 19:34:58] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:34:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:34:58] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:34:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:34:59] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:34:59] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-21 19:34:59] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 732/732 transitions.
Graph (complete) has 869 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 66 transition count 727
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 64 transition count 727
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 64 transition count 717
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 27 place count 54 transition count 717
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 54 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 53 transition count 718
Applied a total of 29 rules in 118 ms. Remains 53 /67 variables (removed 14) and now considering 718/732 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 53/67 places, 718/732 transitions.
Finished random walk after 3157 steps, including 33 resets, run visited all 1 properties in 37 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 355 reset in 126 ms.
Product exploration explored 100000 steps with 78 reset in 107 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 732/732 transitions.
Applied a total of 0 rules in 44 ms. Remains 67 /67 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-21 19:35:00] [INFO ] Redundant transitions in 27 ms returned [558]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 731 rows 67 cols
[2024-05-21 19:35:00] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:35:00] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/67 places, 731/732 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 58 ms. Remains 67 /67 variables (removed 0) and now considering 733/731 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/67 places, 733/732 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 680 ms. Remains : 67/67 places, 733/732 transitions.
Built C files in :
/tmp/ltsmin6088640013383370619
[2024-05-21 19:35:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6088640013383370619
Running compilation step : cd /tmp/ltsmin6088640013383370619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6088640013383370619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6088640013383370619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 732/732 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 732/732 (removed 0) transitions.
// Phase 1: matrix 732 rows 67 cols
[2024-05-21 19:35:04] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:35:04] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-21 19:35:04] [INFO ] Invariant cache hit.
[2024-05-21 19:35:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:35:04] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2024-05-21 19:35:04] [INFO ] Invariant cache hit.
[2024-05-21 19:35:05] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1302 ms. Remains : 67/67 places, 732/732 transitions.
Built C files in :
/tmp/ltsmin17034312495426382100
[2024-05-21 19:35:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17034312495426382100
Running compilation step : cd /tmp/ltsmin17034312495426382100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17034312495426382100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17034312495426382100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:35:08] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:35:08] [INFO ] Flatten gal took : 91 ms
[2024-05-21 19:35:08] [INFO ] Time to serialize gal into /tmp/LTL1671324925342230787.gal : 11 ms
[2024-05-21 19:35:08] [INFO ] Time to serialize properties into /tmp/LTL1034646728844559965.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1671324925342230787.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9388892782645989049.hoa' '-atoms' '/tmp/LTL1034646728844559965.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1034646728844559965.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9388892782645989049.hoa
Detected timeout of ITS tools.
[2024-05-21 19:35:23] [INFO ] Flatten gal took : 96 ms
[2024-05-21 19:35:23] [INFO ] Flatten gal took : 91 ms
[2024-05-21 19:35:23] [INFO ] Time to serialize gal into /tmp/LTL13091666169364483522.gal : 21 ms
[2024-05-21 19:35:23] [INFO ] Time to serialize properties into /tmp/LTL17207839501286659358.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13091666169364483522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17207839501286659358.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((p6==0)||(p18==0))||((p296==0)||(p348==0)))")||(X(G("(p304==1)")))))))
Formula 0 simplified : XF(!"(((p6==0)||(p18==0))||((p296==0)||(p348==0)))" & XF!"(p304==1)")
Detected timeout of ITS tools.
[2024-05-21 19:35:39] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:35:39] [INFO ] Applying decomposition
[2024-05-21 19:35:39] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4526042288407114795.txt' '-o' '/tmp/graph4526042288407114795.bin' '-w' '/tmp/graph4526042288407114795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4526042288407114795.bin' '-l' '-1' '-v' '-w' '/tmp/graph4526042288407114795.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:35:39] [INFO ] Decomposing Gal with order
[2024-05-21 19:35:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:35:39] [INFO ] Removed a total of 5424 redundant transitions.
[2024-05-21 19:35:39] [INFO ] Flatten gal took : 111 ms
[2024-05-21 19:35:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 25 ms.
[2024-05-21 19:35:39] [INFO ] Time to serialize gal into /tmp/LTL3005088012360636184.gal : 7 ms
[2024-05-21 19:35:39] [INFO ] Time to serialize properties into /tmp/LTL16825901258236700435.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3005088012360636184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16825901258236700435.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((u0.p6==0)||(u0.p18==0))||((i3.u17.p296==0)||(u0.p348==0)))")||(X(G("(i3.u18.p304==1)")))))))
Formula 0 simplified : XF(!"(((u0.p6==0)||(u0.p18==0))||((i3.u17.p296==0)||(u0.p348==0)))" & XF!"(i3.u18.p304==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12536015636063971838
[2024-05-21 19:35:54] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12536015636063971838
Running compilation step : cd /tmp/ltsmin12536015636063971838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12536015636063971838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12536015636063971838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-08 finished in 64972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p0&&G(F(p1))))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-13
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 11 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 286 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 318 transition count 1041
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 168 rules applied. Total rules applied 285 place count 202 transition count 989
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 316 place count 171 transition count 989
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 316 place count 171 transition count 983
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 165 transition count 983
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 163 transition count 981
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 63 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 463 place count 98 transition count 906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 464 place count 98 transition count 905
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 479 place count 83 transition count 772
Iterating global reduction 6 with 15 rules applied. Total rules applied 494 place count 83 transition count 772
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 502 place count 83 transition count 764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 506 place count 81 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 508 place count 79 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 509 place count 78 transition count 760
Applied a total of 509 rules in 127 ms. Remains 78 /321 variables (removed 243) and now considering 760/1160 (removed 400) transitions.
// Phase 1: matrix 760 rows 78 cols
[2024-05-21 19:35:58] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 19:35:58] [INFO ] Invariant cache hit.
[2024-05-21 19:35:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:35:58] [INFO ] Implicit Places using invariants and state equation in 444 ms returned [73, 77]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 661 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 76/321 places, 760/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 759
Applied a total of 2 rules in 21 ms. Remains 75 /76 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 75 cols
[2024-05-21 19:35:58] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 19:35:59] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 19:35:59] [INFO ] Invariant cache hit.
[2024-05-21 19:35:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:35:59] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/321 places, 759/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1404 ms. Remains : 75/321 places, 759/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s36 0), p1:(OR (EQ s13 0) (EQ s22 0) (EQ s28 0) (EQ s34 0) (EQ s38 0) (EQ s48 0) (EQ s54 0) (EQ s58 0) (EQ s67 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 67 ms.
Product exploration explored 100000 steps with 643 reset in 186 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 383 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:36:00] [INFO ] Invariant cache hit.
[2024-05-21 19:36:00] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:36:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:00] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 759/759 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-21 19:36:00] [INFO ] Invariant cache hit.
[2024-05-21 19:36:00] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 19:36:00] [INFO ] Invariant cache hit.
[2024-05-21 19:36:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:36:01] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-21 19:36:01] [INFO ] Invariant cache hit.
[2024-05-21 19:36:01] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1211 ms. Remains : 75/75 places, 759/759 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 232 steps, including 8 resets, run visited all 1 properties in 3 ms. (steps per millisecond=77 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 18042 steps with 689 reset in 136 ms.
Treatment of property AutonomousCar-PT-09b-LTLFireability-13 finished in 4614 ms.
FORMULA AutonomousCar-PT-09b-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((!p1||X(G(!p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-09b-LTLFireability-15
Stuttering acceptance computed with spot in 202 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Support contains 6 out of 321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 321/321 places, 1160/1160 transitions.
Graph (trivial) has 302 edges and 321 vertex of which 4 / 321 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 318 transition count 1042
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 1 with 167 rules applied. Total rules applied 283 place count 203 transition count 990
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 314 place count 172 transition count 990
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 314 place count 172 transition count 984
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 326 place count 166 transition count 984
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 329 place count 163 transition count 981
Iterating global reduction 3 with 3 rules applied. Total rules applied 332 place count 163 transition count 981
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 162 transition count 972
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 162 transition count 972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 rules applied. Total rules applied 336 place count 162 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 337 place count 161 transition count 970
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 479 place count 90 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 480 place count 90 transition count 897
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 496 place count 74 transition count 753
Iterating global reduction 6 with 16 rules applied. Total rules applied 512 place count 74 transition count 753
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 519 place count 74 transition count 746
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 523 place count 72 transition count 744
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 524 place count 72 transition count 744
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 70 transition count 742
Applied a total of 526 rules in 138 ms. Remains 70 /321 variables (removed 251) and now considering 742/1160 (removed 418) transitions.
// Phase 1: matrix 742 rows 70 cols
[2024-05-21 19:36:02] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 19:36:03] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-21 19:36:03] [INFO ] Invariant cache hit.
[2024-05-21 19:36:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:36:03] [INFO ] Implicit Places using invariants and state equation in 550 ms returned [65, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 879 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/321 places, 742/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 741
Applied a total of 2 rules in 21 ms. Remains 67 /68 variables (removed 1) and now considering 741/742 (removed 1) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-21 19:36:03] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:36:04] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 19:36:04] [INFO ] Invariant cache hit.
[2024-05-21 19:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:36:04] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 67/321 places, 741/1160 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1917 ms. Remains : 67/321 places, 741/1160 transitions.
Running random walk in product with property : AutonomousCar-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s9 1) (EQ s18 1) (EQ s63 1)), p0:(AND (EQ s1 1) (EQ s7 1) (EQ s42 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24957 reset in 519 ms.
Product exploration explored 100000 steps with 24962 reset in 527 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 p0), true]
Incomplete random walk after 10000 steps, including 537 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 458821 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458821 steps, saw 76266 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 19:36:09] [INFO ] Invariant cache hit.
[2024-05-21 19:36:09] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:09] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-21 19:36:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:10] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 19:36:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:36:11] [INFO ] After 372ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-21 19:36:11] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 373 ms.
[2024-05-21 19:36:11] [INFO ] After 1823ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 741/741 transitions.
Graph (complete) has 880 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 738
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 14 place count 66 transition count 727
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 55 transition count 727
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 55 transition count 728
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 54 transition count 728
Applied a total of 27 rules in 118 ms. Remains 54 /67 variables (removed 13) and now considering 728/741 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 54/67 places, 728/741 transitions.
Incomplete random walk after 10000 steps, including 84 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 728 rows 54 cols
[2024-05-21 19:36:12] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 19:36:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:12] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:36:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:13] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:36:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:36:13] [INFO ] After 95ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:36:13] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-21 19:36:13] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 36 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 54/54 places, 728/728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 842259 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 842259 steps, saw 120502 distinct states, run finished after 3003 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 19:36:16] [INFO ] Invariant cache hit.
[2024-05-21 19:36:16] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 19:36:16] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:36:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:17] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:36:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:36:17] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 19:36:17] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-21 19:36:17] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 41 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 54/54 places, 728/728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 35 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
[2024-05-21 19:36:17] [INFO ] Invariant cache hit.
[2024-05-21 19:36:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 19:36:17] [INFO ] Invariant cache hit.
[2024-05-21 19:36:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:36:18] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-05-21 19:36:18] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-21 19:36:18] [INFO ] Invariant cache hit.
[2024-05-21 19:36:18] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1239 ms. Remains : 54/54 places, 728/728 transitions.
Applied a total of 0 rules in 36 ms. Remains 54 /54 variables (removed 0) and now considering 728/728 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 19:36:18] [INFO ] Invariant cache hit.
[2024-05-21 19:36:18] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 19:36:19] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 19:36:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 19:36:19] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 19:36:19] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-21 19:36:19] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 741/741 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 741/741 (removed 0) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-21 19:36:20] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:36:20] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-21 19:36:20] [INFO ] Invariant cache hit.
[2024-05-21 19:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:36:21] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-21 19:36:21] [INFO ] Invariant cache hit.
[2024-05-21 19:36:21] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1239 ms. Remains : 67/67 places, 741/741 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 520 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Finished Best-First random walk after 9326 steps, including 30 resets, run visited all 2 properties in 16 ms. (steps per millisecond=582 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 33305 reset in 471 ms.
Product exploration explored 100000 steps with 33438 reset in 487 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1, p1, true]
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 741/741 transitions.
Applied a total of 0 rules in 46 ms. Remains 67 /67 variables (removed 0) and now considering 741/741 (removed 0) transitions.
[2024-05-21 19:36:23] [INFO ] Redundant transitions in 27 ms returned [557]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 740 rows 67 cols
[2024-05-21 19:36:23] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 19:36:24] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/67 places, 740/741 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 742
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 81 ms. Remains 67 /67 variables (removed 0) and now considering 742/740 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/67 places, 742/741 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 910 ms. Remains : 67/67 places, 742/741 transitions.
Built C files in :
/tmp/ltsmin13924930666731587551
[2024-05-21 19:36:24] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13924930666731587551
Running compilation step : cd /tmp/ltsmin13924930666731587551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13924930666731587551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13924930666731587551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 741/741 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 741/741 (removed 0) transitions.
// Phase 1: matrix 741 rows 67 cols
[2024-05-21 19:36:27] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 19:36:28] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-21 19:36:28] [INFO ] Invariant cache hit.
[2024-05-21 19:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:36:28] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2024-05-21 19:36:28] [INFO ] Invariant cache hit.
[2024-05-21 19:36:29] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 67/67 places, 741/741 transitions.
Built C files in :
/tmp/ltsmin2083383089987211963
[2024-05-21 19:36:29] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2083383089987211963
Running compilation step : cd /tmp/ltsmin2083383089987211963;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2083383089987211963;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2083383089987211963;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-21 19:36:32] [INFO ] Flatten gal took : 97 ms
[2024-05-21 19:36:32] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:36:32] [INFO ] Time to serialize gal into /tmp/LTL13454891212834933583.gal : 10 ms
[2024-05-21 19:36:32] [INFO ] Time to serialize properties into /tmp/LTL6617455080211220487.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13454891212834933583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18296795978125972294.hoa' '-atoms' '/tmp/LTL6617455080211220487.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6617455080211220487.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18296795978125972294.hoa
Detected timeout of ITS tools.
[2024-05-21 19:36:47] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:36:47] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:36:47] [INFO ] Time to serialize gal into /tmp/LTL1139011650912256827.gal : 11 ms
[2024-05-21 19:36:47] [INFO ] Time to serialize properties into /tmp/LTL6372500706660773632.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1139011650912256827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6372500706660773632.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X("(((p6==1)&&(p17==1))&&((p222==1)&&(p348==1)))"))U(G((!("(((p6==1)&&(p19==1))&&((p91==1)&&(p348==1)))"))||(X(G(!("(((p6==1)&&(p1...194
Formula 0 simplified : X!"(((p6==1)&&(p17==1))&&((p222==1)&&(p348==1)))" R F("(((p6==1)&&(p19==1))&&((p91==1)&&(p348==1)))" & XF"(((p6==1)&&(p19==1))&&((p9...175
Detected timeout of ITS tools.
[2024-05-21 19:37:02] [INFO ] Flatten gal took : 90 ms
[2024-05-21 19:37:02] [INFO ] Applying decomposition
[2024-05-21 19:37:02] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12685800493528657972.txt' '-o' '/tmp/graph12685800493528657972.bin' '-w' '/tmp/graph12685800493528657972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12685800493528657972.bin' '-l' '-1' '-v' '-w' '/tmp/graph12685800493528657972.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:37:03] [INFO ] Decomposing Gal with order
[2024-05-21 19:37:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:37:03] [INFO ] Removed a total of 5432 redundant transitions.
[2024-05-21 19:37:03] [INFO ] Flatten gal took : 108 ms
[2024-05-21 19:37:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 24 ms.
[2024-05-21 19:37:03] [INFO ] Time to serialize gal into /tmp/LTL3510986853635246518.gal : 5 ms
[2024-05-21 19:37:03] [INFO ] Time to serialize properties into /tmp/LTL4540522657307428999.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3510986853635246518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4540522657307428999.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X("(((u0.p6==1)&&(u0.p17==1))&&((u11.p222==1)&&(u0.p348==1)))"))U(G((!("(((u0.p6==1)&&(u0.p19==1))&&((u4.p91==1)&&(u0.p348==1)))")...231
Formula 0 simplified : X!"(((u0.p6==1)&&(u0.p17==1))&&((u11.p222==1)&&(u0.p348==1)))" R F("(((u0.p6==1)&&(u0.p19==1))&&((u4.p91==1)&&(u0.p348==1)))" & XF"(...212
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15347494704194395852
[2024-05-21 19:37:18] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15347494704194395852
Running compilation step : cd /tmp/ltsmin15347494704194395852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347494704194395852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15347494704194395852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property AutonomousCar-PT-09b-LTLFireability-15 finished in 78915 ms.
[2024-05-21 19:37:21] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1661645215735778192
[2024-05-21 19:37:21] [INFO ] Computing symmetric may disable matrix : 1160 transitions.
[2024-05-21 19:37:21] [INFO ] Applying decomposition
[2024-05-21 19:37:21] [INFO ] Computation of Complete disable matrix. took 116 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:37:21] [INFO ] Flatten gal took : 94 ms
[2024-05-21 19:37:21] [INFO ] Computing symmetric may enable matrix : 1160 transitions.
[2024-05-21 19:37:21] [INFO ] Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6258633416298791619.txt' '-o' '/tmp/graph6258633416298791619.bin' '-w' '/tmp/graph6258633416298791619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6258633416298791619.bin' '-l' '-1' '-v' '-w' '/tmp/graph6258633416298791619.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:37:21] [INFO ] Decomposing Gal with order
[2024-05-21 19:37:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:37:21] [INFO ] Computing Do-Not-Accords matrix : 1160 transitions.
[2024-05-21 19:37:21] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:37:21] [INFO ] Built C files in 546ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1661645215735778192
Running compilation step : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 19:37:22] [INFO ] Removed a total of 6036 redundant transitions.
[2024-05-21 19:37:22] [INFO ] Flatten gal took : 146 ms
[2024-05-21 19:37:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 22 ms.
[2024-05-21 19:37:22] [INFO ] Time to serialize gal into /tmp/LTLFireability2261456639573886822.gal : 4 ms
[2024-05-21 19:37:22] [INFO ] Time to serialize properties into /tmp/LTLFireability8786323819335305221.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2261456639573886822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8786323819335305221.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 6 LTL properties
Checking formula 0 : !((G(F(("(((i0.u2.p6==0)||(i0.u2.p17==0))||((i0.u63.p222==0)||(i0.u2.p348==0)))")||((G("(((((i6.u18.p65==1)&&(i6.u29.p102==1))&&((i6.u...515
Formula 0 simplified : FG(!"(((i0.u2.p6==0)||(i0.u2.p17==0))||((i0.u63.p222==0)||(i0.u2.p348==0)))" & (F!"(((((i6.u18.p65==1)&&(i6.u29.p102==1))&&((i6.u35....506
Compilation finished in 8939 ms.
Running link step : cd /tmp/ltsmin1661645215735778192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((([]((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((([]((LTLAPp1==true)) U X((LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X([]((LTLAPp5==true)))||(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 20:01:25] [INFO ] Applying decomposition
[2024-05-21 20:01:27] [INFO ] Flatten gal took : 1259 ms
[2024-05-21 20:01:27] [INFO ] Decomposing Gal with order
[2024-05-21 20:01:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:01:30] [INFO ] Removed a total of 6355 redundant transitions.
[2024-05-21 20:01:30] [INFO ] Flatten gal took : 1649 ms
[2024-05-21 20:01:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 274 ms.
[2024-05-21 20:01:31] [INFO ] Time to serialize gal into /tmp/LTLFireability2936811901750277175.gal : 50 ms
[2024-05-21 20:01:32] [INFO ] Time to serialize properties into /tmp/LTLFireability11651218358739565111.ltl : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2936811901750277175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11651218358739565111.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((G(F(("(((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u19.p222==0)||(i1.i0.u23.p348==0)))")||((G("(((((i1.i0.i0.i0.i0.i0.i0.i...858
Formula 0 simplified : FG(!"(((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u19.p222==0)||(i1.i0.u23.p348==0)))" & (F!"(((((i1.i0.i0.i0.i0.i0.i0.i0.i...849
Reverse transition relation is NOT exact ! Due to transitions t509, t527, t617, i0.u2.t305, i0.u3.t303, i1.t1157, i1.i0.u23.t33, i1.i0.u23.t36, i1.i0.u23.t...2033
Computing Next relation with stutter on 7.84947e+06 deadlock states
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((X([]((LTLAPp5==true)))||(LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1661645215735778192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11507992 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15769504 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is AutonomousCar-PT-09b, 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 r043-smll-171620180400223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b 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 ;