About the Execution of 2023-gold for AutonomousCar-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14977.104 | 3600000.00 | 11685757.00 | 4654.40 | F?FFFT??F?F?F?F? | 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-171620180400233.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180400233
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 18:03 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 1.6M 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-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716326699726
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-10b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:25:02] [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 21:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:25:02] [INFO ] Load time of PNML (sax parser for PT used): 495 ms
[2024-05-21 21:25:03] [INFO ] Transformed 425 places.
[2024-05-21 21:25:03] [INFO ] Transformed 2252 transitions.
[2024-05-21 21:25:03] [INFO ] Found NUPN structural information;
[2024-05-21 21:25:03] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 860 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 364 transition count 2191
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 364 transition count 2191
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 522 place count 364 transition count 1791
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 533 place count 353 transition count 1780
Iterating global reduction 1 with 11 rules applied. Total rules applied 544 place count 353 transition count 1780
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 545 place count 352 transition count 1779
Iterating global reduction 1 with 1 rules applied. Total rules applied 546 place count 352 transition count 1779
Applied a total of 546 rules in 227 ms. Remains 352 /425 variables (removed 73) and now considering 1779/2252 (removed 473) transitions.
// Phase 1: matrix 1779 rows 352 cols
[2024-05-21 21:25:03] [INFO ] Computed 15 invariants in 69 ms
[2024-05-21 21:25:04] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-21 21:25:04] [INFO ] Invariant cache hit.
[2024-05-21 21:25:05] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2024-05-21 21:25:05] [INFO ] Invariant cache hit.
[2024-05-21 21:25:07] [INFO ] Dead Transitions using invariants and state equation in 1597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 352/425 places, 1779/2252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3803 ms. Remains : 352/425 places, 1779/2252 transitions.
Support contains 45 out of 352 places after structural reductions.
[2024-05-21 21:25:08] [INFO ] Flatten gal took : 618 ms
[2024-05-21 21:25:08] [INFO ] Flatten gal took : 307 ms
[2024-05-21 21:25:09] [INFO ] Input system was already deterministic with 1779 transitions.
Support contains 44 out of 352 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 870 ms. (steps per millisecond=11 ) properties (out of 39) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) seen :0
Running SMT prover for 28 properties.
[2024-05-21 21:25:10] [INFO ] Invariant cache hit.
[2024-05-21 21:25:12] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-21 21:25:13] [INFO ] After 1128ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:26
[2024-05-21 21:25:14] [INFO ] Deduced a trap composed of 5 places in 716 ms of which 11 ms to minimize.
[2024-05-21 21:25:15] [INFO ] Deduced a trap composed of 24 places in 840 ms of which 1 ms to minimize.
[2024-05-21 21:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1760 ms
[2024-05-21 21:25:15] [INFO ] After 2943ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:27
[2024-05-21 21:25:15] [INFO ] After 3416ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:27
[2024-05-21 21:25:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:25:18] [INFO ] After 2370ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2024-05-21 21:25:19] [INFO ] Deduced a trap composed of 32 places in 790 ms of which 2 ms to minimize.
[2024-05-21 21:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 931 ms
[2024-05-21 21:25:22] [INFO ] After 5908ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :26
Attempting to minimize the solution found.
Minimization took 1313 ms.
[2024-05-21 21:25:23] [INFO ] After 8197ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :26
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 595 ms.
Support contains 32 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 284 edges and 352 vertex of which 4 / 352 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1867 edges and 350 vertex of which 348 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 348 transition count 1646
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 186 rules applied. Total rules applied 317 place count 221 transition count 1587
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 352 place count 186 transition count 1587
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 352 place count 186 transition count 1582
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 362 place count 181 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 363 place count 180 transition count 1581
Iterating global reduction 3 with 1 rules applied. Total rules applied 364 place count 180 transition count 1581
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 480 place count 122 transition count 1523
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 122 transition count 1522
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 489 place count 114 transition count 1451
Iterating global reduction 4 with 8 rules applied. Total rules applied 497 place count 114 transition count 1451
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 504 place count 114 transition count 1444
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 506 place count 113 transition count 1443
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 529 place count 113 transition count 1420
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 552 place count 90 transition count 1420
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 560 place count 90 transition count 1420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 89 transition count 1419
Applied a total of 561 rules in 901 ms. Remains 89 /352 variables (removed 263) and now considering 1419/1779 (removed 360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 902 ms. Remains : 89/352 places, 1419/1779 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 1419 rows 89 cols
[2024-05-21 21:25:25] [INFO ] Computed 15 invariants in 16 ms
[2024-05-21 21:25:26] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-21 21:25:27] [INFO ] After 773ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:19
[2024-05-21 21:25:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:25:27] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:19
[2024-05-21 21:25:27] [INFO ] After 347ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:19
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-21 21:25:27] [INFO ] After 1476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:19
[2024-05-21 21:25:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-21 21:25:29] [INFO ] After 1536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2024-05-21 21:25:30] [INFO ] After 802ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2024-05-21 21:25:31] [INFO ] After 2195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 778 ms.
[2024-05-21 21:25:32] [INFO ] After 4749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 472 ms.
Support contains 31 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1419/1419 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 89 transition count 1418
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 88 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 1417
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 1417
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 14 place count 87 transition count 1407
Applied a total of 14 rules in 225 ms. Remains 87 /89 variables (removed 2) and now considering 1407/1419 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 87/89 places, 1407/1419 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :1
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 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1407 rows 87 cols
[2024-05-21 21:25:34] [INFO ] Computed 15 invariants in 15 ms
[2024-05-21 21:25:34] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-21 21:25:35] [INFO ] After 662ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:25:35] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:35] [INFO ] After 308ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:12
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-21 21:25:35] [INFO ] After 1213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-05-21 21:25:36] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-21 21:25:37] [INFO ] After 543ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-21 21:25:38] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-05-21 21:25:38] [INFO ] After 3248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 31 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1407/1407 transitions.
Applied a total of 0 rules in 80 ms. Remains 87 /87 variables (removed 0) and now considering 1407/1407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 87/87 places, 1407/1407 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 354655 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354655 steps, saw 53190 distinct states, run finished after 3011 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 15 properties.
[2024-05-21 21:25:42] [INFO ] Invariant cache hit.
[2024-05-21 21:25:43] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-21 21:25:44] [INFO ] After 643ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:25:44] [INFO ] After 109ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:44] [INFO ] After 293ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:12
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-21 21:25:44] [INFO ] After 1158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:12
[2024-05-21 21:25:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-21 21:25:45] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-21 21:25:46] [INFO ] After 528ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-21 21:25:47] [INFO ] After 1439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 521 ms.
[2024-05-21 21:25:47] [INFO ] After 3219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 227 ms.
Support contains 31 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1407/1407 transitions.
Applied a total of 0 rules in 77 ms. Remains 87 /87 variables (removed 0) and now considering 1407/1407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 87/87 places, 1407/1407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1407/1407 transitions.
Applied a total of 0 rules in 77 ms. Remains 87 /87 variables (removed 0) and now considering 1407/1407 (removed 0) transitions.
[2024-05-21 21:25:48] [INFO ] Invariant cache hit.
[2024-05-21 21:25:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:25:48] [INFO ] Invariant cache hit.
[2024-05-21 21:25:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:25:48] [INFO ] Implicit Places using invariants and state equation in 547 ms returned [82, 86]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 626 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/87 places, 1406/1407 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 84 transition count 1405
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 84 transition count 1404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 1404
Applied a total of 4 rules in 177 ms. Remains 83 /85 variables (removed 2) and now considering 1404/1406 (removed 2) transitions.
// Phase 1: matrix 1404 rows 83 cols
[2024-05-21 21:25:48] [INFO ] Computed 13 invariants in 12 ms
[2024-05-21 21:25:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:25:48] [INFO ] Invariant cache hit.
[2024-05-21 21:25:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:49] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/87 places, 1404/1407 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1465 ms. Remains : 83/87 places, 1404/1407 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 735 ms. (steps per millisecond=13 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) 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 13) 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 13) 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 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-21 21:25:50] [INFO ] Invariant cache hit.
[2024-05-21 21:25:50] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-21 21:25:51] [INFO ] After 596ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2024-05-21 21:25:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:51] [INFO ] After 57ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1 real:11
[2024-05-21 21:25:51] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:11
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-21 21:25:51] [INFO ] After 918ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:11
[2024-05-21 21:25:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:25:52] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-21 21:25:52] [INFO ] After 410ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2024-05-21 21:25:53] [INFO ] After 1131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 412 ms.
[2024-05-21 21:25:53] [INFO ] After 2606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 161 ms.
Support contains 31 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1404/1404 transitions.
Applied a total of 0 rules in 75 ms. Remains 83 /83 variables (removed 0) and now considering 1404/1404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 83/83 places, 1404/1404 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 21:25:55] [INFO ] Invariant cache hit.
[2024-05-21 21:25:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 21:25:56] [INFO ] After 856ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2024-05-21 21:25:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:56] [INFO ] After 235ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :6
[2024-05-21 21:25:56] [INFO ] After 616ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 211 ms.
[2024-05-21 21:25:57] [INFO ] After 1759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 186 ms.
Support contains 23 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 1404/1404 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 79 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 1389
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 1389
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 78 transition count 1388
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 22 place count 77 transition count 1378
Applied a total of 22 rules in 191 ms. Remains 77 /83 variables (removed 6) and now considering 1378/1404 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 77/83 places, 1378/1404 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1378 rows 77 cols
[2024-05-21 21:25:58] [INFO ] Computed 13 invariants in 15 ms
[2024-05-21 21:25:58] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:25:59] [INFO ] After 902ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:25:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:25:59] [INFO ] After 145ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:25:59] [INFO ] After 397ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-21 21:25:59] [INFO ] After 1544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:25:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:26:00] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 21:26:00] [INFO ] After 166ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 21:26:00] [INFO ] After 464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-21 21:26:01] [INFO ] After 1334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 55 ms.
Support contains 22 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 1378/1378 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 1377
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 76 transition count 1367
Applied a total of 12 rules in 161 ms. Remains 76 /77 variables (removed 1) and now considering 1367/1378 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 76/77 places, 1367/1378 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 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 28 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 344611 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344611 steps, saw 49705 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1367 rows 76 cols
[2024-05-21 21:26:05] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 21:26:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 21:26:05] [INFO ] After 621ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:26:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:26:06] [INFO ] After 137ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:26:06] [INFO ] After 390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-21 21:26:06] [INFO ] After 1228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:26:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:26:07] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 21:26:07] [INFO ] After 163ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-21 21:26:07] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 165 ms.
[2024-05-21 21:26:07] [INFO ] After 1321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 124 ms.
Support contains 22 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 1367/1367 transitions.
Applied a total of 0 rules in 76 ms. Remains 76 /76 variables (removed 0) and now considering 1367/1367 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 76/76 places, 1367/1367 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 1367/1367 transitions.
Applied a total of 0 rules in 91 ms. Remains 76 /76 variables (removed 0) and now considering 1367/1367 (removed 0) transitions.
[2024-05-21 21:26:08] [INFO ] Invariant cache hit.
[2024-05-21 21:26:08] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-21 21:26:08] [INFO ] Invariant cache hit.
[2024-05-21 21:26:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:26:09] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2024-05-21 21:26:09] [INFO ] Redundant transitions in 216 ms returned []
[2024-05-21 21:26:09] [INFO ] Invariant cache hit.
[2024-05-21 21:26:10] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2742 ms. Remains : 76/76 places, 1367/1367 transitions.
Graph (complete) has 1063 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 75 transition count 1366
Applied a total of 2 rules in 111 ms. Remains 75 /76 variables (removed 1) and now considering 1366/1367 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1366 rows 75 cols
[2024-05-21 21:26:10] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 21:26:11] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:26:11] [INFO ] After 778ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:26:12] [INFO ] After 1028ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-21 21:26:12] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-21 21:26:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:26:12] [INFO ] After 626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-21 21:26:13] [INFO ] After 939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-21 21:26:13] [INFO ] After 1191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 53 stabilizing places and 54 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((X(G(p1))&&p0))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 52 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:26:14] [INFO ] Computed 15 invariants in 14 ms
[2024-05-21 21:26:15] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-21 21:26:15] [INFO ] Invariant cache hit.
[2024-05-21 21:26:16] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2024-05-21 21:26:16] [INFO ] Invariant cache hit.
[2024-05-21 21:26:17] [INFO ] Dead Transitions using invariants and state equation in 1350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3778 ms. Remains : 347/352 places, 1774/1779 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 347 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s16 1) (EQ s213 1) (EQ s313 1)), p1:(AND (EQ s4 1) (EQ s16 1) (EQ s213 1) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 4311 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((p0&&(p1||G(p0))))||X(F(p2))))'
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 50 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-21 21:26:18] [INFO ] Invariant cache hit.
[2024-05-21 21:26:18] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-21 21:26:18] [INFO ] Invariant cache hit.
[2024-05-21 21:26:20] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2024-05-21 21:26:20] [INFO ] Invariant cache hit.
[2024-05-21 21:26:21] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2979 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s4 1) (EQ s11 1) (EQ s257 1) (EQ s313 1)), p0:(OR (EQ s4 0) (EQ s17 0) (EQ s182 0) (EQ s313 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 173 reset in 615 ms.
Product exploration explored 100000 steps with 771 reset in 617 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 166755 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166755 steps, saw 32338 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 21:26:27] [INFO ] Invariant cache hit.
[2024-05-21 21:26:27] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 21:26:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 21:26:28] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 21:26:29] [INFO ] Deduced a trap composed of 31 places in 1136 ms of which 1 ms to minimize.
[2024-05-21 21:26:30] [INFO ] Deduced a trap composed of 31 places in 1059 ms of which 1 ms to minimize.
[2024-05-21 21:26:31] [INFO ] Deduced a trap composed of 31 places in 1006 ms of which 2 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Deduced a trap composed of 31 places in 969 ms of which 1 ms to minimize.
[2024-05-21 21:26:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4478 ms
[2024-05-21 21:26:33] [INFO ] After 5619ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2024-05-21 21:26:33] [INFO ] After 5941ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
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 362 place count 176 transition count 1577
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 522 place count 96 transition count 1497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 96 transition count 1496
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 542 place count 77 transition count 1305
Iterating global reduction 4 with 19 rules applied. Total rules applied 561 place count 77 transition count 1305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 569 place count 77 transition count 1297
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 571 place count 76 transition count 1296
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 583 place count 76 transition count 1284
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 595 place count 64 transition count 1284
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 64 transition count 1284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 597 place count 63 transition count 1283
Applied a total of 597 rules in 842 ms. Remains 63 /347 variables (removed 284) and now considering 1283/1774 (removed 491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 63/347 places, 1283/1774 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 4) seen :0
Finished Best-First random walk after 2683 steps, including 2 resets, run visited all 4 properties in 11 ms. (steps per millisecond=243 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 347 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 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 342 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 352 place count 180 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 353 place count 179 transition count 1583
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 179 transition count 1583
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 492 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 110 transition count 1512
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 506 place count 97 transition count 1387
Iterating global reduction 4 with 13 rules applied. Total rules applied 519 place count 97 transition count 1387
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 97 transition count 1379
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 5 with 4 rules applied. Total rules applied 531 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 533 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 535 place count 93 transition count 1375
Applied a total of 535 rules in 1500 ms. Remains 93 /347 variables (removed 254) and now considering 1375/1774 (removed 399) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-21 21:26:37] [INFO ] Computed 14 invariants in 10 ms
[2024-05-21 21:26:37] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-21 21:26:37] [INFO ] Invariant cache hit.
[2024-05-21 21:26:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:26:38] [INFO ] Implicit Places using invariants and state equation in 822 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1296 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/347 places, 1375/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 1374
Applied a total of 2 rules in 159 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-21 21:26:38] [INFO ] Computed 12 invariants in 15 ms
[2024-05-21 21:26:39] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-21 21:26:39] [INFO ] Invariant cache hit.
[2024-05-21 21:26:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:26:40] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/347 places, 1374/1774 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4488 ms. Remains : 90/347 places, 1374/1774 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 p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 229 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 357 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 235948 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235948 steps, saw 39066 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 21:26:44] [INFO ] Invariant cache hit.
[2024-05-21 21:26:44] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 21:26:44] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 21:26:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:26:45] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 21:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:26:45] [INFO ] After 136ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-21 21:26:46] [INFO ] Deduced a trap composed of 7 places in 865 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Deduced a trap composed of 7 places in 845 ms of which 1 ms to minimize.
[2024-05-21 21:26:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1827 ms
[2024-05-21 21:26:47] [INFO ] After 2181ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-21 21:26:47] [INFO ] After 3024ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 640 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Finished Best-First random walk after 697 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=348 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 485 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 434 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 2929 reset in 1131 ms.
Product exploration explored 100000 steps with 1853 reset in 993 ms.
Built C files in :
/tmp/ltsmin1388605806613583555
[2024-05-21 21:26:52] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-21 21:26:53] [INFO ] Computation of Complete disable matrix. took 511 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:26:53] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-21 21:26:53] [INFO ] Computation of Complete enable matrix. took 112 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:26:54] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-21 21:26:54] [INFO ] Computation of Completed DNA matrix. took 143 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:26:54] [INFO ] Built C files in 1406ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1388605806613583555
Running compilation step : cd /tmp/ltsmin1388605806613583555;'/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/ltsmin1388605806613583555;'/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/ltsmin1388605806613583555;'/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 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 90 transition count 1373
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 89 transition count 1373
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 83 transition count 1367
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 77 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 77 transition count 1301
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 73 transition count 1297
Applied a total of 34 rules in 275 ms. Remains 73 /90 variables (removed 17) and now considering 1297/1374 (removed 77) transitions.
// Phase 1: matrix 1297 rows 73 cols
[2024-05-21 21:26:57] [INFO ] Computed 12 invariants in 13 ms
[2024-05-21 21:26:58] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-21 21:26:58] [INFO ] Invariant cache hit.
[2024-05-21 21:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:26:59] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
[2024-05-21 21:26:59] [INFO ] Redundant transitions in 157 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1296 rows 73 cols
[2024-05-21 21:26:59] [INFO ] Computed 12 invariants in 11 ms
[2024-05-21 21:27:00] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 1296/1374 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 71 transition count 1294
Applied a total of 2 rules in 138 ms. Remains 71 /73 variables (removed 2) and now considering 1294/1296 (removed 2) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-21 21:27:00] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 21:27:01] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-05-21 21:27:01] [INFO ] Invariant cache hit.
[2024-05-21 21:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:27:02] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/90 places, 1294/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5552 ms. Remains : 71/90 places, 1294/1374 transitions.
Built C files in :
/tmp/ltsmin2148993691427038837
[2024-05-21 21:27:02] [INFO ] Computing symmetric may disable matrix : 1294 transitions.
[2024-05-21 21:27:03] [INFO ] Computation of Complete disable matrix. took 466 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:03] [INFO ] Computing symmetric may enable matrix : 1294 transitions.
[2024-05-21 21:27:03] [INFO ] Computation of Complete enable matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:03] [INFO ] Computing Do-Not-Accords matrix : 1294 transitions.
[2024-05-21 21:27:04] [INFO ] Computation of Completed DNA matrix. took 119 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:27:04] [INFO ] Built C files in 1304ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2148993691427038837
Running compilation step : cd /tmp/ltsmin2148993691427038837;'/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/ltsmin2148993691427038837;'/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/ltsmin2148993691427038837;'/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 21:27:07] [INFO ] Flatten gal took : 222 ms
[2024-05-21 21:27:08] [INFO ] Flatten gal took : 207 ms
[2024-05-21 21:27:08] [INFO ] Time to serialize gal into /tmp/LTL14029485939895320855.gal : 41 ms
[2024-05-21 21:27:08] [INFO ] Time to serialize properties into /tmp/LTL810581103838760101.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/LTL14029485939895320855.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8660117915459577704.hoa' '-atoms' '/tmp/LTL810581103838760101.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/LTL810581103838760101.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8660117915459577704.hoa
Detected timeout of ITS tools.
[2024-05-21 21:27:23] [INFO ] Flatten gal took : 321 ms
[2024-05-21 21:27:23] [INFO ] Flatten gal took : 355 ms
[2024-05-21 21:27:24] [INFO ] Time to serialize gal into /tmp/LTL16851739910662593673.gal : 50 ms
[2024-05-21 21:27:24] [INFO ] Time to serialize properties into /tmp/LTL5394075244681226668.ltl : 4 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/LTL16851739910662593673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5394075244681226668.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(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2024-05-21 21:27:39] [INFO ] Flatten gal took : 245 ms
[2024-05-21 21:27:39] [INFO ] Applying decomposition
[2024-05-21 21:27:39] [INFO ] Flatten gal took : 248 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/graph3523552965916023419.txt' '-o' '/tmp/graph3523552965916023419.bin' '-w' '/tmp/graph3523552965916023419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3523552965916023419.bin' '-l' '-1' '-v' '-w' '/tmp/graph3523552965916023419.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:27:40] [INFO ] Decomposing Gal with order
[2024-05-21 21:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:27:41] [INFO ] Removed a total of 12084 redundant transitions.
[2024-05-21 21:27:41] [INFO ] Flatten gal took : 873 ms
[2024-05-21 21:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 99 ms.
[2024-05-21 21:27:41] [INFO ] Time to serialize gal into /tmp/LTL5552924703746052804.gal : 9 ms
[2024-05-21 21:27:41] [INFO ] Time to serialize properties into /tmp/LTL4357592013703875606.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/LTL5552924703746052804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4357592013703875606.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(("(((u0.p6==0)||(u0.p20==0))||((i2.u12.p218==0)||(u0.p382==0)))")&&(("(((((i2.u1.p68==1)&&(i2.u3.p99==1))&&((i2.u6.p136==1)&&(i2...453
Formula 0 simplified : F(!"(((u0.p6==0)||(u0.p20==0))||((i2.u12.p218==0)||(u0.p382==0)))" | (!"(((((i2.u1.p68==1)&&(i2.u3.p99==1))&&((i2.u6.p136==1)&&(i2.u...441
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14364736499536806189
[2024-05-21 21:27:57] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14364736499536806189
Running compilation step : cd /tmp/ltsmin14364736499536806189;'/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/ltsmin14364736499536806189;'/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/ltsmin14364736499536806189;'/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-10b-LTLFireability-01 finished in 101732 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))||G((F(p1)&&F(p2)))))'
Support contains 19 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 298 edges and 352 vertex of which 4 / 352 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 349 transition count 1649
Reduce places removed 127 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 181 rules applied. Total rules applied 309 place count 222 transition count 1595
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 341 place count 190 transition count 1595
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 341 place count 190 transition count 1587
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 357 place count 182 transition count 1587
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 360 place count 179 transition count 1584
Iterating global reduction 3 with 3 rules applied. Total rules applied 363 place count 179 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 178 transition count 1574
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 178 transition count 1574
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 367 place count 178 transition count 1572
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 368 place count 177 transition count 1572
Performed 62 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 492 place count 115 transition count 1509
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 493 place count 115 transition count 1508
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 504 place count 104 transition count 1406
Iterating global reduction 6 with 11 rules applied. Total rules applied 515 place count 104 transition count 1406
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 524 place count 104 transition count 1397
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 528 place count 102 transition count 1395
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 530 place count 100 transition count 1393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 531 place count 99 transition count 1393
Applied a total of 531 rules in 394 ms. Remains 99 /352 variables (removed 253) and now considering 1393/1779 (removed 386) transitions.
// Phase 1: matrix 1393 rows 99 cols
[2024-05-21 21:28:00] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 21:28:00] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 21:28:00] [INFO ] Invariant cache hit.
[2024-05-21 21:28:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:28:01] [INFO ] Implicit Places using invariants and state equation in 723 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 935 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1393/1779 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 96 transition count 1392
Applied a total of 2 rules in 107 ms. Remains 96 /97 variables (removed 1) and now considering 1392/1393 (removed 1) transitions.
// Phase 1: matrix 1392 rows 96 cols
[2024-05-21 21:28:01] [INFO ] Computed 11 invariants in 9 ms
[2024-05-21 21:28:01] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 21:28:01] [INFO ] Invariant cache hit.
[2024-05-21 21:28:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:28:02] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1392/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2345 ms. Remains : 96/352 places, 1392/1779 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s22 1) (EQ s33 1) (EQ s38 1) (EQ s49 1) (EQ s57 1) (EQ s67 1) (EQ s75 1) (EQ s79 1) (EQ s88 1) (EQ s92 1)), p1:(EQ s60 1), p2:(AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 2514 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)&&X(G(p1))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 350 transition count 1777
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 350 transition count 1777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 349 transition count 1776
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 349 transition count 1776
Applied a total of 6 rules in 45 ms. Remains 349 /352 variables (removed 3) and now considering 1776/1779 (removed 3) transitions.
// Phase 1: matrix 1776 rows 349 cols
[2024-05-21 21:28:02] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 21:28:03] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-05-21 21:28:03] [INFO ] Invariant cache hit.
[2024-05-21 21:28:05] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2509 ms to find 0 implicit places.
[2024-05-21 21:28:05] [INFO ] Invariant cache hit.
[2024-05-21 21:28:06] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 349/352 places, 1776/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4327 ms. Remains : 349/352 places, 1776/1779 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s220 1), p0:(EQ s106 1)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 4508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (G((F(p0)||G(!p1)))||((F(p0)||G(!p1))&&(G(!p1)||(!p1&&F(p2))))))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 349 transition count 1776
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 349 transition count 1776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 348 transition count 1775
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 348 transition count 1775
Applied a total of 8 rules in 36 ms. Remains 348 /352 variables (removed 4) and now considering 1775/1779 (removed 4) transitions.
// Phase 1: matrix 1775 rows 348 cols
[2024-05-21 21:28:07] [INFO ] Computed 15 invariants in 16 ms
[2024-05-21 21:28:07] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 21:28:07] [INFO ] Invariant cache hit.
[2024-05-21 21:28:08] [INFO ] Implicit Places using invariants and state equation in 1423 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2024-05-21 21:28:08] [INFO ] Invariant cache hit.
[2024-05-21 21:28:10] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/352 places, 1775/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3513 ms. Remains : 348/352 places, 1775/1779 transitions.
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s87 1) (EQ s117 1) (EQ s142 1) (EQ s163 1) (EQ s188 1) (EQ s218 1) (EQ s238 1) (EQ s263 1) (EQ s293 1) (EQ s315 1)), p0:(NEQ s122 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 292 reset in 431 ms.
Product exploration explored 100000 steps with 1 reset in 328 ms.
Computed a total of 52 stabilizing places and 53 stable transitions
Computed a total of 52 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 174 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false, false]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 21:28:12] [INFO ] Invariant cache hit.
[2024-05-21 21:28:13] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 21:28:13] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-21 21:28:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:28:13] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p1 p2 (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) p2 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p1) p2 p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 20 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 6218 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 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 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 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 348 place count 187 transition count 1584
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
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 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 77 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 527 place count 98 transition count 1491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 528 place count 98 transition count 1490
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 547 place count 79 transition count 1300
Iterating global reduction 6 with 19 rules applied. Total rules applied 566 place count 79 transition count 1300
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1291
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 579 place count 77 transition count 1289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 580 place count 76 transition count 1288
Applied a total of 580 rules in 458 ms. Remains 76 /352 variables (removed 276) and now considering 1288/1779 (removed 491) transitions.
// Phase 1: matrix 1288 rows 76 cols
[2024-05-21 21:28:13] [INFO ] Computed 14 invariants in 10 ms
[2024-05-21 21:28:14] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-21 21:28:14] [INFO ] Invariant cache hit.
[2024-05-21 21:28:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:28:15] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned [71, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2122 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/352 places, 1288/1779 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 73 transition count 1287
Applied a total of 2 rules in 132 ms. Remains 73 /74 variables (removed 1) and now considering 1287/1288 (removed 1) transitions.
// Phase 1: matrix 1287 rows 73 cols
[2024-05-21 21:28:16] [INFO ] Computed 12 invariants in 18 ms
[2024-05-21 21:28:16] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-21 21:28:16] [INFO ] Invariant cache hit.
[2024-05-21 21:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:28:17] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1878 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/352 places, 1287/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4605 ms. Remains : 73/352 places, 1287/1779 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06 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 (NEQ s2 1) (NEQ s3 1) (NEQ s38 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 247 reset in 316 ms.
Product exploration explored 100000 steps with 495 reset in 293 ms.
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 135 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 54 ms :[(NOT p0)]
Finished random walk after 34 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
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 194 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 1287/1287 transitions.
Applied a total of 0 rules in 116 ms. Remains 73 /73 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2024-05-21 21:28:19] [INFO ] Invariant cache hit.
[2024-05-21 21:28:19] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-21 21:28:19] [INFO ] Invariant cache hit.
[2024-05-21 21:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:28:21] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2024-05-21 21:28:21] [INFO ] Redundant transitions in 84 ms returned [1074]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1286 rows 73 cols
[2024-05-21 21:28:21] [INFO ] Computed 12 invariants in 13 ms
[2024-05-21 21:28:22] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/73 places, 1286/1287 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 1284
Applied a total of 2 rules in 132 ms. Remains 71 /73 variables (removed 2) and now considering 1284/1286 (removed 2) transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-21 21:28:22] [INFO ] Computed 12 invariants in 9 ms
[2024-05-21 21:28:23] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-21 21:28:23] [INFO ] Invariant cache hit.
[2024-05-21 21:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:28:24] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/73 places, 1284/1287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5500 ms. Remains : 71/73 places, 1284/1287 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 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 62 ms :[(NOT p0)]
Finished random walk after 483 steps, including 22 resets, run visited all 1 properties in 7 ms. (steps per millisecond=69 )
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 108 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)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 883 reset in 286 ms.
Product exploration explored 100000 steps with 619 reset in 333 ms.
Built C files in :
/tmp/ltsmin4948435351071593741
[2024-05-21 21:28:25] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2024-05-21 21:28:26] [INFO ] Computation of Complete disable matrix. took 472 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:26] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2024-05-21 21:28:26] [INFO ] Computation of Complete enable matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:26] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2024-05-21 21:28:26] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:27] [INFO ] Built C files in 1294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4948435351071593741
Running compilation step : cd /tmp/ltsmin4948435351071593741;'/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/ltsmin4948435351071593741;'/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/ltsmin4948435351071593741;'/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 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 1284/1284 transitions.
Applied a total of 0 rules in 122 ms. Remains 71 /71 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2024-05-21 21:28:30] [INFO ] Invariant cache hit.
[2024-05-21 21:28:31] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-21 21:28:31] [INFO ] Invariant cache hit.
[2024-05-21 21:28:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:28:32] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2024-05-21 21:28:32] [INFO ] Redundant transitions in 73 ms returned []
[2024-05-21 21:28:32] [INFO ] Invariant cache hit.
[2024-05-21 21:28:33] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3030 ms. Remains : 71/71 places, 1284/1284 transitions.
Built C files in :
/tmp/ltsmin6879435037352471492
[2024-05-21 21:28:33] [INFO ] Computing symmetric may disable matrix : 1284 transitions.
[2024-05-21 21:28:33] [INFO ] Computation of Complete disable matrix. took 466 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:33] [INFO ] Computing symmetric may enable matrix : 1284 transitions.
[2024-05-21 21:28:33] [INFO ] Computation of Complete enable matrix. took 67 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:34] [INFO ] Computing Do-Not-Accords matrix : 1284 transitions.
[2024-05-21 21:28:34] [INFO ] Computation of Completed DNA matrix. took 120 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:28:34] [INFO ] Built C files in 1277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6879435037352471492
Running compilation step : cd /tmp/ltsmin6879435037352471492;'/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/ltsmin6879435037352471492;'/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/ltsmin6879435037352471492;'/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 21:28:37] [INFO ] Flatten gal took : 216 ms
[2024-05-21 21:28:38] [INFO ] Flatten gal took : 222 ms
[2024-05-21 21:28:38] [INFO ] Time to serialize gal into /tmp/LTL8876494053109283582.gal : 46 ms
[2024-05-21 21:28:38] [INFO ] Time to serialize properties into /tmp/LTL11624803507248625476.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/LTL8876494053109283582.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3813802737264444812.hoa' '-atoms' '/tmp/LTL11624803507248625476.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/LTL11624803507248625476.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3813802737264444812.hoa
Detected timeout of ITS tools.
[2024-05-21 21:28:53] [INFO ] Flatten gal took : 206 ms
[2024-05-21 21:28:53] [INFO ] Flatten gal took : 238 ms
[2024-05-21 21:28:53] [INFO ] Time to serialize gal into /tmp/LTL7379701215205998181.gal : 31 ms
[2024-05-21 21:28:53] [INFO ] Time to serialize properties into /tmp/LTL2004999524494951309.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/LTL7379701215205998181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2004999524494951309.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 : !((F(G("(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"))))
Formula 0 simplified : GF!"(((p6!=1)||(p9!=1))||((p194!=1)||(p382!=1)))"
Detected timeout of ITS tools.
[2024-05-21 21:29:09] [INFO ] Flatten gal took : 206 ms
[2024-05-21 21:29:09] [INFO ] Applying decomposition
[2024-05-21 21:29:09] [INFO ] Flatten gal took : 207 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/graph16619366642595821593.txt' '-o' '/tmp/graph16619366642595821593.bin' '-w' '/tmp/graph16619366642595821593.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16619366642595821593.bin' '-l' '-1' '-v' '-w' '/tmp/graph16619366642595821593.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:29:10] [INFO ] Decomposing Gal with order
[2024-05-21 21:29:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:29:10] [INFO ] Removed a total of 11842 redundant transitions.
[2024-05-21 21:29:10] [INFO ] Flatten gal took : 556 ms
[2024-05-21 21:29:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 167 ms.
[2024-05-21 21:29:11] [INFO ] Time to serialize gal into /tmp/LTL2114478418576396417.gal : 29 ms
[2024-05-21 21:29:11] [INFO ] Time to serialize properties into /tmp/LTL7681659064807305840.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/LTL2114478418576396417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7681659064807305840.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("(((i0.u0.p6!=1)||(i0.u21.p9!=1))||((u9.p194!=1)||(i0.u21.p382!=1)))"))))
Formula 0 simplified : GF!"(((i0.u0.p6!=1)||(i0.u21.p9!=1))||((u9.p194!=1)||(i0.u21.p382!=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin986621070333965647
[2024-05-21 21:29:26] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin986621070333965647
Running compilation step : cd /tmp/ltsmin986621070333965647;'/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/ltsmin986621070333965647;'/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/ltsmin986621070333965647;'/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-10b-LTLFireability-06 finished in 75865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 304 edges and 352 vertex of which 4 / 352 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 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
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 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
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 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 512 place count 101 transition count 1412
Iterating global reduction 6 with 10 rules applied. Total rules applied 522 place count 101 transition count 1412
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 531 place count 101 transition count 1403
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 535 place count 99 transition count 1401
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 537 place count 97 transition count 1399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 538 place count 96 transition count 1399
Applied a total of 538 rules in 427 ms. Remains 96 /352 variables (removed 256) and now considering 1399/1779 (removed 380) transitions.
// Phase 1: matrix 1399 rows 96 cols
[2024-05-21 21:29:29] [INFO ] Computed 13 invariants in 14 ms
[2024-05-21 21:29:30] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-21 21:29:30] [INFO ] Invariant cache hit.
[2024-05-21 21:29:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:29:31] [INFO ] Implicit Places using invariants and state equation in 734 ms returned [91, 95]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1516 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/352 places, 1399/1779 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 93 transition count 1398
Applied a total of 2 rules in 111 ms. Remains 93 /94 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2024-05-21 21:29:31] [INFO ] Computed 11 invariants in 12 ms
[2024-05-21 21:29:31] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-21 21:29:31] [INFO ] Invariant cache hit.
[2024-05-21 21:29:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:32] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/352 places, 1398/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3173 ms. Remains : 93/352 places, 1398/1779 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s25 0) (EQ s33 0) (EQ s37 0) (EQ s48 0) (EQ s52 0) (EQ s60 0) (EQ s71 0) (EQ s75 0) (EQ s82 0) (EQ s89 0)), p1:(OR (EQ s14 0) (EQ s2...], nbAcceptance=2, 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 709 reset in 441 ms.
Product exploration explored 100000 steps with 720 reset in 424 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:29:33] [INFO ] Invariant cache hit.
[2024-05-21 21:29:34] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:29:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 21:29:34] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-21 21:29:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:34] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-21 21:29:34] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-21 21:29:34] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Graph (complete) has 1102 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 92 transition count 1395
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 23 place count 92 transition count 1375
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 72 transition count 1375
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 72 transition count 1376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 71 transition count 1376
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 71 transition count 1376
Applied a total of 55 rules in 313 ms. Remains 71 /93 variables (removed 22) and now considering 1376/1398 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 71/93 places, 1376/1398 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502121 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502121 steps, saw 72797 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1376 rows 71 cols
[2024-05-21 21:29:38] [INFO ] Computed 11 invariants in 8 ms
[2024-05-21 21:29:38] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:29:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 21:29:38] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:29:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:29:38] [INFO ] After 35ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:29:39] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-21 21:29:39] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 76 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 71/71 places, 1376/1376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 86 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
[2024-05-21 21:29:39] [INFO ] Invariant cache hit.
[2024-05-21 21:29:39] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-21 21:29:39] [INFO ] Invariant cache hit.
[2024-05-21 21:29:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:29:40] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-21 21:29:40] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-21 21:29:40] [INFO ] Invariant cache hit.
[2024-05-21 21:29:41] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2252 ms. Remains : 71/71 places, 1376/1376 transitions.
Applied a total of 0 rules in 74 ms. Remains 71 /71 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 21:29:41] [INFO ] Invariant cache hit.
[2024-05-21 21:29:41] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:29:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-21 21:29:42] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:29:42] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-21 21:29:42] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 289 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 1398/1398 transitions.
Applied a total of 0 rules in 82 ms. Remains 93 /93 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 93 cols
[2024-05-21 21:29:42] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:29:42] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 21:29:42] [INFO ] Invariant cache hit.
[2024-05-21 21:29:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:43] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2024-05-21 21:29:43] [INFO ] Redundant transitions in 68 ms returned [1095]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1397 rows 93 cols
[2024-05-21 21:29:43] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:29:44] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/93 places, 1397/1398 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 91 transition count 1395
Applied a total of 2 rules in 101 ms. Remains 91 /93 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 91 cols
[2024-05-21 21:29:45] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:29:45] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 21:29:45] [INFO ] Invariant cache hit.
[2024-05-21 21:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:45] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/93 places, 1395/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3360 ms. Remains : 91/93 places, 1395/1398 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 352 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 283806 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283806 steps, saw 50674 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-21 21:29:49] [INFO ] Invariant cache hit.
[2024-05-21 21:29:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 21:29:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-21 21:29:50] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-21 21:29:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:50] [INFO ] After 102ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-21 21:29:50] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-21 21:29:51] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 323 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2315 reset in 907 ms.
Product exploration explored 100000 steps with 161 reset in 223 ms.
Built C files in :
/tmp/ltsmin4433163263514005459
[2024-05-21 21:29:52] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2024-05-21 21:29:53] [INFO ] Computation of Complete disable matrix. took 469 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:29:53] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2024-05-21 21:29:53] [INFO ] Computation of Complete enable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:29:53] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2024-05-21 21:29:53] [INFO ] Computation of Completed DNA matrix. took 131 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:29:54] [INFO ] Built C files in 1308ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4433163263514005459
Running compilation step : cd /tmp/ltsmin4433163263514005459;'/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/ltsmin4433163263514005459;'/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/ltsmin4433163263514005459;'/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 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 1395/1395 transitions.
Applied a total of 0 rules in 92 ms. Remains 91 /91 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-05-21 21:29:57] [INFO ] Invariant cache hit.
[2024-05-21 21:29:57] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 21:29:57] [INFO ] Invariant cache hit.
[2024-05-21 21:29:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:29:58] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2024-05-21 21:29:58] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-21 21:29:58] [INFO ] Invariant cache hit.
[2024-05-21 21:29:59] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2348 ms. Remains : 91/91 places, 1395/1395 transitions.
Built C files in :
/tmp/ltsmin442742192543775655
[2024-05-21 21:29:59] [INFO ] Computing symmetric may disable matrix : 1395 transitions.
[2024-05-21 21:29:59] [INFO ] Computation of Complete disable matrix. took 467 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:30:00] [INFO ] Computing symmetric may enable matrix : 1395 transitions.
[2024-05-21 21:30:00] [INFO ] Computation of Complete enable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:30:00] [INFO ] Computing Do-Not-Accords matrix : 1395 transitions.
[2024-05-21 21:30:00] [INFO ] Computation of Completed DNA matrix. took 130 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:30:00] [INFO ] Built C files in 1294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin442742192543775655
Running compilation step : cd /tmp/ltsmin442742192543775655;'/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/ltsmin442742192543775655;'/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/ltsmin442742192543775655;'/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 21:30:04] [INFO ] Flatten gal took : 207 ms
[2024-05-21 21:30:04] [INFO ] Flatten gal took : 218 ms
[2024-05-21 21:30:04] [INFO ] Time to serialize gal into /tmp/LTL11242033656134808309.gal : 25 ms
[2024-05-21 21:30:04] [INFO ] Time to serialize properties into /tmp/LTL17536374836596317826.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/LTL11242033656134808309.gal' '-t' 'CGAL' '-hoa' '/tmp/aut646405079399961749.hoa' '-atoms' '/tmp/LTL17536374836596317826.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/LTL17536374836596317826.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut646405079399961749.hoa
Detected timeout of ITS tools.
[2024-05-21 21:30:19] [INFO ] Flatten gal took : 203 ms
[2024-05-21 21:30:19] [INFO ] Flatten gal took : 205 ms
[2024-05-21 21:30:19] [INFO ] Time to serialize gal into /tmp/LTL6922715491701729542.gal : 43 ms
[2024-05-21 21:30:19] [INFO ] Time to serialize properties into /tmp/LTL16945216340602242754.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/LTL6922715491701729542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16945216340602242754.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("(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))...320
Formula 0 simplified : G(F!"(((((p68==0)||(p105==0))||((p136==0)||(p161==0)))||(((p198==0)||(p223==0))||((p254==0)||(p291==0))))||(((p316==0)||(p347==0))||...312
Detected timeout of ITS tools.
[2024-05-21 21:30:35] [INFO ] Flatten gal took : 212 ms
[2024-05-21 21:30:35] [INFO ] Applying decomposition
[2024-05-21 21:30:35] [INFO ] Flatten gal took : 210 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/graph8796134564303573904.txt' '-o' '/tmp/graph8796134564303573904.bin' '-w' '/tmp/graph8796134564303573904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8796134564303573904.bin' '-l' '-1' '-v' '-w' '/tmp/graph8796134564303573904.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:30:35] [INFO ] Decomposing Gal with order
[2024-05-21 21:30:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:30:36] [INFO ] Removed a total of 11934 redundant transitions.
[2024-05-21 21:30:36] [INFO ] Flatten gal took : 476 ms
[2024-05-21 21:30:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 100 ms.
[2024-05-21 21:30:36] [INFO ] Time to serialize gal into /tmp/LTL10599222222589441109.gal : 30 ms
[2024-05-21 21:30:36] [INFO ] Time to serialize properties into /tmp/LTL11941657981832316782.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/LTL10599222222589441109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11941657981832316782.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 : !((F((G("(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p25...462
Formula 0 simplified : G(F!"(((((i0.u0.p68==0)||(i0.u3.p105==0))||((i0.u5.p136==0)||(i0.u6.p161==0)))||(((i0.u9.p198==0)||(i0.u10.p223==0))||((i0.u12.p254=...454
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11521430770001804195
[2024-05-21 21:30:51] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11521430770001804195
Running compilation step : cd /tmp/ltsmin11521430770001804195;'/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/ltsmin11521430770001804195;'/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/ltsmin11521430770001804195;'/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-10b-LTLFireability-07 finished in 85815 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((G(p0) U p1))&&(G((p2 U p1))||F(p3)))))'
Support contains 20 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 33 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:30:55] [INFO ] Computed 15 invariants in 12 ms
[2024-05-21 21:30:55] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-21 21:30:55] [INFO ] Invariant cache hit.
[2024-05-21 21:30:56] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2024-05-21 21:30:56] [INFO ] Invariant cache hit.
[2024-05-21 21:30:57] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2678 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s87 1) (EQ s112 1) (EQ s142 1) (EQ s167 1) (EQ s192 1) (EQ s217 1) (EQ s242 1) (EQ s267 1) (EQ s287 1) (EQ s314 1)), p2:(AND (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-08 finished in 3060 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&&F(p2)))||p0))))'
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 309 edges and 352 vertex of which 4 / 352 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 349 transition count 1651
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 224 transition count 1594
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 35 rules applied. Total rules applied 343 place count 190 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 344 place count 189 transition count 1593
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 344 place count 189 transition count 1586
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 358 place count 182 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 361 place count 179 transition count 1583
Iterating global reduction 4 with 3 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 365 place count 178 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 178 transition count 1573
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 368 place count 178 transition count 1571
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 369 place count 177 transition count 1571
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 501 place count 111 transition count 1504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 502 place count 111 transition count 1503
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 517 place count 96 transition count 1357
Iterating global reduction 7 with 15 rules applied. Total rules applied 532 place count 96 transition count 1357
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 541 place count 96 transition count 1348
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 545 place count 94 transition count 1346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 546 place count 93 transition count 1345
Applied a total of 546 rules in 360 ms. Remains 93 /352 variables (removed 259) and now considering 1345/1779 (removed 434) transitions.
// Phase 1: matrix 1345 rows 93 cols
[2024-05-21 21:30:58] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 21:30:58] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-21 21:30:58] [INFO ] Invariant cache hit.
[2024-05-21 21:30:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:30:59] [INFO ] Implicit Places using invariants and state equation in 822 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1229 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/352 places, 1345/1779 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 90 transition count 1344
Applied a total of 2 rules in 93 ms. Remains 90 /91 variables (removed 1) and now considering 1344/1345 (removed 1) transitions.
// Phase 1: matrix 1344 rows 90 cols
[2024-05-21 21:30:59] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:31:00] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 21:31:00] [INFO ] Invariant cache hit.
[2024-05-21 21:31:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:31:00] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/352 places, 1344/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2860 ms. Remains : 90/352 places, 1344/1779 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s16 0), p0:(OR (EQ s20 0) (EQ s27 0) (EQ s34 0) (EQ s41 0) (EQ s51 0) (EQ s55 0) (EQ s64 0) (EQ s70 0) (EQ s76 0) (EQ s82 0) (EQ s86 0)), p2:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 92 reset in 168 ms.
Product exploration explored 100000 steps with 182 reset in 224 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/90 stabilizing places and 5/1344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 191 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 315 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-05-21 21:31:02] [INFO ] Invariant cache hit.
[2024-05-21 21:31:02] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:31:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:31:02] [INFO ] After 51ms 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 p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 3 states, 7 edges and 3 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 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 15 out of 90 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 : 90/90 places, 1344/1344 transitions.
Applied a total of 0 rules in 92 ms. Remains 90 /90 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
[2024-05-21 21:31:03] [INFO ] Invariant cache hit.
[2024-05-21 21:31:03] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 21:31:03] [INFO ] Invariant cache hit.
[2024-05-21 21:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:31:04] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2024-05-21 21:31:04] [INFO ] Redundant transitions in 62 ms returned [1091]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1343 rows 90 cols
[2024-05-21 21:31:04] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:31:05] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1343/1344 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 88 transition count 1341
Applied a total of 2 rules in 97 ms. Remains 88 /90 variables (removed 2) and now considering 1341/1343 (removed 2) transitions.
// Phase 1: matrix 1341 rows 88 cols
[2024-05-21 21:31:05] [INFO ] Computed 12 invariants in 12 ms
[2024-05-21 21:31:05] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-21 21:31:05] [INFO ] Invariant cache hit.
[2024-05-21 21:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:31:06] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1341/1344 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3750 ms. Remains : 88/90 places, 1341/1344 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 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 88 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 304 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 457872 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457872 steps, saw 75251 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:31:10] [INFO ] Invariant cache hit.
[2024-05-21 21:31:10] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:31:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 21:31:10] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:31:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:31:10] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 21:31:10] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:31:10] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1341/1341 transitions.
Graph (complete) has 1114 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 87 transition count 1338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 1338
Free-agglomeration rule applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 19 place count 86 transition count 1323
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 34 place count 71 transition count 1323
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 71 transition count 1323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 70 transition count 1322
Applied a total of 39 rules in 317 ms. Remains 70 /88 variables (removed 18) and now considering 1322/1341 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 70/88 places, 1322/1341 transitions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Finished Best-First random walk after 5520 steps, including 14 resets, run visited all 1 properties in 16 ms. (steps per millisecond=345 )
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 111 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))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2240 reset in 1116 ms.
Product exploration explored 100000 steps with 380 reset in 276 ms.
Built C files in :
/tmp/ltsmin13922195237565085333
[2024-05-21 21:31:13] [INFO ] Computing symmetric may disable matrix : 1341 transitions.
[2024-05-21 21:31:13] [INFO ] Computation of Complete disable matrix. took 464 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:13] [INFO ] Computing symmetric may enable matrix : 1341 transitions.
[2024-05-21 21:31:13] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:14] [INFO ] Computing Do-Not-Accords matrix : 1341 transitions.
[2024-05-21 21:31:14] [INFO ] Computation of Completed DNA matrix. took 121 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:14] [INFO ] Built C files in 1257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13922195237565085333
Running compilation step : cd /tmp/ltsmin13922195237565085333;'/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/ltsmin13922195237565085333;'/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/ltsmin13922195237565085333;'/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 15 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1341/1341 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 1339
Applied a total of 1 rules in 162 ms. Remains 86 /88 variables (removed 2) and now considering 1339/1341 (removed 2) transitions.
// Phase 1: matrix 1339 rows 86 cols
[2024-05-21 21:31:17] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:31:18] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 21:31:18] [INFO ] Invariant cache hit.
[2024-05-21 21:31:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:31:18] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-05-21 21:31:19] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-21 21:31:19] [INFO ] Invariant cache hit.
[2024-05-21 21:31:19] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/88 places, 1339/1341 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2254 ms. Remains : 86/88 places, 1339/1341 transitions.
Built C files in :
/tmp/ltsmin15227846276707866440
[2024-05-21 21:31:19] [INFO ] Computing symmetric may disable matrix : 1339 transitions.
[2024-05-21 21:31:20] [INFO ] Computation of Complete disable matrix. took 483 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:20] [INFO ] Computing symmetric may enable matrix : 1339 transitions.
[2024-05-21 21:31:20] [INFO ] Computation of Complete enable matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:20] [INFO ] Computing Do-Not-Accords matrix : 1339 transitions.
[2024-05-21 21:31:20] [INFO ] Computation of Completed DNA matrix. took 122 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:31:21] [INFO ] Built C files in 1261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15227846276707866440
Running compilation step : cd /tmp/ltsmin15227846276707866440;'/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/ltsmin15227846276707866440;'/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/ltsmin15227846276707866440;'/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 21:31:24] [INFO ] Flatten gal took : 203 ms
[2024-05-21 21:31:24] [INFO ] Flatten gal took : 204 ms
[2024-05-21 21:31:24] [INFO ] Time to serialize gal into /tmp/LTL9509364771470853591.gal : 25 ms
[2024-05-21 21:31:24] [INFO ] Time to serialize properties into /tmp/LTL12627820200764408934.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/LTL9509364771470853591.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14261989378299591804.hoa' '-atoms' '/tmp/LTL12627820200764408934.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/LTL12627820200764408934.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14261989378299591804.hoa
Detected timeout of ITS tools.
[2024-05-21 21:31:40] [INFO ] Flatten gal took : 204 ms
[2024-05-21 21:31:40] [INFO ] Flatten gal took : 204 ms
[2024-05-21 21:31:40] [INFO ] Time to serialize gal into /tmp/LTL14739954545160504292.gal : 25 ms
[2024-05-21 21:31:40] [INFO ] Time to serialize properties into /tmp/LTL8758820791572894950.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/LTL14739954545160504292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8758820791572894950.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(("((((p68==0)||(p99==0))||((p130==0)||(p161==0)))||(((p198==0)||(p223==0))||((p260==0)||(p291==0))))")||(("((p322==0)||(p353==0...253
Formula 0 simplified : G(F(!"(p33==0)" | G!"(((p6==1)&&(p9==1))&&((p163==1)&&(p382==1)))") & FG(!"((((p68==0)||(p99==0))||((p130==0)||(p161==0)))||(((p198=...242
Detected timeout of ITS tools.
[2024-05-21 21:31:55] [INFO ] Flatten gal took : 204 ms
[2024-05-21 21:31:55] [INFO ] Applying decomposition
[2024-05-21 21:31:55] [INFO ] Flatten gal took : 207 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/graph8525392151196943929.txt' '-o' '/tmp/graph8525392151196943929.bin' '-w' '/tmp/graph8525392151196943929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8525392151196943929.bin' '-l' '-1' '-v' '-w' '/tmp/graph8525392151196943929.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:31:56] [INFO ] Decomposing Gal with order
[2024-05-21 21:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:31:56] [INFO ] Removed a total of 12038 redundant transitions.
[2024-05-21 21:31:56] [INFO ] Flatten gal took : 362 ms
[2024-05-21 21:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 140 ms.
[2024-05-21 21:31:57] [INFO ] Time to serialize gal into /tmp/LTL15330637981446771786.gal : 35 ms
[2024-05-21 21:31:57] [INFO ] Time to serialize properties into /tmp/LTL11155309877189612504.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/LTL15330637981446771786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11155309877189612504.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(("((((i2.i0.u2.p68==0)||(i2.i0.u4.p99==0))||((i2.i0.u6.p130==0)||(i2.i1.u8.p161==0)))||(((i2.i0.u11.p198==0)||(i2.i1.u12.p223==...374
Formula 0 simplified : G(F(!"(u1.p33==0)" | G!"(((u0.p6==1)&&(u0.p9==1))&&((u0.p163==1)&&(u0.p382==1)))") & FG(!"((((i2.i0.u2.p68==0)||(i2.i0.u4.p99==0))||...363
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16262226512310574274
[2024-05-21 21:32:12] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16262226512310574274
Running compilation step : cd /tmp/ltsmin16262226512310574274;'/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/ltsmin16262226512310574274;'/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/ltsmin16262226512310574274;'/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-10b-LTLFireability-09 finished in 77098 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)&&F(p1)))'
Support contains 15 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 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 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 349 transition count 1646
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 187 rules applied. Total rules applied 318 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 352 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 352 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
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 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 509 place count 107 transition count 1500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 510 place count 107 transition count 1499
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 525 place count 92 transition count 1353
Iterating global reduction 6 with 15 rules applied. Total rules applied 540 place count 92 transition count 1353
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 549 place count 92 transition count 1344
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 553 place count 90 transition count 1342
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 555 place count 88 transition count 1340
Applied a total of 555 rules in 328 ms. Remains 88 /352 variables (removed 264) and now considering 1340/1779 (removed 439) transitions.
// Phase 1: matrix 1340 rows 88 cols
[2024-05-21 21:32:15] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 21:32:15] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 21:32:15] [INFO ] Invariant cache hit.
[2024-05-21 21:32:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:32:16] [INFO ] Implicit Places using invariants and state equation in 796 ms returned [83, 87]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1198 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/352 places, 1340/1779 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 85 transition count 1339
Applied a total of 2 rules in 94 ms. Remains 85 /86 variables (removed 1) and now considering 1339/1340 (removed 1) transitions.
// Phase 1: matrix 1339 rows 85 cols
[2024-05-21 21:32:16] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:32:17] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-21 21:32:17] [INFO ] Invariant cache hit.
[2024-05-21 21:32:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:32:18] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/352 places, 1339/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2921 ms. Remains : 85/352 places, 1339/1779 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s11 1) (EQ s73 1) (EQ s80 1)), p0:(AND (EQ s18 1) (EQ s24 1) (EQ s28 1) (EQ s35 1) (EQ s44 1) (EQ s48 1) (EQ s57 1) (EQ s61 1) (EQ s...], 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 3067 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(X((p0||F(G((p1 U !p2)))))))))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 35 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:32:18] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 21:32:18] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-21 21:32:18] [INFO ] Invariant cache hit.
[2024-05-21 21:32:19] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-21 21:32:19] [INFO ] Invariant cache hit.
[2024-05-21 21:32:21] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(AND (EQ s67 1) (EQ s92 1) (EQ s117 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s242 1) (EQ s267 1) (EQ s287 1) (EQ s314 1)), p2:(AND (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 771 reset in 617 ms.
Product exploration explored 100000 steps with 55 reset in 220 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 21:32:22] [INFO ] Invariant cache hit.
[2024-05-21 21:32:23] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-21 21:32:23] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 21:32:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:32:24] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 21:32:25] [INFO ] Deduced a trap composed of 31 places in 868 ms of which 2 ms to minimize.
[2024-05-21 21:32:26] [INFO ] Deduced a trap composed of 31 places in 808 ms of which 8 ms to minimize.
[2024-05-21 21:32:26] [INFO ] Deduced a trap composed of 31 places in 821 ms of which 1 ms to minimize.
[2024-05-21 21:32:27] [INFO ] Deduced a trap composed of 31 places in 784 ms of which 0 ms to minimize.
[2024-05-21 21:32:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3566 ms
[2024-05-21 21:32:27] [INFO ] After 4614ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-21 21:32:28] [INFO ] After 4851ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 348 place count 183 transition count 1579
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 358 place count 178 transition count 1579
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 502 place count 106 transition count 1507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 503 place count 106 transition count 1506
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 522 place count 87 transition count 1317
Iterating global reduction 4 with 19 rules applied. Total rules applied 541 place count 87 transition count 1317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 551 place count 87 transition count 1307
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 553 place count 86 transition count 1306
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 565 place count 86 transition count 1294
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 577 place count 74 transition count 1294
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 579 place count 74 transition count 1294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 580 place count 73 transition count 1293
Applied a total of 580 rules in 390 ms. Remains 73 /347 variables (removed 274) and now considering 1293/1774 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 73/347 places, 1293/1774 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 407859 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407859 steps, saw 61070 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1293 rows 73 cols
[2024-05-21 21:32:31] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 21:32:31] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-21 21:32:31] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:32:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-21 21:32:32] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:32:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:32:32] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:32:33] [INFO ] Deduced a trap composed of 6 places in 858 ms of which 1 ms to minimize.
[2024-05-21 21:32:34] [INFO ] Deduced a trap composed of 6 places in 852 ms of which 3 ms to minimize.
[2024-05-21 21:32:35] [INFO ] Deduced a trap composed of 6 places in 892 ms of which 0 ms to minimize.
[2024-05-21 21:32:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2742 ms
[2024-05-21 21:32:35] [INFO ] After 2888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 21:32:35] [INFO ] After 3488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1293/1293 transitions.
Applied a total of 0 rules in 72 ms. Remains 73 /73 variables (removed 0) and now considering 1293/1293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 73/73 places, 1293/1293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 1293/1293 transitions.
Applied a total of 0 rules in 84 ms. Remains 73 /73 variables (removed 0) and now considering 1293/1293 (removed 0) transitions.
[2024-05-21 21:32:35] [INFO ] Invariant cache hit.
[2024-05-21 21:32:36] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-21 21:32:36] [INFO ] Invariant cache hit.
[2024-05-21 21:32:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:32:36] [INFO ] Implicit Places using invariants and state equation in 850 ms returned [68, 72]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1227 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/73 places, 1292/1293 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 70 transition count 1291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 1290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 69 transition count 1290
Applied a total of 4 rules in 166 ms. Remains 69 /71 variables (removed 2) and now considering 1290/1292 (removed 2) transitions.
// Phase 1: matrix 1290 rows 69 cols
[2024-05-21 21:32:37] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 21:32:37] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 21:32:37] [INFO ] Invariant cache hit.
[2024-05-21 21:32:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:32:38] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/73 places, 1290/1293 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2613 ms. Remains : 69/73 places, 1290/1293 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 349650 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349650 steps, saw 52327 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:32:41] [INFO ] Invariant cache hit.
[2024-05-21 21:32:41] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:32:41] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:32:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:32:42] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:32:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:32:42] [INFO ] After 68ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:32:43] [INFO ] Deduced a trap composed of 6 places in 900 ms of which 0 ms to minimize.
[2024-05-21 21:32:44] [INFO ] Deduced a trap composed of 6 places in 888 ms of which 0 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Deduced a trap composed of 8 places in 898 ms of which 5 ms to minimize.
[2024-05-21 21:32:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2829 ms
[2024-05-21 21:32:45] [INFO ] After 2983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-21 21:32:45] [INFO ] After 3626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1290/1290 transitions.
Applied a total of 0 rules in 68 ms. Remains 69 /69 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 69/69 places, 1290/1290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 1290/1290 transitions.
Applied a total of 0 rules in 68 ms. Remains 69 /69 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
[2024-05-21 21:32:45] [INFO ] Invariant cache hit.
[2024-05-21 21:32:45] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-21 21:32:45] [INFO ] Invariant cache hit.
[2024-05-21 21:32:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:32:46] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2024-05-21 21:32:46] [INFO ] Redundant transitions in 63 ms returned []
[2024-05-21 21:32:46] [INFO ] Invariant cache hit.
[2024-05-21 21:32:47] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2368 ms. Remains : 69/69 places, 1290/1290 transitions.
Graph (complete) has 1033 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 68 transition count 1289
Applied a total of 2 rules in 80 ms. Remains 68 /69 variables (removed 1) and now considering 1289/1290 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1289 rows 68 cols
[2024-05-21 21:32:47] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 21:32:48] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-21 21:32:48] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:32:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 21:32:48] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:32:49] [INFO ] Deduced a trap composed of 8 places in 930 ms of which 1 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Deduced a trap composed of 8 places in 924 ms of which 1 ms to minimize.
[2024-05-21 21:32:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1961 ms
[2024-05-21 21:32:50] [INFO ] After 2592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-21 21:32:50] [INFO ] After 2707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), true, (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 11 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:32:51] [INFO ] Computed 15 invariants in 12 ms
[2024-05-21 21:32:51] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-21 21:32:51] [INFO ] Invariant cache hit.
[2024-05-21 21:32:52] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2024-05-21 21:32:52] [INFO ] Invariant cache hit.
[2024-05-21 21:32:53] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:32:54] [INFO ] Invariant cache hit.
[2024-05-21 21:32:54] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-21 21:32:55] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:32:56] [INFO ] Deduced a trap composed of 31 places in 1010 ms of which 1 ms to minimize.
[2024-05-21 21:32:57] [INFO ] Deduced a trap composed of 32 places in 949 ms of which 1 ms to minimize.
[2024-05-21 21:32:58] [INFO ] Deduced a trap composed of 31 places in 857 ms of which 5 ms to minimize.
[2024-05-21 21:32:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3058 ms
[2024-05-21 21:32:58] [INFO ] After 3779ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:32:58] [INFO ] After 3872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:32:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 21:32:59] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:33:00] [INFO ] Deduced a trap composed of 31 places in 1026 ms of which 1 ms to minimize.
[2024-05-21 21:33:01] [INFO ] Deduced a trap composed of 32 places in 975 ms of which 0 ms to minimize.
[2024-05-21 21:33:02] [INFO ] Deduced a trap composed of 31 places in 866 ms of which 1 ms to minimize.
[2024-05-21 21:33:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3080 ms
[2024-05-21 21:33:02] [INFO ] After 3779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-21 21:33:02] [INFO ] After 3934ms 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 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
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 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 452 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 62/347 places, 1272/1774 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538180 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538180 steps, saw 76397 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1272 rows 62 cols
[2024-05-21 21:33:05] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 21:33:06] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-21 21:33:06] [INFO ] After 450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:33:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:33:06] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:33:06] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-21 21:33:06] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 82 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 82 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-21 21:33:06] [INFO ] Invariant cache hit.
[2024-05-21 21:33:07] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-05-21 21:33:07] [INFO ] Invariant cache hit.
[2024-05-21 21:33:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:33:08] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned [57, 61]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1829 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 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 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 180 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-21 21:33:08] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 21:33:09] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-21 21:33:09] [INFO ] Invariant cache hit.
[2024-05-21 21:33:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:33:10] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3839 ms. Remains : 58/62 places, 1269/1272 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 546962 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 546962 steps, saw 75135 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:33:13] [INFO ] Invariant cache hit.
[2024-05-21 21:33:13] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-21 21:33:14] [INFO ] After 463ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:33:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:33:14] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:33:14] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:33:14] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 79 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-21 21:33:14] [INFO ] Invariant cache hit.
[2024-05-21 21:33:15] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-21 21:33:15] [INFO ] Invariant cache hit.
[2024-05-21 21:33:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:33:16] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-05-21 21:33:16] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-21 21:33:16] [INFO ] Invariant cache hit.
[2024-05-21 21:33:17] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2676 ms. Remains : 58/58 places, 1269/1269 transitions.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 57 transition count 1268
Applied a total of 2 rules in 96 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-21 21:33:17] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 21:33:17] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 21:33:17] [INFO ] After 458ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:33:17] [INFO ] After 520ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:33:17] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2)), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 769 reset in 506 ms.
Product exploration explored 100000 steps with 304 reset in 325 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 307 edges and 347 vertex of which 4 / 347 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 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 87 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 87 rules applied. Total rules applied 474 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 476 place count 238 transition count 1653
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 543 place count 171 transition count 1456
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 67 rules applied. Total rules applied 610 place count 171 transition count 1456
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 630 place count 171 transition count 1436
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 641 place count 160 transition count 1425
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 652 place count 160 transition count 1425
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 653 place count 160 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 655 place count 158 transition count 1423
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 657 place count 158 transition count 1423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 158 transition count 1425
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 658 rules in 343 ms. Remains 158 /347 variables (removed 189) and now considering 1425/1774 (removed 349) transitions.
[2024-05-21 21:33:20] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 1425 rows 158 cols
[2024-05-21 21:33:20] [INFO ] Computed 14 invariants in 10 ms
[2024-05-21 21:33:22] [INFO ] Dead Transitions using invariants and state equation in 1782 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/347 places, 1425/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2266 ms. Remains : 158/347 places, 1425/1774 transitions.
Built C files in :
/tmp/ltsmin12133253538054469704
[2024-05-21 21:33:22] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12133253538054469704
Running compilation step : cd /tmp/ltsmin12133253538054469704;'/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/ltsmin12133253538054469704;'/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/ltsmin12133253538054469704;'/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 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 20 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:33:25] [INFO ] Computed 15 invariants in 13 ms
[2024-05-21 21:33:26] [INFO ] Implicit Places using invariants in 811 ms returned []
[2024-05-21 21:33:26] [INFO ] Invariant cache hit.
[2024-05-21 21:33:27] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2024-05-21 21:33:27] [INFO ] Invariant cache hit.
[2024-05-21 21:33:28] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3180 ms. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin1838093644206433236
[2024-05-21 21:33:28] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1838093644206433236
Running compilation step : cd /tmp/ltsmin1838093644206433236;'/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/ltsmin1838093644206433236;'/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/ltsmin1838093644206433236;'/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 21:33:32] [INFO ] Flatten gal took : 247 ms
[2024-05-21 21:33:32] [INFO ] Flatten gal took : 167 ms
[2024-05-21 21:33:32] [INFO ] Time to serialize gal into /tmp/LTL7287219267791577410.gal : 27 ms
[2024-05-21 21:33:32] [INFO ] Time to serialize properties into /tmp/LTL12097210424085049901.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/LTL7287219267791577410.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9748380173345506054.hoa' '-atoms' '/tmp/LTL12097210424085049901.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/LTL12097210424085049901.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9748380173345506054.hoa
Detected timeout of ITS tools.
[2024-05-21 21:33:47] [INFO ] Flatten gal took : 186 ms
[2024-05-21 21:33:47] [INFO ] Flatten gal took : 171 ms
[2024-05-21 21:33:47] [INFO ] Time to serialize gal into /tmp/LTL14132435498318150012.gal : 25 ms
[2024-05-21 21:33:47] [INFO ] Time to serialize properties into /tmp/LTL17638537116512883544.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/LTL14132435498318150012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17638537116512883544.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(X(X(X((F(G(("(((((p74==1)&&(p99==1))&&((p136==1)&&(p167==1)))&&(((p198==1)&&(p229==1))&&((p260==1)&&(p291==1))))&&(((p322==1)&&(p...384
Formula 0 simplified : XXXX(!"(((((p74==1)&&(p105==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&((p254==1)&&(p291==1))))&&(((p322==1)&&(p347==1))...367
Detected timeout of ITS tools.
[2024-05-21 21:34:03] [INFO ] Flatten gal took : 170 ms
[2024-05-21 21:34:03] [INFO ] Applying decomposition
[2024-05-21 21:34:03] [INFO ] Flatten gal took : 192 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/graph3749693085181703147.txt' '-o' '/tmp/graph3749693085181703147.bin' '-w' '/tmp/graph3749693085181703147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3749693085181703147.bin' '-l' '-1' '-v' '-w' '/tmp/graph3749693085181703147.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:34:03] [INFO ] Decomposing Gal with order
[2024-05-21 21:34:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:34:04] [INFO ] Removed a total of 12149 redundant transitions.
[2024-05-21 21:34:04] [INFO ] Flatten gal took : 409 ms
[2024-05-21 21:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 53 ms.
[2024-05-21 21:34:04] [INFO ] Time to serialize gal into /tmp/LTL12795358419132310140.gal : 9 ms
[2024-05-21 21:34:04] [INFO ] Time to serialize properties into /tmp/LTL3914374303535945495.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/LTL12795358419132310140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3914374303535945495.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(X(X(X((F(G(("(((((i6.u20.p74==1)&&(i6.u26.p99==1))&&((i6.u37.p136==1)&&(i6.u45.p167==1)))&&(((i6.u53.p198==1)&&(i6.u60.p229==1))&...567
Formula 0 simplified : XXXX(!"(((((i6.u20.p74==1)&&(i6.u28.p105==1))&&((i6.u37.p136==1)&&(i6.u43.p161==1)))&&(((i6.u51.p192==1)&&(i6.u58.p223==1))&&((i6.u6...550
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11597820125301212298
[2024-05-21 21:34:19] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11597820125301212298
Running compilation step : cd /tmp/ltsmin11597820125301212298;'/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/ltsmin11597820125301212298;'/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/ltsmin11597820125301212298;'/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-10b-LTLFireability-11 finished in 124393 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)))))'
Support contains 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 42 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
[2024-05-21 21:34:22] [INFO ] Invariant cache hit.
[2024-05-21 21:34:23] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-21 21:34:23] [INFO ] Invariant cache hit.
[2024-05-21 21:34:24] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2024-05-21 21:34:24] [INFO ] Invariant cache hit.
[2024-05-21 21:34:25] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2860 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s62 1) (EQ s92 1) (EQ s117 1) (EQ s142 1) (EQ s162 1) (EQ s192 1) (EQ s217 1) (EQ s242 1) (EQ s262 1) (EQ s292 1) (EQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-12 finished in 2972 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 11 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 314 edges and 352 vertex of which 4 / 352 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 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 350 place count 186 transition count 1583
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 364 place count 179 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 367 place count 176 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 176 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 371 place count 175 transition count 1570
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 175 transition count 1570
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 374 place count 175 transition count 1568
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 375 place count 174 transition count 1568
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 511 place count 106 transition count 1499
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 106 transition count 1498
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 528 place count 90 transition count 1341
Iterating global reduction 6 with 16 rules applied. Total rules applied 544 place count 90 transition count 1341
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 553 place count 90 transition count 1332
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 557 place count 88 transition count 1330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 559 place count 86 transition count 1328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 560 place count 85 transition count 1328
Applied a total of 560 rules in 395 ms. Remains 85 /352 variables (removed 267) and now considering 1328/1779 (removed 451) transitions.
// Phase 1: matrix 1328 rows 85 cols
[2024-05-21 21:34:26] [INFO ] Computed 13 invariants in 8 ms
[2024-05-21 21:34:26] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-21 21:34:26] [INFO ] Invariant cache hit.
[2024-05-21 21:34:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:34:27] [INFO ] Implicit Places using invariants and state equation in 824 ms returned [80, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/352 places, 1328/1779 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 82 transition count 1327
Applied a total of 2 rules in 117 ms. Remains 82 /83 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
// Phase 1: matrix 1327 rows 82 cols
[2024-05-21 21:34:27] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:34:27] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-21 21:34:28] [INFO ] Invariant cache hit.
[2024-05-21 21:34:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:34:28] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/352 places, 1327/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3191 ms. Remains : 82/352 places, 1327/1779 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13 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 (NEQ s14 1) (NEQ s23 1) (NEQ s29 1) (NEQ s33 1) (NEQ s42 1) (NEQ s46 1) (NEQ s55 1) (NEQ s59 1) (NEQ s68 1) (NEQ s74 1) (NEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1018 reset in 428 ms.
Product exploration explored 100000 steps with 17 reset in 107 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 90 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 360 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Finished Best-First random walk after 4172 steps, including 9 resets, run visited all 1 properties in 10 ms. (steps per millisecond=417 )
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 101 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 1327/1327 transitions.
Applied a total of 0 rules in 80 ms. Remains 82 /82 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-21 21:34:29] [INFO ] Invariant cache hit.
[2024-05-21 21:34:30] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-21 21:34:30] [INFO ] Invariant cache hit.
[2024-05-21 21:34:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:34:31] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
[2024-05-21 21:34:31] [INFO ] Redundant transitions in 63 ms returned [1084]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1326 rows 82 cols
[2024-05-21 21:34:31] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:34:31] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 1326/1327 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 80 transition count 1324
Applied a total of 2 rules in 94 ms. Remains 80 /82 variables (removed 2) and now considering 1324/1326 (removed 2) transitions.
// Phase 1: matrix 1324 rows 80 cols
[2024-05-21 21:34:32] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 21:34:32] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-21 21:34:32] [INFO ] Invariant cache hit.
[2024-05-21 21:34:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:34:33] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/82 places, 1324/1327 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3347 ms. Remains : 80/82 places, 1324/1327 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 79 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 369 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Finished Best-First random walk after 3719 steps, including 9 resets, run visited all 1 properties in 10 ms. (steps per millisecond=371 )
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 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 39 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 1180 reset in 501 ms.
Product exploration explored 100000 steps with 1028 reset in 476 ms.
Built C files in :
/tmp/ltsmin13012896855703072426
[2024-05-21 21:34:34] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2024-05-21 21:34:35] [INFO ] Computation of Complete disable matrix. took 467 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:35] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2024-05-21 21:34:35] [INFO ] Computation of Complete enable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:35] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2024-05-21 21:34:35] [INFO ] Computation of Completed DNA matrix. took 122 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:36] [INFO ] Built C files in 1245ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13012896855703072426
Running compilation step : cd /tmp/ltsmin13012896855703072426;'/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/ltsmin13012896855703072426;'/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/ltsmin13012896855703072426;'/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 11 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 1324/1324 transitions.
Applied a total of 0 rules in 80 ms. Remains 80 /80 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2024-05-21 21:34:39] [INFO ] Invariant cache hit.
[2024-05-21 21:34:39] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-21 21:34:39] [INFO ] Invariant cache hit.
[2024-05-21 21:34:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:34:40] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2024-05-21 21:34:40] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-21 21:34:40] [INFO ] Invariant cache hit.
[2024-05-21 21:34:41] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2085 ms. Remains : 80/80 places, 1324/1324 transitions.
Built C files in :
/tmp/ltsmin2375421178034237765
[2024-05-21 21:34:41] [INFO ] Computing symmetric may disable matrix : 1324 transitions.
[2024-05-21 21:34:41] [INFO ] Computation of Complete disable matrix. took 479 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:41] [INFO ] Computing symmetric may enable matrix : 1324 transitions.
[2024-05-21 21:34:41] [INFO ] Computation of Complete enable matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:42] [INFO ] Computing Do-Not-Accords matrix : 1324 transitions.
[2024-05-21 21:34:42] [INFO ] Computation of Completed DNA matrix. took 119 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:34:42] [INFO ] Built C files in 1247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2375421178034237765
Running compilation step : cd /tmp/ltsmin2375421178034237765;'/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/ltsmin2375421178034237765;'/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/ltsmin2375421178034237765;'/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 21:34:45] [INFO ] Flatten gal took : 201 ms
[2024-05-21 21:34:45] [INFO ] Flatten gal took : 203 ms
[2024-05-21 21:34:45] [INFO ] Time to serialize gal into /tmp/LTL14628436184215215831.gal : 24 ms
[2024-05-21 21:34:45] [INFO ] Time to serialize properties into /tmp/LTL8608768562631604782.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/LTL14628436184215215831.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1401093547147565126.hoa' '-atoms' '/tmp/LTL8608768562631604782.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/LTL8608768562631604782.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1401093547147565126.hoa
Detected timeout of ITS tools.
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 203 ms
[2024-05-21 21:35:01] [INFO ] Flatten gal took : 201 ms
[2024-05-21 21:35:01] [INFO ] Time to serialize gal into /tmp/LTL16375673432049124666.gal : 23 ms
[2024-05-21 21:35:01] [INFO ] Time to serialize properties into /tmp/LTL3671635938465941274.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/LTL16375673432049124666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3671635938465941274.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("(((((p68!=1)||(p105!=1))||((p136!=1)||(p161!=1)))||(((p198!=1)||(p223!=1))||((p260!=1)||(p285!=1))))||(((p322!=1)||(p353!=1))|...172
Formula 0 simplified : GF!"(((((p68!=1)||(p105!=1))||((p136!=1)||(p161!=1)))||(((p198!=1)||(p223!=1))||((p260!=1)||(p285!=1))))||(((p322!=1)||(p353!=1))||(...166
Detected timeout of ITS tools.
[2024-05-21 21:35:16] [INFO ] Flatten gal took : 200 ms
[2024-05-21 21:35:16] [INFO ] Applying decomposition
[2024-05-21 21:35:17] [INFO ] Flatten gal took : 202 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/graph9455111485966576211.txt' '-o' '/tmp/graph9455111485966576211.bin' '-w' '/tmp/graph9455111485966576211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9455111485966576211.bin' '-l' '-1' '-v' '-w' '/tmp/graph9455111485966576211.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:35:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:35:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:35:17] [INFO ] Removed a total of 11976 redundant transitions.
[2024-05-21 21:35:17] [INFO ] Flatten gal took : 261 ms
[2024-05-21 21:35:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 97 ms.
[2024-05-21 21:35:18] [INFO ] Time to serialize gal into /tmp/LTL1948708679772298187.gal : 27 ms
[2024-05-21 21:35:18] [INFO ] Time to serialize properties into /tmp/LTL13522403404855700853.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/LTL1948708679772298187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13522403404855700853.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("(((((i0.i0.u0.p68!=1)||(i0.i1.u3.p105!=1))||((i0.i1.u5.p136!=1)||(i0.i1.u6.p161!=1)))||(((i0.i1.u9.p198!=1)||(i0.i0.u10.p223!=...276
Formula 0 simplified : GF!"(((((i0.i0.u0.p68!=1)||(i0.i1.u3.p105!=1))||((i0.i1.u5.p136!=1)||(i0.i1.u6.p161!=1)))||(((i0.i1.u9.p198!=1)||(i0.i0.u10.p223!=1)...270
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15112973160990693082
[2024-05-21 21:35:33] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15112973160990693082
Running compilation step : cd /tmp/ltsmin15112973160990693082;'/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/ltsmin15112973160990693082;'/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/ltsmin15112973160990693082;'/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-10b-LTLFireability-13 finished in 70593 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' '!(((!p0 U (p1||G(!p0))) U (F(p3)&&p2)))'
Support contains 21 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 301 edges and 352 vertex of which 4 / 352 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 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 349 transition count 1648
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 185 rules applied. Total rules applied 314 place count 221 transition count 1591
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 348 place count 187 transition count 1591
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 187 transition count 1585
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 360 place count 181 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 179 transition count 1583
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 179 transition count 1583
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 3 with 126 rules applied. Total rules applied 490 place count 116 transition count 1519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 491 place count 116 transition count 1518
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 505 place count 102 transition count 1383
Iterating global reduction 4 with 14 rules applied. Total rules applied 519 place count 102 transition count 1383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 528 place count 102 transition count 1374
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 5 with 4 rules applied. Total rules applied 532 place count 100 transition count 1372
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 533 place count 99 transition count 1371
Applied a total of 533 rules in 280 ms. Remains 99 /352 variables (removed 253) and now considering 1371/1779 (removed 408) transitions.
// Phase 1: matrix 1371 rows 99 cols
[2024-05-21 21:35:36] [INFO ] Computed 14 invariants in 8 ms
[2024-05-21 21:35:36] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-21 21:35:36] [INFO ] Invariant cache hit.
[2024-05-21 21:35:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:35:37] [INFO ] Implicit Places using invariants and state equation in 663 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 921 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/352 places, 1371/1779 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 96 transition count 1370
Applied a total of 2 rules in 91 ms. Remains 96 /97 variables (removed 1) and now considering 1370/1371 (removed 1) transitions.
// Phase 1: matrix 1370 rows 96 cols
[2024-05-21 21:35:37] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:35:37] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-21 21:35:37] [INFO ] Invariant cache hit.
[2024-05-21 21:35:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:35:38] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/352 places, 1370/1779 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2205 ms. Remains : 96/352 places, 1370/1779 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s20 1) (EQ s25 1) (EQ s36 1) (EQ s47 1) (EQ s55 1) (EQ s61 1) (EQ s65 1) (EQ s74 1) (EQ s79 1) (EQ s88 1) (EQ s92 1)), p1:(AND (NOT (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 2379 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(G((p0&&(G(F(p0))||p1))))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 348 transition count 1775
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 347 transition count 1774
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 347 transition count 1774
Applied a total of 10 rules in 43 ms. Remains 347 /352 variables (removed 5) and now considering 1774/1779 (removed 5) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:35:38] [INFO ] Computed 15 invariants in 12 ms
[2024-05-21 21:35:39] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-21 21:35:39] [INFO ] Invariant cache hit.
[2024-05-21 21:35:40] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-21 21:35:40] [INFO ] Invariant cache hit.
[2024-05-21 21:35:42] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/352 places, 1774/1779 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3544 ms. Remains : 347/352 places, 1774/1779 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (NEQ s4 1) (NEQ s11 1) (NEQ s163 1) (NEQ s313 1))], 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]]
Product exploration explored 100000 steps with 743 reset in 499 ms.
Product exploration explored 100000 steps with 765 reset in 531 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298745 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298745 steps, saw 54791 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:35:46] [INFO ] Invariant cache hit.
[2024-05-21 21:35:46] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-21 21:35:47] [INFO ] After 731ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:35:48] [INFO ] Deduced a trap composed of 31 places in 1160 ms of which 1 ms to minimize.
[2024-05-21 21:35:49] [INFO ] Deduced a trap composed of 31 places in 992 ms of which 1 ms to minimize.
[2024-05-21 21:35:50] [INFO ] Deduced a trap composed of 31 places in 1029 ms of which 1 ms to minimize.
[2024-05-21 21:35:51] [INFO ] Deduced a trap composed of 31 places in 1000 ms of which 3 ms to minimize.
[2024-05-21 21:35:52] [INFO ] Deduced a trap composed of 31 places in 820 ms of which 1 ms to minimize.
[2024-05-21 21:35:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5356 ms
[2024-05-21 21:35:52] [INFO ] After 6125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:35:52] [INFO ] After 6216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:35:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-21 21:35:53] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:35:54] [INFO ] Deduced a trap composed of 31 places in 1128 ms of which 1 ms to minimize.
[2024-05-21 21:35:55] [INFO ] Deduced a trap composed of 31 places in 984 ms of which 1 ms to minimize.
[2024-05-21 21:35:56] [INFO ] Deduced a trap composed of 31 places in 956 ms of which 1 ms to minimize.
[2024-05-21 21:35:57] [INFO ] Deduced a trap composed of 31 places in 975 ms of which 1 ms to minimize.
[2024-05-21 21:35:58] [INFO ] Deduced a trap composed of 32 places in 891 ms of which 2 ms to minimize.
[2024-05-21 21:35:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5271 ms
[2024-05-21 21:35:59] [INFO ] After 6061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-21 21:35:59] [INFO ] After 6206ms 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 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
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 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 511 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 62/347 places, 1272/1774 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 533015 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533015 steps, saw 75838 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1272 rows 62 cols
[2024-05-21 21:36:02] [INFO ] Computed 15 invariants in 6 ms
[2024-05-21 21:36:02] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-21 21:36:03] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:36:03] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:36:03] [INFO ] After 90ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 21:36:03] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-21 21:36:03] [INFO ] Invariant cache hit.
[2024-05-21 21:36:04] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-21 21:36:04] [INFO ] Invariant cache hit.
[2024-05-21 21:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:36:05] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned [57, 61]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1783 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 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 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 190 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-21 21:36:05] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 21:36:06] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-21 21:36:06] [INFO ] Invariant cache hit.
[2024-05-21 21:36:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:07] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3961 ms. Remains : 58/62 places, 1269/1272 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 537659 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 537659 steps, saw 73990 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:36:10] [INFO ] Invariant cache hit.
[2024-05-21 21:36:10] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-21 21:36:11] [INFO ] After 495ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:11] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:36:11] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-21 21:36:11] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-21 21:36:11] [INFO ] Invariant cache hit.
[2024-05-21 21:36:12] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-21 21:36:12] [INFO ] Invariant cache hit.
[2024-05-21 21:36:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:13] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2024-05-21 21:36:13] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-21 21:36:13] [INFO ] Invariant cache hit.
[2024-05-21 21:36:14] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3153 ms. Remains : 58/58 places, 1269/1269 transitions.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 57 transition count 1268
Applied a total of 2 rules in 93 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-21 21:36:14] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 21:36:14] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-21 21:36:15] [INFO ] After 464ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:15] [INFO ] After 525ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 21:36:15] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 14 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:36:15] [INFO ] Computed 15 invariants in 12 ms
[2024-05-21 21:36:16] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-21 21:36:16] [INFO ] Invariant cache hit.
[2024-05-21 21:36:18] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
[2024-05-21 21:36:18] [INFO ] Invariant cache hit.
[2024-05-21 21:36:19] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3942 ms. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 304919 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 304919 steps, saw 55831 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:36:23] [INFO ] Invariant cache hit.
[2024-05-21 21:36:23] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-21 21:36:23] [INFO ] After 675ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:25] [INFO ] Deduced a trap composed of 31 places in 1096 ms of which 0 ms to minimize.
[2024-05-21 21:36:26] [INFO ] Deduced a trap composed of 31 places in 1029 ms of which 1 ms to minimize.
[2024-05-21 21:36:27] [INFO ] Deduced a trap composed of 31 places in 989 ms of which 1 ms to minimize.
[2024-05-21 21:36:28] [INFO ] Deduced a trap composed of 31 places in 918 ms of which 1 ms to minimize.
[2024-05-21 21:36:29] [INFO ] Deduced a trap composed of 31 places in 824 ms of which 1 ms to minimize.
[2024-05-21 21:36:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5237 ms
[2024-05-21 21:36:29] [INFO ] After 5952ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:36:29] [INFO ] After 6043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 21:36:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2024-05-21 21:36:29] [INFO ] After 676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 21:36:31] [INFO ] Deduced a trap composed of 31 places in 1087 ms of which 1 ms to minimize.
[2024-05-21 21:36:32] [INFO ] Deduced a trap composed of 31 places in 1009 ms of which 1 ms to minimize.
[2024-05-21 21:36:33] [INFO ] Deduced a trap composed of 31 places in 1014 ms of which 1 ms to minimize.
[2024-05-21 21:36:34] [INFO ] Deduced a trap composed of 31 places in 904 ms of which 0 ms to minimize.
[2024-05-21 21:36:35] [INFO ] Deduced a trap composed of 32 places in 799 ms of which 0 ms to minimize.
[2024-05-21 21:36:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5137 ms
[2024-05-21 21:36:35] [INFO ] After 5846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-21 21:36:35] [INFO ] After 5982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 343 transition count 1643
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 184 rules applied. Total rules applied 313 place count 218 transition count 1584
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 348 place count 183 transition count 1584
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 183 transition count 1578
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 360 place count 177 transition count 1578
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 524 place count 95 transition count 1496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 95 transition count 1495
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 545 place count 75 transition count 1295
Iterating global reduction 4 with 20 rules applied. Total rules applied 565 place count 75 transition count 1295
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 575 place count 75 transition count 1285
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 577 place count 74 transition count 1284
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 588 place count 74 transition count 1273
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 599 place count 63 transition count 1273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 600 place count 63 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 601 place count 62 transition count 1272
Applied a total of 601 rules in 522 ms. Remains 62 /347 variables (removed 285) and now considering 1272/1774 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 62/347 places, 1272/1774 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 533638 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533638 steps, saw 75922 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1272 rows 62 cols
[2024-05-21 21:36:38] [INFO ] Computed 15 invariants in 7 ms
[2024-05-21 21:36:39] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-21 21:36:39] [INFO ] After 458ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:36:39] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:36:39] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:36:39] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 62/62 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1272/1272 transitions.
Applied a total of 0 rules in 82 ms. Remains 62 /62 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-21 21:36:39] [INFO ] Invariant cache hit.
[2024-05-21 21:36:40] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-21 21:36:40] [INFO ] Invariant cache hit.
[2024-05-21 21:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:36:41] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned [57, 61]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1763 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/62 places, 1271/1272 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 59 transition count 1270
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 59 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 1269
Applied a total of 4 rules in 186 ms. Remains 58 /60 variables (removed 2) and now considering 1269/1271 (removed 2) transitions.
// Phase 1: matrix 1269 rows 58 cols
[2024-05-21 21:36:41] [INFO ] Computed 13 invariants in 6 ms
[2024-05-21 21:36:42] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-21 21:36:42] [INFO ] Invariant cache hit.
[2024-05-21 21:36:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:43] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/62 places, 1269/1272 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3807 ms. Remains : 58/62 places, 1269/1272 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 542158 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542158 steps, saw 74546 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:36:46] [INFO ] Invariant cache hit.
[2024-05-21 21:36:46] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-21 21:36:47] [INFO ] After 475ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:47] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:36:47] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 21:36:47] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 80 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 80 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2024-05-21 21:36:47] [INFO ] Invariant cache hit.
[2024-05-21 21:36:48] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-21 21:36:48] [INFO ] Invariant cache hit.
[2024-05-21 21:36:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:36:49] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2024-05-21 21:36:49] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-21 21:36:49] [INFO ] Invariant cache hit.
[2024-05-21 21:36:50] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2829 ms. Remains : 58/58 places, 1269/1269 transitions.
Graph (complete) has 1011 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 57 transition count 1268
Applied a total of 2 rules in 93 ms. Remains 57 /58 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1268 rows 57 cols
[2024-05-21 21:36:50] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 21:36:50] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-21 21:36:50] [INFO ] After 459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:36:51] [INFO ] After 521ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-21 21:36:51] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 448 reset in 390 ms.
Product exploration explored 100000 steps with 126 reset in 281 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 328 edges and 347 vertex of which 4 / 347 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 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 148 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 148 place count 345 transition count 1749
Deduced a syphon composed of 149 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 173 place count 345 transition count 1749
Discarding 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 280 place count 238 transition count 1642
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 2 with 107 rules applied. Total rules applied 387 place count 238 transition count 1642
Performed 98 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 485 place count 238 transition count 1655
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 487 place count 238 transition count 1653
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 570 place count 155 transition count 1390
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 83 rules applied. Total rules applied 653 place count 155 transition count 1390
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 673 place count 155 transition count 1370
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 684 place count 144 transition count 1359
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 695 place count 144 transition count 1359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 696 place count 144 transition count 1359
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 698 place count 142 transition count 1357
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 700 place count 142 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 701 place count 142 transition count 1359
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 701 rules in 318 ms. Remains 142 /347 variables (removed 205) and now considering 1359/1774 (removed 415) transitions.
[2024-05-21 21:36:52] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 1359 rows 142 cols
[2024-05-21 21:36:52] [INFO ] Computed 14 invariants in 9 ms
[2024-05-21 21:36:53] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/347 places, 1359/1774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1262 ms. Remains : 142/347 places, 1359/1774 transitions.
Built C files in :
/tmp/ltsmin15010976220917217856
[2024-05-21 21:36:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15010976220917217856
Running compilation step : cd /tmp/ltsmin15010976220917217856;'/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/ltsmin15010976220917217856;'/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/ltsmin15010976220917217856;'/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 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 15 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2024-05-21 21:36:56] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 21:36:57] [INFO ] Implicit Places using invariants in 800 ms returned []
[2024-05-21 21:36:57] [INFO ] Invariant cache hit.
[2024-05-21 21:36:59] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
[2024-05-21 21:36:59] [INFO ] Invariant cache hit.
[2024-05-21 21:37:00] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin13174581821532185147
[2024-05-21 21:37:00] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13174581821532185147
Running compilation step : cd /tmp/ltsmin13174581821532185147;'/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/ltsmin13174581821532185147;'/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/ltsmin13174581821532185147;'/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 21:37:03] [INFO ] Flatten gal took : 161 ms
[2024-05-21 21:37:04] [INFO ] Flatten gal took : 162 ms
[2024-05-21 21:37:04] [INFO ] Time to serialize gal into /tmp/LTL8474429441735362846.gal : 29 ms
[2024-05-21 21:37:04] [INFO ] Time to serialize properties into /tmp/LTL15155789787663468882.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/LTL8474429441735362846.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14177975732612467665.hoa' '-atoms' '/tmp/LTL15155789787663468882.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/LTL15155789787663468882.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14177975732612467665.hoa
Detected timeout of ITS tools.
[2024-05-21 21:37:19] [INFO ] Flatten gal took : 161 ms
[2024-05-21 21:37:19] [INFO ] Flatten gal took : 163 ms
[2024-05-21 21:37:19] [INFO ] Time to serialize gal into /tmp/LTL10481892517813659423.gal : 27 ms
[2024-05-21 21:37:19] [INFO ] Time to serialize properties into /tmp/LTL7523563665913991187.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/LTL10481892517813659423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7523563665913991187.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))")&&(("(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))")||(G(F("(((p6!=1)||(p14!=...193
Formula 0 simplified : XXF(!"(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))" | (!"(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))" & FG!"(((p6!=1)||(p14!=1))||...181
Detected timeout of ITS tools.
[2024-05-21 21:37:34] [INFO ] Flatten gal took : 162 ms
[2024-05-21 21:37:34] [INFO ] Applying decomposition
[2024-05-21 21:37:34] [INFO ] Flatten gal took : 163 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/graph10103459094542826152.txt' '-o' '/tmp/graph10103459094542826152.bin' '-w' '/tmp/graph10103459094542826152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10103459094542826152.bin' '-l' '-1' '-v' '-w' '/tmp/graph10103459094542826152.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:37:35] [INFO ] Decomposing Gal with order
[2024-05-21 21:37:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:37:35] [INFO ] Removed a total of 12085 redundant transitions.
[2024-05-21 21:37:36] [INFO ] Flatten gal took : 343 ms
[2024-05-21 21:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 43 ms.
[2024-05-21 21:37:36] [INFO ] Time to serialize gal into /tmp/LTL6038761091803007020.gal : 33 ms
[2024-05-21 21:37:36] [INFO ] Time to serialize properties into /tmp/LTL15587538749161019494.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/LTL6038761091803007020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15587538749161019494.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(X(G(("(((i3.u2.p6!=1)||(i3.u2.p14!=1))||((i3.u2.p194!=1)||(i3.u2.p382!=1)))")&&(("(((i3.u2.p6!=1)||(i3.u2.p20!=1))||((i8.u27.p98!...266
Formula 0 simplified : XXF(!"(((i3.u2.p6!=1)||(i3.u2.p14!=1))||((i3.u2.p194!=1)||(i3.u2.p382!=1)))" | (!"(((i3.u2.p6!=1)||(i3.u2.p20!=1))||((i8.u27.p98!=1)...254
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16132663883987200510
[2024-05-21 21:37:51] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16132663883987200510
Running compilation step : cd /tmp/ltsmin16132663883987200510;'/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/ltsmin16132663883987200510;'/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/ltsmin16132663883987200510;'/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-10b-LTLFireability-15 finished in 135697 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((p0&&(p1||G(p0))))||X(F(p2))))'
Found a Shortening insensitive property : AutonomousCar-PT-10b-LTLFireability-01
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 311 edges and 352 vertex of which 4 / 352 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 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
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 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
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 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 66 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 505 place count 109 transition count 1502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 506 place count 109 transition count 1501
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 518 place count 97 transition count 1386
Iterating global reduction 6 with 12 rules applied. Total rules applied 530 place count 97 transition count 1386
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 537 place count 97 transition count 1379
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 541 place count 95 transition count 1377
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 543 place count 95 transition count 1377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 545 place count 93 transition count 1375
Applied a total of 545 rules in 276 ms. Remains 93 /352 variables (removed 259) and now considering 1375/1779 (removed 404) transitions.
// Phase 1: matrix 1375 rows 93 cols
[2024-05-21 21:37:54] [INFO ] Computed 14 invariants in 21 ms
[2024-05-21 21:37:55] [INFO ] Implicit Places using invariants in 688 ms returned []
[2024-05-21 21:37:55] [INFO ] Invariant cache hit.
[2024-05-21 21:37:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:37:56] [INFO ] Implicit Places using invariants and state equation in 860 ms returned [88, 92]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1577 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/352 places, 1375/1779 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 90 transition count 1374
Applied a total of 2 rules in 45 ms. Remains 90 /91 variables (removed 1) and now considering 1374/1375 (removed 1) transitions.
// Phase 1: matrix 1374 rows 90 cols
[2024-05-21 21:37:56] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:37:56] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 21:37:56] [INFO ] Invariant cache hit.
[2024-05-21 21:37:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:37:57] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/352 places, 1374/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3074 ms. Remains : 90/352 places, 1374/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s1 1) (EQ s4 1) (EQ s69 1) (EQ s85 1)), p0:(OR (EQ s1 0) (EQ s10 0) (EQ s48 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 168 reset in 163 ms.
Product exploration explored 100000 steps with 1449 reset in 613 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 p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Incomplete random walk after 10000 steps, including 356 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 27 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 29 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 26 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 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 308737 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308737 steps, saw 50643 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 21:38:02] [INFO ] Invariant cache hit.
[2024-05-21 21:38:02] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 21:38:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:38:02] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 21:38:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:38:03] [INFO ] After 135ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-21 21:38:03] [INFO ] Deduced a trap composed of 7 places in 811 ms of which 1 ms to minimize.
[2024-05-21 21:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 892 ms
[2024-05-21 21:38:04] [INFO ] After 1240ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-21 21:38:04] [INFO ] After 2053ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 1374/1374 transitions.
Graph (complete) has 1150 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 89 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 89 transition count 1370
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 88 transition count 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 82 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 76 transition count 1298
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 76 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 72 transition count 1294
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 72 transition count 1282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 60 transition count 1282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 60 transition count 1283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 59 transition count 1283
Applied a total of 63 rules in 343 ms. Remains 59 /90 variables (removed 31) and now considering 1283/1374 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 59/90 places, 1283/1374 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Finished Best-First random walk after 1776 steps, including 1 resets, run visited all 2 properties in 8 ms. (steps per millisecond=222 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F p2), (F (AND p0 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 8 factoid took 249 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Support contains 6 out of 90 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 : 90/90 places, 1374/1374 transitions.
Applied a total of 0 rules in 83 ms. Remains 90 /90 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-21 21:38:06] [INFO ] Invariant cache hit.
[2024-05-21 21:38:06] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-21 21:38:06] [INFO ] Invariant cache hit.
[2024-05-21 21:38:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:38:07] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-05-21 21:38:07] [INFO ] Redundant transitions in 63 ms returned [1089]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1373 rows 90 cols
[2024-05-21 21:38:07] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:38:08] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 1373/1374 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 88 transition count 1371
Applied a total of 2 rules in 102 ms. Remains 88 /90 variables (removed 2) and now considering 1371/1373 (removed 2) transitions.
// Phase 1: matrix 1371 rows 88 cols
[2024-05-21 21:38:08] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:38:08] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-21 21:38:08] [INFO ] Invariant cache hit.
[2024-05-21 21:38:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:38:09] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/90 places, 1371/1374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3453 ms. Remains : 88/90 places, 1371/1374 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 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 168 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), false, false]
Incomplete random walk after 10000 steps, including 372 resets, run finished after 579 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 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 28 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 283795 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283795 steps, saw 50552 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-21 21:38:13] [INFO ] Invariant cache hit.
[2024-05-21 21:38:13] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:38:13] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 21:38:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 21:38:14] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 21:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:38:14] [INFO ] After 129ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-05-21 21:38:15] [INFO ] Deduced a trap composed of 7 places in 800 ms of which 1 ms to minimize.
[2024-05-21 21:38:16] [INFO ] Deduced a trap composed of 7 places in 725 ms of which 1 ms to minimize.
[2024-05-21 21:38:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1636 ms
[2024-05-21 21:38:16] [INFO ] After 1968ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-05-21 21:38:16] [INFO ] After 2793ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 1371/1371 transitions.
Graph (complete) has 1143 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 87 transition count 1369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 1368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 1368
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 80 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 74 transition count 1296
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 74 transition count 1296
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 70 transition count 1292
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 70 transition count 1280
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 58 transition count 1280
Applied a total of 60 rules in 257 ms. Remains 58 /88 variables (removed 30) and now considering 1280/1371 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 58/88 places, 1280/1371 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 4) seen :2
Finished Best-First random walk after 1561 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2)), (F p2), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 14 factoid took 340 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 2433 reset in 962 ms.
Product exploration explored 100000 steps with 480 reset in 292 ms.
Built C files in :
/tmp/ltsmin13333225361704537426
[2024-05-21 21:38:20] [INFO ] Computing symmetric may disable matrix : 1371 transitions.
[2024-05-21 21:38:20] [INFO ] Computation of Complete disable matrix. took 468 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:20] [INFO ] Computing symmetric may enable matrix : 1371 transitions.
[2024-05-21 21:38:20] [INFO ] Computation of Complete enable matrix. took 55 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:21] [INFO ] Computing Do-Not-Accords matrix : 1371 transitions.
[2024-05-21 21:38:21] [INFO ] Computation of Completed DNA matrix. took 121 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:21] [INFO ] Built C files in 1283ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13333225361704537426
Running compilation step : cd /tmp/ltsmin13333225361704537426;'/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/ltsmin13333225361704537426;'/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/ltsmin13333225361704537426;'/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 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 1371/1371 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 1370
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 1370
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 81 transition count 1364
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 1298
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 1298
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 71 transition count 1294
Applied a total of 34 rules in 184 ms. Remains 71 /88 variables (removed 17) and now considering 1294/1371 (removed 77) transitions.
// Phase 1: matrix 1294 rows 71 cols
[2024-05-21 21:38:24] [INFO ] Computed 12 invariants in 8 ms
[2024-05-21 21:38:25] [INFO ] Implicit Places using invariants in 658 ms returned []
[2024-05-21 21:38:25] [INFO ] Invariant cache hit.
[2024-05-21 21:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:38:26] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2024-05-21 21:38:26] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-21 21:38:26] [INFO ] Invariant cache hit.
[2024-05-21 21:38:27] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/88 places, 1294/1371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2848 ms. Remains : 71/88 places, 1294/1371 transitions.
Built C files in :
/tmp/ltsmin12767326260004032376
[2024-05-21 21:38:27] [INFO ] Computing symmetric may disable matrix : 1294 transitions.
[2024-05-21 21:38:27] [INFO ] Computation of Complete disable matrix. took 471 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:27] [INFO ] Computing symmetric may enable matrix : 1294 transitions.
[2024-05-21 21:38:27] [INFO ] Computation of Complete enable matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:28] [INFO ] Computing Do-Not-Accords matrix : 1294 transitions.
[2024-05-21 21:38:28] [INFO ] Computation of Completed DNA matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:38:28] [INFO ] Built C files in 1249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12767326260004032376
Running compilation step : cd /tmp/ltsmin12767326260004032376;'/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/ltsmin12767326260004032376;'/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/ltsmin12767326260004032376;'/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 21:38:31] [INFO ] Flatten gal took : 148 ms
[2024-05-21 21:38:31] [INFO ] Flatten gal took : 148 ms
[2024-05-21 21:38:31] [INFO ] Time to serialize gal into /tmp/LTL7941507364440285905.gal : 24 ms
[2024-05-21 21:38:31] [INFO ] Time to serialize properties into /tmp/LTL5643780784787021607.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/LTL7941507364440285905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10038593369348684076.hoa' '-atoms' '/tmp/LTL5643780784787021607.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/LTL5643780784787021607.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10038593369348684076.hoa
Detected timeout of ITS tools.
[2024-05-21 21:38:47] [INFO ] Flatten gal took : 229 ms
[2024-05-21 21:38:47] [INFO ] Flatten gal took : 207 ms
[2024-05-21 21:38:47] [INFO ] Time to serialize gal into /tmp/LTL2916833505091588446.gal : 24 ms
[2024-05-21 21:38:47] [INFO ] Time to serialize properties into /tmp/LTL5992095385398711407.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/LTL2916833505091588446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5992095385398711407.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(("(((p6==0)||(p20==0))||((p218==0)||(p382==0)))")&&(("(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&...336
Formula 0 simplified : F(!"(((p6==0)||(p20==0))||((p218==0)||(p382==0)))" | (!"(((((p68==1)&&(p99==1))&&((p136==1)&&(p161==1)))&&(((p192==1)&&(p223==1))&&(...324
Detected timeout of ITS tools.
[2024-05-21 21:39:02] [INFO ] Flatten gal took : 208 ms
[2024-05-21 21:39:02] [INFO ] Applying decomposition
[2024-05-21 21:39:03] [INFO ] Flatten gal took : 209 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/graph15378381732974876408.txt' '-o' '/tmp/graph15378381732974876408.bin' '-w' '/tmp/graph15378381732974876408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15378381732974876408.bin' '-l' '-1' '-v' '-w' '/tmp/graph15378381732974876408.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:39:03] [INFO ] Decomposing Gal with order
[2024-05-21 21:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:39:03] [INFO ] Removed a total of 12084 redundant transitions.
[2024-05-21 21:39:03] [INFO ] Flatten gal took : 250 ms
[2024-05-21 21:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 41 ms.
[2024-05-21 21:39:04] [INFO ] Time to serialize gal into /tmp/LTL18013113047604470440.gal : 3 ms
[2024-05-21 21:39:04] [INFO ] Time to serialize properties into /tmp/LTL17615788864964199822.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/LTL18013113047604470440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17615788864964199822.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(("(((u0.p6==0)||(u0.p20==0))||((i2.u12.p218==0)||(u0.p382==0)))")&&(("(((((i2.u1.p68==1)&&(i2.u3.p99==1))&&((i2.u6.p136==1)&&(i2...452
Formula 0 simplified : F(!"(((u0.p6==0)||(u0.p20==0))||((i2.u12.p218==0)||(u0.p382==0)))" | (!"(((((i2.u1.p68==1)&&(i2.u3.p99==1))&&((i2.u6.p136==1)&&(i2.u...440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1567758966628036642
[2024-05-21 21:39:19] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1567758966628036642
Running compilation step : cd /tmp/ltsmin1567758966628036642;'/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/ltsmin1567758966628036642;'/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/ltsmin1567758966628036642;'/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-10b-LTLFireability-01 finished in 87845 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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&&F(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' '!(X(X(X(X((p0||F(G((p1 U !p2)))))))))'
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(X(G((p0&&(G(F(p0))||p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-10b-LTLFireability-15
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 352 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 1779/1779 transitions.
Graph (trivial) has 332 edges and 352 vertex of which 4 / 352 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 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 130 place count 349 transition count 1647
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 186 rules applied. Total rules applied 316 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 350 place count 186 transition count 1590
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 186 transition count 1584
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 362 place count 180 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 365 place count 177 transition count 1581
Iterating global reduction 3 with 3 rules applied. Total rules applied 368 place count 177 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 369 place count 176 transition count 1571
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 176 transition count 1571
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 372 place count 176 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 175 transition count 1569
Performed 78 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 529 place count 97 transition count 1490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 97 transition count 1489
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 548 place count 79 transition count 1310
Iterating global reduction 6 with 18 rules applied. Total rules applied 566 place count 79 transition count 1310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 575 place count 79 transition count 1301
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 579 place count 77 transition count 1299
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 581 place count 75 transition count 1297
Applied a total of 581 rules in 252 ms. Remains 75 /352 variables (removed 277) and now considering 1297/1779 (removed 482) transitions.
// Phase 1: matrix 1297 rows 75 cols
[2024-05-21 21:39:23] [INFO ] Computed 14 invariants in 7 ms
[2024-05-21 21:39:23] [INFO ] Implicit Places using invariants in 669 ms returned []
[2024-05-21 21:39:23] [INFO ] Invariant cache hit.
[2024-05-21 21:39:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:39:24] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned [70, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1808 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 73/352 places, 1297/1779 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 72 transition count 1296
Applied a total of 2 rules in 48 ms. Remains 72 /73 variables (removed 1) and now considering 1296/1297 (removed 1) transitions.
// Phase 1: matrix 1296 rows 72 cols
[2024-05-21 21:39:24] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 21:39:25] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-21 21:39:25] [INFO ] Invariant cache hit.
[2024-05-21 21:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:39:26] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 72/352 places, 1296/1779 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4006 ms. Remains : 72/352 places, 1296/1779 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (NEQ s1 1) (NEQ s4 1) (NEQ s37 1) (NEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 640 reset in 220 ms.
Product exploration explored 100000 steps with 217 reset in 139 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 470 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 454285 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454285 steps, saw 76512 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:39:30] [INFO ] Invariant cache hit.
[2024-05-21 21:39:30] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:39:31] [INFO ] After 480ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:39:31] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:39:31] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-21 21:39:31] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 280 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 58/72 places, 1272/1296 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 551833 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 551833 steps, saw 75085 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1272 rows 58 cols
[2024-05-21 21:39:34] [INFO ] Computed 12 invariants in 6 ms
[2024-05-21 21:39:34] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-21 21:39:35] [INFO ] After 459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:39:35] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:39:35] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 21:39:35] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 58/58 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 82 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-21 21:39:35] [INFO ] Invariant cache hit.
[2024-05-21 21:39:36] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-21 21:39:36] [INFO ] Invariant cache hit.
[2024-05-21 21:39:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:39:37] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2024-05-21 21:39:37] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-21 21:39:37] [INFO ] Invariant cache hit.
[2024-05-21 21:39:38] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2754 ms. Remains : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 86 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 21:39:38] [INFO ] Invariant cache hit.
[2024-05-21 21:39:38] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:39:38] [INFO ] After 456ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:38] [INFO ] After 518ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-21 21:39:39] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
// Phase 1: matrix 1296 rows 72 cols
[2024-05-21 21:39:39] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 21:39:40] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-21 21:39:40] [INFO ] Invariant cache hit.
[2024-05-21 21:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:39:41] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2024-05-21 21:39:41] [INFO ] Invariant cache hit.
[2024-05-21 21:39:41] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2466 ms. Remains : 72/72 places, 1296/1296 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 497 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452703 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452703 steps, saw 76257 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-21 21:39:45] [INFO ] Invariant cache hit.
[2024-05-21 21:39:45] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:39:45] [INFO ] After 479ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:39:45] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:39:45] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-21 21:39:45] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Graph (complete) has 1052 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 71 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1282
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1282
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 70 transition count 1271
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 27 place count 59 transition count 1271
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 59 transition count 1272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 58 transition count 1272
Applied a total of 29 rules in 288 ms. Remains 58 /72 variables (removed 14) and now considering 1272/1296 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 58/72 places, 1272/1296 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 551754 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 551754 steps, saw 75074 distinct states, run finished after 3003 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1272 rows 58 cols
[2024-05-21 21:39:49] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 21:39:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2024-05-21 21:39:49] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:39:49] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-21 21:39:50] [INFO ] After 93ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:39:50] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 58/58 places, 1272/1272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
[2024-05-21 21:39:50] [INFO ] Invariant cache hit.
[2024-05-21 21:39:50] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-21 21:39:50] [INFO ] Invariant cache hit.
[2024-05-21 21:39:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 21:39:51] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-05-21 21:39:52] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-21 21:39:52] [INFO ] Invariant cache hit.
[2024-05-21 21:39:52] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2655 ms. Remains : 58/58 places, 1272/1272 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1272/1272 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-21 21:39:52] [INFO ] Invariant cache hit.
[2024-05-21 21:39:52] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-21 21:39:53] [INFO ] After 458ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 21:39:53] [INFO ] After 522ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-21 21:39:53] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 500 reset in 196 ms.
Product exploration explored 100000 steps with 86 reset in 109 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 123 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
[2024-05-21 21:39:54] [INFO ] Redundant transitions in 58 ms returned [1072]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1284 rows 71 cols
[2024-05-21 21:39:54] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 21:39:55] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/72 places, 1284/1296 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 71 transition count 1286
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 123 ms. Remains 71 /71 variables (removed 0) and now considering 1286/1284 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/72 places, 1286/1296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1060 ms. Remains : 71/72 places, 1286/1296 transitions.
Built C files in :
/tmp/ltsmin1822381846216282358
[2024-05-21 21:39:55] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1822381846216282358
Running compilation step : cd /tmp/ltsmin1822381846216282358;'/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/ltsmin1822381846216282358;'/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/ltsmin1822381846216282358;'/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 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1296/1296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 71 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 1285
Applied a total of 2 rules in 32 ms. Remains 71 /72 variables (removed 1) and now considering 1285/1296 (removed 11) transitions.
// Phase 1: matrix 1285 rows 71 cols
[2024-05-21 21:39:58] [INFO ] Computed 12 invariants in 7 ms
[2024-05-21 21:39:59] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-21 21:39:59] [INFO ] Invariant cache hit.
[2024-05-21 21:39:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:40:00] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-05-21 21:40:00] [INFO ] Invariant cache hit.
[2024-05-21 21:40:01] [INFO ] Dead Transitions using invariants and state equation in 734 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/72 places, 1285/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2696 ms. Remains : 71/72 places, 1285/1296 transitions.
Built C files in :
/tmp/ltsmin9062139343163767784
[2024-05-21 21:40:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9062139343163767784
Running compilation step : cd /tmp/ltsmin9062139343163767784;'/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/ltsmin9062139343163767784;'/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/ltsmin9062139343163767784;'/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 21:40:04] [INFO ] Flatten gal took : 200 ms
[2024-05-21 21:40:04] [INFO ] Flatten gal took : 203 ms
[2024-05-21 21:40:05] [INFO ] Time to serialize gal into /tmp/LTL13759628672311080286.gal : 23 ms
[2024-05-21 21:40:05] [INFO ] Time to serialize properties into /tmp/LTL12842769551467700707.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/LTL13759628672311080286.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10766453577089999131.hoa' '-atoms' '/tmp/LTL12842769551467700707.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/LTL12842769551467700707.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10766453577089999131.hoa
Detected timeout of ITS tools.
[2024-05-21 21:40:20] [INFO ] Flatten gal took : 206 ms
[2024-05-21 21:40:20] [INFO ] Flatten gal took : 208 ms
[2024-05-21 21:40:20] [INFO ] Time to serialize gal into /tmp/LTL16427909486189905611.gal : 25 ms
[2024-05-21 21:40:20] [INFO ] Time to serialize properties into /tmp/LTL8197792585912174671.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/LTL16427909486189905611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8197792585912174671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))")&&(("(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))")||(G(F("(((p6!=1)||(p14!=...193
Formula 0 simplified : XXF(!"(((p6!=1)||(p14!=1))||((p194!=1)||(p382!=1)))" | (!"(((p6!=1)||(p20!=1))||((p98!=1)||(p382!=1)))" & FG!"(((p6!=1)||(p14!=1))||...181
Detected timeout of ITS tools.
[2024-05-21 21:40:35] [INFO ] Flatten gal took : 200 ms
[2024-05-21 21:40:35] [INFO ] Applying decomposition
[2024-05-21 21:40:36] [INFO ] Flatten gal took : 202 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/graph10965328696193359182.txt' '-o' '/tmp/graph10965328696193359182.bin' '-w' '/tmp/graph10965328696193359182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10965328696193359182.bin' '-l' '-1' '-v' '-w' '/tmp/graph10965328696193359182.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:40:36] [INFO ] Decomposing Gal with order
[2024-05-21 21:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:40:36] [INFO ] Removed a total of 11651 redundant transitions.
[2024-05-21 21:40:36] [INFO ] Flatten gal took : 236 ms
[2024-05-21 21:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 95 ms.
[2024-05-21 21:40:37] [INFO ] Time to serialize gal into /tmp/LTL7167473474583791371.gal : 11 ms
[2024-05-21 21:40:37] [INFO ] Time to serialize properties into /tmp/LTL5441512424661273406.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/LTL7167473474583791371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5441512424661273406.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(X(G(("(((u0.p6!=1)||(u0.p14!=1))||((i1.u9.p194!=1)||(u0.p382!=1)))")&&(("(((u0.p6!=1)||(u0.p20!=1))||((u3.p98!=1)||(u0.p382!=1)))...235
Formula 0 simplified : XXF(!"(((u0.p6!=1)||(u0.p14!=1))||((i1.u9.p194!=1)||(u0.p382!=1)))" | (!"(((u0.p6!=1)||(u0.p20!=1))||((u3.p98!=1)||(u0.p382!=1)))" &...223
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6219900743770661548
[2024-05-21 21:40:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6219900743770661548
Running compilation step : cd /tmp/ltsmin6219900743770661548;'/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/ltsmin6219900743770661548;'/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/ltsmin6219900743770661548;'/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-10b-LTLFireability-15 finished in 92477 ms.
[2024-05-21 21:40:55] [INFO ] Flatten gal took : 174 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin190372259501191234
[2024-05-21 21:40:55] [INFO ] Too many transitions (1779) to apply POR reductions. Disabling POR matrices.
[2024-05-21 21:40:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin190372259501191234
Running compilation step : cd /tmp/ltsmin190372259501191234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' '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 21:40:55] [INFO ] Applying decomposition
[2024-05-21 21:40:55] [INFO ] Flatten gal took : 173 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/graph3504563228778177351.txt' '-o' '/tmp/graph3504563228778177351.bin' '-w' '/tmp/graph3504563228778177351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3504563228778177351.bin' '-l' '-1' '-v' '-w' '/tmp/graph3504563228778177351.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:40:56] [INFO ] Decomposing Gal with order
[2024-05-21 21:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:40:57] [INFO ] Removed a total of 12113 redundant transitions.
[2024-05-21 21:40:57] [INFO ] Flatten gal took : 442 ms
[2024-05-21 21:40:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 46 ms.
[2024-05-21 21:40:57] [INFO ] Time to serialize gal into /tmp/LTLFireability7938360171851170238.gal : 15 ms
[2024-05-21 21:40:57] [INFO ] Time to serialize properties into /tmp/LTLFireability7067822136321585563.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/LTLFireability7938360171851170238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7067822136321585563.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 7 LTL properties
Checking formula 0 : !(((G(("(((i1.u2.p6==0)||(i1.u2.p20==0))||((i1.u2.p218==0)||(i1.u2.p382==0)))")&&(("(((((i12.u18.p68==1)&&(i12.u26.p99==1))&&((i12.u37...496
Formula 0 simplified : F(!"(((i1.u2.p6==0)||(i1.u2.p20==0))||((i1.u2.p218==0)||(i1.u2.p382==0)))" | (!"(((((i12.u18.p68==1)&&(i12.u26.p99==1))&&((i12.u37.p...484
Compilation finished in 11684 ms.
Running link step : cd /tmp/ltsmin190372259501191234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 132 ms.
Running LTSmin : cd /tmp/ltsmin190372259501191234;'/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' '([](((LTLAPp0==true)&&((LTLAPp1==true)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin190372259501191234;'/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' '([](((LTLAPp0==true)&&((LTLAPp1==true)||[]((LTLAPp0==true)))))||X(<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin190372259501191234;'/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 (>514 s) on command cd /tmp/ltsmin190372259501191234;'/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/ltsmin190372259501191234;'/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' '<>(([]((LTLAPp4==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:06:16] [INFO ] Applying decomposition
[2024-05-21 22:06:16] [INFO ] Flatten gal took : 364 ms
[2024-05-21 22:06:16] [INFO ] Decomposing Gal with order
[2024-05-21 22:06:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:06:18] [INFO ] Removed a total of 12796 redundant transitions.
[2024-05-21 22:06:18] [INFO ] Flatten gal took : 829 ms
[2024-05-21 22:06:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 107 ms.
[2024-05-21 22:06:18] [INFO ] Time to serialize gal into /tmp/LTLFireability10385466544327186988.gal : 4 ms
[2024-05-21 22:06:18] [INFO ] Time to serialize properties into /tmp/LTLFireability814326603879711693.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10385466544327186988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability814326603879711693.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 7 LTL properties
Checking formula 0 : !(((G(("(((i0.u2.p6==0)||(i0.u3.p20==0))||((i1.i0.i0.i0.i0.i0.i0.u20.p218==0)||(i1.i0.u25.p382==0)))")&&(("(((((i1.i0.i0.i0.i0.i0.i0.i...740
Formula 0 simplified : F(!"(((i0.u2.p6==0)||(i0.u3.p20==0))||((i1.i0.i0.i0.i0.i0.i0.u20.p218==0)||(i1.i0.u25.p382==0)))" | (!"(((((i1.i0.i0.i0.i0.i0.i0.i0....728
Reverse transition relation is NOT exact ! Due to transitions t394, t584, t664, i0.u2.t335, i0.u3.t333, i1.t1776, i1.i0.u25.t33, i1.i0.u25.t36, i1.i0.u25.t...2333
Computing Next relation with stutter on 3.45702e+07 deadlock states
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin190372259501191234;'/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' '<>(([]((LTLAPp4==true))||[]((LTLAPp5==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin190372259501191234;'/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)&&<>((LTLAPp8==true))))||(LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin190372259501191234;'/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)&&<>((LTLAPp8==true))))||(LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin190372259501191234;'/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(X(X(((LTLAPp9==true)||<>([](((LTLAPp10==true) U !(LTLAPp11==true)))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin190372259501191234;'/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(X(X(((LTLAPp9==true)||<>([](((LTLAPp10==true) U !(LTLAPp11==true)))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin190372259501191234;'/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' '<>([]((LTLAPp12==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11718748 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16014588 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-10b"
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-10b, 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-171620180400233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b 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 ;