MCC'2025- Execution of r128-smll-174876524200266

About the Execution of ITS-Tools for MedleyA-PT-22

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	3600000.00	0.00	0.00	FTFFTTFT??F?F???	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200266.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-22, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 238K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-22-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-22-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748894234833

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 19:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 19:57:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:57:18] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2025-06-02 19:57:18] [INFO ] Transformed 307 places.
[2025-06-02 19:57:18] [INFO ] Transformed 740 transitions.
[2025-06-02 19:57:18] [INFO ] Found NUPN structural information;
[2025-06-02 19:57:18] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 96 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 78 place count 229 transition count 656
Iterating global reduction 1 with 74 rules applied. Total rules applied 152 place count 229 transition count 656
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 157 place count 229 transition count 651
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 168 place count 218 transition count 637
Iterating global reduction 2 with 11 rules applied. Total rules applied 179 place count 218 transition count 637
Applied a total of 179 rules in 159 ms. Remains 218 /307 variables (removed 89) and now considering 637/740 (removed 103) transitions.
// Phase 1: matrix 637 rows 218 cols
[2025-06-02 19:57:18] [INFO ] Computed 22 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:57:19] [INFO ] Implicit Places using invariants in 589 ms returned []
[2025-06-02 19:57:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:57:19] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Running 636 sub problems to find dead transitions.
[2025-06-02 19:57:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/218 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:38] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:39] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:39] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:39] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:40] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:40] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:41] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:41] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:41] [INFO ] Deduced a trap composed of 46 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:42] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:42] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:43] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:43] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:43] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 14/36 constraints. Problems are: Problem set: 144 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 218/855 variables, and 36 constraints, problems are : Problem set: 144 solved, 492 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 0/218 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 492 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 1/218 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 14/36 constraints. Problems are: Problem set: 144 solved, 492 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:57:58] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 1/37 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/37 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 6 (OVERLAPS) 637/855 variables, 218/255 constraints. Problems are: Problem set: 144 solved, 492 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 492/747 constraints. Problems are: Problem set: 144 solved, 492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 747 constraints, problems are : Problem set: 144 solved, 492 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 492/636 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62453ms problems are : Problem set: 144 solved, 492 unsolved
Search for dead transitions found 144 dead transitions in 62499ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 218/307 places, 493/740 transitions.
Applied a total of 0 rules in 8 ms. Remains 218 /218 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64136 ms. Remains : 218/307 places, 493/740 transitions.
Support contains 96 out of 218 places after structural reductions.
[2025-06-02 19:58:22] [INFO ] Flatten gal took : 126 ms
[2025-06-02 19:58:22] [INFO ] Flatten gal took : 67 ms
[2025-06-02 19:58:23] [INFO ] Input system was already deterministic with 493 transitions.
RANDOM walk for 40000 steps (1164 resets) in 4739 ms. (8 steps per ms) remains 61/90 properties
BEST_FIRST walk for 4004 steps (15 resets) in 55 ms. (71 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (24 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (18 resets) in 42 ms. (93 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (19 resets) in 63 ms. (62 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (24 resets) in 67 ms. (58 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (25 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (19 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (24 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (17 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (16 resets) in 55 ms. (71 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (23 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (23 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (23 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (20 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (21 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (21 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (18 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (23 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (24 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (21 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (21 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (22 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (18 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (23 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (18 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (21 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
// Phase 1: matrix 493 rows 218 cols
[2025-06-02 19:58:25] [INFO ] Computed 22 invariants in 7 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/140 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 53 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 3 (OVERLAPS) 66/206 variables, 16/22 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/22 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 485/691 variables, 206/228 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 0/228 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 14/705 variables, 9/237 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 0/237 constraints. Problems are: Problem set: 13 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 5/710 variables, 2/239 constraints. Problems are: Problem set: 13 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:29] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 1/240 constraints. Problems are: Problem set: 13 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/711 variables, and 240 constraints, problems are : Problem set: 13 solved, 47 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 217/218 constraints, PredecessorRefiner: 60/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 13 solved, 47 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/136 variables, 6/6 constraints. Problems are: Problem set: 17 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:30] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:30] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 2/8 constraints. Problems are: Problem set: 17 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 17 solved, 43 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 4 (OVERLAPS) 70/206 variables, 16/24 constraints. Problems are: Problem set: 18 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:31] [INFO ] Deduced a trap composed of 77 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:32] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:32] [INFO ] Deduced a trap composed of 40 places in 249 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:32] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:33] [INFO ] Deduced a trap composed of 72 places in 241 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:33] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 33 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 6/30 constraints. Problems are: Problem set: 18 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:33] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 18 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:34] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/32 constraints. Problems are: Problem set: 18 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:34] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/33 constraints. Problems are: Problem set: 18 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 18 solved, 42 unsolved
SMT process timed out in 10255ms, After SMT, problems are : Problem set: 18 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 216 transition count 476
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 202 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 200 transition count 474
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 34 place count 200 transition count 467
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 48 place count 193 transition count 467
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 62 place count 179 transition count 443
Iterating global reduction 3 with 14 rules applied. Total rules applied 76 place count 179 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 179 transition count 441
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 81 place count 176 transition count 437
Iterating global reduction 4 with 3 rules applied. Total rules applied 84 place count 176 transition count 437
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 104 place count 166 transition count 427
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 165 transition count 426
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 165 transition count 426
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 122 place count 157 transition count 530
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 170 place count 157 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 197 place count 157 transition count 455
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 157 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 199 place count 156 transition count 454
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 204 place count 156 transition count 465
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 209 place count 151 transition count 465
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 235 place count 151 transition count 465
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 239 place count 147 transition count 459
Iterating global reduction 7 with 4 rules applied. Total rules applied 243 place count 147 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 245 place count 147 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 146 transition count 456
Applied a total of 246 rules in 222 ms. Remains 146 /218 variables (removed 72) and now considering 456/493 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 146/218 places, 456/493 transitions.
RANDOM walk for 40000 steps (2050 resets) in 1328 ms. (30 steps per ms) remains 32/42 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (26 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (28 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (16 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
// Phase 1: matrix 456 rows 146 cols
[2025-06-02 19:58:36] [INFO ] Computed 23 invariants in 4 ms
[2025-06-02 19:58:36] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 44/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 40/142 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:36] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:37] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 3/145 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 456/601 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 1/602 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 0/602 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 191 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3479 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 146/146 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 32/28 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 44/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 40/142 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:40] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:40] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:40] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 3/145 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:41] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 456/601 variables, 145/174 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 15/209 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:43] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:43] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/601 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:44] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 17 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/601 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:46] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 13 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/601 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/601 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 1/602 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/602 variables, 13/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:58:55] [INFO ] Deduced a trap along path composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:01] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:02] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 15 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:10] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 9 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/602 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 231 constraints, problems are : Problem set: 0 solved, 32 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 146/146 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 32/28 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48548ms problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 456/456 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 143 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 143 transition count 453
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 141 transition count 479
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 141 transition count 501
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 138 transition count 501
Applied a total of 16 rules in 37 ms. Remains 138 /146 variables (removed 8) and now considering 501/456 (removed -45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 138/146 places, 501/456 transitions.
RANDOM walk for 40000 steps (2079 resets) in 718 ms. (55 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (28 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (26 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (18 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 286506 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :7 out of 32
Probabilistic random walk after 286506 steps, saw 65615 distinct states, run finished after 3010 ms. (steps per millisecond=95 ) properties seen :7
// Phase 1: matrix 501 rows 138 cols
[2025-06-02 19:59:28] [INFO ] Computed 23 invariants in 4 ms
[2025-06-02 19:59:28] [INFO ] State equation strengthened by 24 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 47/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/96 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 39/135 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 2/137 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 501/638 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 24/184 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 1/639 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/639 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 185 constraints, problems are : Problem set: 0 solved, 25 unsolved in 2941 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 138/138 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 25/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 47/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:31] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 4/96 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 39/135 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:32] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:32] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:32] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 2/137 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:33] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 501/638 variables, 137/165 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/638 variables, 11/200 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:34] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:35] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:36] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:36] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 15 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/638 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 1/639 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/639 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:47] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:59:51] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/639 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/639 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 22 (OVERLAPS) 0/639 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 217 constraints, problems are : Problem set: 0 solved, 25 unsolved in 33572 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 138/138 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 25/21 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36568ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 20 properties in 31443 ms.
Support contains 16 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 501/501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 138 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 137 transition count 500
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 9 place count 130 transition count 484
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 130 transition count 484
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 126 transition count 460
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 126 transition count 460
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 124 transition count 455
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 124 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 115 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 114 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 114 transition count 450
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 114 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 66 place count 109 transition count 445
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 109 transition count 572
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 82 place count 101 transition count 572
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 101 transition count 572
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 100 transition count 547
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 100 transition count 547
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 98 transition count 545
Applied a total of 89 rules in 112 ms. Remains 98 /138 variables (removed 40) and now considering 545/501 (removed -44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 98/138 places, 545/501 transitions.
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-22-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:00:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 20:00:36] [INFO ] Flatten gal took : 68 ms
FORMULA MedleyA-PT-22-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:00:36] [INFO ] Flatten gal took : 42 ms
[2025-06-02 20:00:36] [INFO ] Input system was already deterministic with 493 transitions.
Support contains 71 out of 218 places (down from 77) after GAL structural reductions.
Computed a total of 18 stabilizing places and 19 stable transitions
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 215 transition count 460
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 185 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 184 transition count 458
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 64 place count 184 transition count 453
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 74 place count 179 transition count 453
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 97 place count 156 transition count 408
Iterating global reduction 3 with 23 rules applied. Total rules applied 120 place count 156 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 120 place count 156 transition count 407
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 155 transition count 407
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 135 place count 142 transition count 364
Iterating global reduction 3 with 13 rules applied. Total rules applied 148 place count 142 transition count 364
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 154 place count 136 transition count 349
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 136 transition count 349
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 133 transition count 340
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 133 transition count 340
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 213 place count 108 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 108 transition count 316
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 221 place count 102 transition count 304
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 102 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 230 place count 102 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 99 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 97 transition count 296
Applied a total of 238 rules in 76 ms. Remains 97 /218 variables (removed 121) and now considering 296/493 (removed 197) transitions.
// Phase 1: matrix 296 rows 97 cols
[2025-06-02 20:00:36] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 20:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:00:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 20:00:37] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:00:37] [INFO ] Redundant transitions in 20 ms returned []
Running 284 sub problems to find dead transitions.
[2025-06-02 20:00:37] [INFO ] Invariant cache hit.
[2025-06-02 20:00:37] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 4/96 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 295/391 variables, 96/115 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 2/393 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 152 constraints, problems are : Problem set: 0 solved, 284 unsolved in 27404 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 4/96 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 295/391 variables, 96/115 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 283/434 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:01:15] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 284 unsolved
SMT process timed out in 57691ms, After SMT, problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 57693ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/218 places, 296/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58120 ms. Remains : 97/218 places, 296/493 transitions.
[2025-06-02 20:01:34] [INFO ] Flatten gal took : 27 ms
[2025-06-02 20:01:34] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:01:35] [INFO ] Input system was already deterministic with 296 transitions.
[2025-06-02 20:01:35] [INFO ] Flatten gal took : 22 ms
[2025-06-02 20:01:35] [INFO ] Flatten gal took : 22 ms
[2025-06-02 20:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8279721266232961695.gal : 19 ms
[2025-06-02 20:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12308671751546319114.ctl : 5 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8279721266232961695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12308671751546319114.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15804e+09,24.7313,521144,2,17314,5,1.91403e+06,6,0,677,2.25333e+06,0

Converting to forward existential form...Done !
original formula: EF((((p160==1) * !(A((p58==1) U (p259==1)))) * ((p120==0)||(p158==0))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * ((p120==0)||(p158==0))) * (p160==1)),!((p259==1))) * (!((p58==1)) * !((p259==1))))] ...253
Hit Full ! (commute/partial/dont) 294/0/2
(forward)formula 0,1,28.6883,521144,1,0,12,1.91403e+06,21,5,1462,2.25333e+06,7
FORMULA MedleyA-PT-22-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 215 transition count 462
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 187 transition count 461
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 58 place count 187 transition count 456
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 182 transition count 456
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 91 place count 159 transition count 412
Iterating global reduction 2 with 23 rules applied. Total rules applied 114 place count 159 transition count 412
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 125 place count 148 transition count 378
Iterating global reduction 2 with 11 rules applied. Total rules applied 136 place count 148 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 143 place count 141 transition count 360
Iterating global reduction 2 with 7 rules applied. Total rules applied 150 place count 141 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 138 transition count 351
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 138 transition count 351
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 201 place count 114 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 114 transition count 329
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 207 place count 109 transition count 320
Iterating global reduction 3 with 5 rules applied. Total rules applied 212 place count 109 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 215 place count 109 transition count 317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 106 transition count 314
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 104 transition count 312
Applied a total of 223 rules in 196 ms. Remains 104 /218 variables (removed 114) and now considering 312/493 (removed 181) transitions.
// Phase 1: matrix 312 rows 104 cols
[2025-06-02 20:02:04] [INFO ] Computed 19 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 20:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:02:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 20:02:04] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:02:04] [INFO ] Redundant transitions in 8 ms returned []
Running 299 sub problems to find dead transitions.
[2025-06-02 20:02:04] [INFO ] Invariant cache hit.
[2025-06-02 20:02:04] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 5/103 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 311/414 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 2/416 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (OVERLAPS) 0/416 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 159 constraints, problems are : Problem set: 0 solved, 299 unsolved in 24530 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 5/103 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 311/414 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 36/158 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 298/456 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:02:42] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/416 variables, and 457 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 298/299 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54967ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 54969ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/218 places, 312/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55688 ms. Remains : 104/218 places, 312/493 transitions.
[2025-06-02 20:02:59] [INFO ] Flatten gal took : 31 ms
[2025-06-02 20:02:59] [INFO ] Flatten gal took : 31 ms
[2025-06-02 20:02:59] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-02 20:02:59] [INFO ] Flatten gal took : 35 ms
[2025-06-02 20:02:59] [INFO ] Flatten gal took : 28 ms
[2025-06-02 20:02:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14446326828618436992.gal : 20 ms
[2025-06-02 20:02:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13694630977549186272.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14446326828618436992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13694630977549186272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:03:30] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:03:30] [INFO ] Applying decomposition
[2025-06-02 20:03:30] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2183656767744214826.txt' '-o' '/tmp/graph2183656767744214826.bin' '-w' '/tmp/graph2183656767744214826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2183656767744214826.bin' '-l' '-1' '-v' '-w' '/tmp/graph2183656767744214826.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:03:30] [INFO ] Decomposing Gal with order
[2025-06-02 20:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:03:30] [INFO ] Removed a total of 742 redundant transitions.
[2025-06-02 20:03:30] [INFO ] Flatten gal took : 108 ms
[2025-06-02 20:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 27 ms.
[2025-06-02 20:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9238818403862099167.gal : 4 ms
[2025-06-02 20:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2897229675557904444.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9238818403862099167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2897229675557904444.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.12274e+09,3.45992,75928,681,202,108093,1765,310,429081,143,11797,0

Converting to forward existential form...Done !
original formula: (A((u6.p64!=1) U E(AF((((i2.i1.u7.p120==1)&&(i2.i0.u10.p141==1))&&((i3.i0.u15.p210==1)&&(i3.i0.u21.p271==1)))) U EF((u6.p84==1)))) * AF((...167
=> equivalent forward existential formula: (([((FwdU(Init,!(E(!(EG(!((((i2.i1.u7.p120==1)&&(i2.i0.u10.p141==1))&&((i3.i0.u15.p210==1)&&(i3.i0.u21.p271==1))...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,11.3368,197248,1,0,281763,4457,1220,1.11512e+06,549,26105,190405
FORMULA MedleyA-PT-22-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 194 transition count 452
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 194 transition count 452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 194 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 183 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 183 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 177 transition count 399
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 177 transition count 399
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 174 transition count 390
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 174 transition count 390
Applied a total of 91 rules in 22 ms. Remains 174 /218 variables (removed 44) and now considering 390/493 (removed 103) transitions.
// Phase 1: matrix 390 rows 174 cols
[2025-06-02 20:03:41] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:03:42] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-02 20:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:03:42] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2025-06-02 20:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:51] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:51] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:51] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:51] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:52] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:52] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:03:52] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 390/564 variables, 174/203 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:04] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 21 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 204 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 390/564 variables, 174/204 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 389/593 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:04:39] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 594 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60718ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Starting structural reductions in LTL mode, iteration 1 : 174/218 places, 390/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61439 ms. Remains : 174/218 places, 390/493 transitions.
[2025-06-02 20:04:43] [INFO ] Flatten gal took : 28 ms
[2025-06-02 20:04:43] [INFO ] Flatten gal took : 29 ms
[2025-06-02 20:04:43] [INFO ] Input system was already deterministic with 390 transitions.
[2025-06-02 20:04:43] [INFO ] Flatten gal took : 27 ms
[2025-06-02 20:04:43] [INFO ] Flatten gal took : 27 ms
[2025-06-02 20:04:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3763729550803461311.gal : 7 ms
[2025-06-02 20:04:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4068581455196339389.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3763729550803461311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4068581455196339389.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:05:13] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:05:13] [INFO ] Applying decomposition
[2025-06-02 20:05:13] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15622822727647815019.txt' '-o' '/tmp/graph15622822727647815019.bin' '-w' '/tmp/graph15622822727647815019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15622822727647815019.bin' '-l' '-1' '-v' '-w' '/tmp/graph15622822727647815019.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:05:13] [INFO ] Decomposing Gal with order
[2025-06-02 20:05:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:05:13] [INFO ] Removed a total of 740 redundant transitions.
[2025-06-02 20:05:13] [INFO ] Flatten gal took : 53 ms
[2025-06-02 20:05:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 19 ms.
[2025-06-02 20:05:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17698515562821083752.gal : 7 ms
[2025-06-02 20:05:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5824569919451904729.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17698515562821083752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5824569919451904729.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 193 transition count 447
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 193 transition count 447
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 193 transition count 444
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 179 transition count 399
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 179 transition count 399
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 172 transition count 381
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 172 transition count 381
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 170 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 170 transition count 375
Applied a total of 99 rules in 16 ms. Remains 170 /218 variables (removed 48) and now considering 375/493 (removed 118) transitions.
// Phase 1: matrix 375 rows 170 cols
[2025-06-02 20:05:43] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:05:44] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-02 20:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:05:44] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2025-06-02 20:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:51] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:51] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:51] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:51] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:52] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:52] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:52] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:05:52] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/545 variables, 170/200 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:02] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 21 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 201 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/545 variables, 170/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 374/575 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:32] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:06:34] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 577 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Starting structural reductions in LTL mode, iteration 1 : 170/218 places, 375/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60896 ms. Remains : 170/218 places, 375/493 transitions.
[2025-06-02 20:06:44] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:06:44] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:06:44] [INFO ] Input system was already deterministic with 375 transitions.
[2025-06-02 20:06:44] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:06:44] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:06:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1851231848718688428.gal : 4 ms
[2025-06-02 20:06:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13072968116001444135.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1851231848718688428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13072968116001444135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:07:15] [INFO ] Flatten gal took : 24 ms
[2025-06-02 20:07:15] [INFO ] Applying decomposition
[2025-06-02 20:07:15] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7712492370808210285.txt' '-o' '/tmp/graph7712492370808210285.bin' '-w' '/tmp/graph7712492370808210285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7712492370808210285.bin' '-l' '-1' '-v' '-w' '/tmp/graph7712492370808210285.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:07:15] [INFO ] Decomposing Gal with order
[2025-06-02 20:07:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:07:15] [INFO ] Removed a total of 646 redundant transitions.
[2025-06-02 20:07:15] [INFO ] Flatten gal took : 38 ms
[2025-06-02 20:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 9 ms.
[2025-06-02 20:07:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2333157066557930444.gal : 4 ms
[2025-06-02 20:07:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18171014583118168209.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2333157066557930444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18171014583118168209.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55524e+11,16.4407,297308,5530,1327,450275,34258,573,1.24218e+06,205,282469,0

Converting to forward existential form...Done !
original formula: AF((A((i2.u15.p95==1) U A((((u2.p30==1)&&(u2.p91==1))&&((i6.u27.p210==1)&&(i8.u34.p228==1))) U (u2.p65==1))) + (A(((((u2.p30==1)&&(i9.i0....449
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(!((E(!((u2.p65==1)) U (!((((u2.p30==1)&&(u2.p91==1))&&((i6.u27.p210==1)&&(i8.u34.p228==1)))...959
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t148, t159, t161, t162, t174, t187, t189, t191, t192, t196, t259, t260, t263, t...1371
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 216 transition count 464
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 189 transition count 463
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 56 place count 189 transition count 459
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 185 transition count 459
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 88 place count 161 transition count 414
Iterating global reduction 2 with 24 rules applied. Total rules applied 112 place count 161 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 161 transition count 412
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 114 place count 161 transition count 411
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 160 transition count 411
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 128 place count 148 transition count 372
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 148 transition count 372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 146 place count 142 transition count 357
Iterating global reduction 3 with 6 rules applied. Total rules applied 152 place count 142 transition count 357
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 139 transition count 348
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 139 transition count 348
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 200 place count 117 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 117 transition count 327
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 206 place count 112 transition count 318
Iterating global reduction 4 with 5 rules applied. Total rules applied 211 place count 112 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 112 transition count 315
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 220 place count 109 transition count 312
Applied a total of 220 rules in 65 ms. Remains 109 /218 variables (removed 109) and now considering 312/493 (removed 181) transitions.
// Phase 1: matrix 312 rows 109 cols
[2025-06-02 20:07:45] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:07:45] [INFO ] Implicit Places using invariants in 121 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 108/218 places, 312/493 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 203 ms. Remains : 108/218 places, 312/493 transitions.
[2025-06-02 20:07:45] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:07:45] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:07:45] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-02 20:07:45] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:07:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 20:07:45] [INFO ] Time to serialize gal into /tmp/CTLFireability5351498822034802201.gal : 8 ms
[2025-06-02 20:07:45] [INFO ] Time to serialize properties into /tmp/CTLFireability12586931031751004470.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5351498822034802201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12586931031751004470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09256e+10,28.1819,541552,2,17729,5,1.73626e+06,6,0,739,2.59415e+06,0

Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 20:08:15] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:08:15] [INFO ] Applying decomposition
[2025-06-02 20:08:15] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8310173933390420051.txt' '-o' '/tmp/graph8310173933390420051.bin' '-w' '/tmp/graph8310173933390420051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8310173933390420051.bin' '-l' '-1' '-v' '-w' '/tmp/graph8310173933390420051.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:08:15] [INFO ] Decomposing Gal with order
[2025-06-02 20:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:08:15] [INFO ] Removed a total of 760 redundant transitions.
[2025-06-02 20:08:15] [INFO ] Flatten gal took : 30 ms
[2025-06-02 20:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 6 ms.
[2025-06-02 20:08:15] [INFO ] Time to serialize gal into /tmp/CTLFireability943313800219875909.gal : 2 ms
[2025-06-02 20:08:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16154292404032526792.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability943313800219875909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16154292404032526792.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09256e+10,0.916437,24160,750,150,35371,835,352,97663,107,5551,0

Converting to forward existential form...Done !
original formula: AG((AG((((((i1.u0.p30==0)||(i1.u8.p91==0))||((i5.u16.p210==0)||(i4.u18.p228==0)))&&(((i5.u16.p210==0)||(i5.u22.p271==0))||((i6.u23.p274==...259
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((((((i1.u0.p30==0)||(i1.u8.p91==0))||((i5.u16.p210==0)||(i4.u18.p228==0)))&&((...363
(forward)formula 0,0,1.19889,24288,1,0,35371,838,785,97663,179,5806,39728
FORMULA MedleyA-PT-22-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 188 transition count 441
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 188 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 188 transition count 437
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 173 transition count 389
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 173 transition count 389
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 165 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 165 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 162 transition count 359
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 162 transition count 359
Applied a total of 116 rules in 14 ms. Remains 162 /218 variables (removed 56) and now considering 359/493 (removed 134) transitions.
// Phase 1: matrix 359 rows 162 cols
[2025-06-02 20:08:17] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:08:17] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 20:08:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:08:17] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-02 20:08:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:25] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:25] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:25] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:25] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:25] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:26] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:08:36] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 191 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 358/549 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:05] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:05] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:09:09] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 552 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60544ms
Starting structural reductions in LTL mode, iteration 1 : 162/218 places, 359/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61010 ms. Remains : 162/218 places, 359/493 transitions.
[2025-06-02 20:09:18] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:09:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:09:18] [INFO ] Input system was already deterministic with 359 transitions.
[2025-06-02 20:09:18] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:09:18] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:09:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17048384963324630084.gal : 6 ms
[2025-06-02 20:09:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12752588317798693549.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17048384963324630084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12752588317798693549.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:09:48] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:09:48] [INFO ] Applying decomposition
[2025-06-02 20:09:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5877419072838009171.txt' '-o' '/tmp/graph5877419072838009171.bin' '-w' '/tmp/graph5877419072838009171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5877419072838009171.bin' '-l' '-1' '-v' '-w' '/tmp/graph5877419072838009171.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:09:48] [INFO ] Decomposing Gal with order
[2025-06-02 20:09:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:09:48] [INFO ] Removed a total of 647 redundant transitions.
[2025-06-02 20:09:48] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:09:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 7 ms.
[2025-06-02 20:09:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1420895088198612582.gal : 3 ms
[2025-06-02 20:09:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15289828971520400067.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1420895088198612582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15289828971520400067.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12547e+11,5.22553,117444,3219,1042,138743,19774,532,654494,170,174853,0

Converting to forward existential form...Done !
original formula: EX(EX(AF(((u16.p120==1)&&(u16.p158==1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EG(!(((u16.p120==1)&&(u16.p158==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t59, t100, t133, t144, t146, t150, t193, t196, t197, u16.t58, u16.t60, u16.t61, u16....1106
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 191 transition count 451
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 191 transition count 451
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 191 transition count 447
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 178 transition count 404
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 178 transition count 404
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 92 place count 170 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 100 place count 170 transition count 384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 167 transition count 375
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 167 transition count 375
Applied a total of 106 rules in 14 ms. Remains 167 /218 variables (removed 51) and now considering 375/493 (removed 118) transitions.
// Phase 1: matrix 375 rows 167 cols
[2025-06-02 20:10:18] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:10:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 20:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:10:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2025-06-02 20:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:27] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:27] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:27] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:27] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:28] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:28] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/542 variables, 167/195 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:10:39] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/542 variables, and 196 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 375/542 variables, 167/196 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 374/570 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:16] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:11:16] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 572 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60607ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Starting structural reductions in LTL mode, iteration 1 : 167/218 places, 375/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60992 ms. Remains : 167/218 places, 375/493 transitions.
[2025-06-02 20:11:19] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:11:19] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:11:19] [INFO ] Input system was already deterministic with 375 transitions.
[2025-06-02 20:11:19] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:11:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 20:11:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13420368315570694445.gal : 3 ms
[2025-06-02 20:11:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2007811302934620879.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13420368315570694445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2007811302934620879.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:11:49] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:11:49] [INFO ] Applying decomposition
[2025-06-02 20:11:49] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1609381276176022753.txt' '-o' '/tmp/graph1609381276176022753.bin' '-w' '/tmp/graph1609381276176022753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1609381276176022753.bin' '-l' '-1' '-v' '-w' '/tmp/graph1609381276176022753.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:11:49] [INFO ] Decomposing Gal with order
[2025-06-02 20:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:11:49] [INFO ] Removed a total of 661 redundant transitions.
[2025-06-02 20:11:49] [INFO ] Flatten gal took : 31 ms
[2025-06-02 20:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 4 ms.
[2025-06-02 20:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17849901277571026058.gal : 3 ms
[2025-06-02 20:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability3177951490072695136.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17849901277571026058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3177951490072695136.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 191 transition count 446
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 191 transition count 446
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 191 transition count 442
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 178 transition count 403
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 178 transition count 403
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 172 transition count 387
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 172 transition count 387
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 170 transition count 381
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 170 transition count 381
Applied a total of 100 rules in 14 ms. Remains 170 /218 variables (removed 48) and now considering 381/493 (removed 112) transitions.
// Phase 1: matrix 381 rows 170 cols
[2025-06-02 20:12:19] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:12:20] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 20:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:12:20] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-02 20:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:29] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:30] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 381/551 variables, 170/198 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:39] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:50] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:12:51] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 201 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 381/551 variables, 170/199 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 380/579 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:06] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:09] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:09] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:13:10] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 583 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60616ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60620ms
Starting structural reductions in LTL mode, iteration 1 : 170/218 places, 381/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61270 ms. Remains : 170/218 places, 381/493 transitions.
[2025-06-02 20:13:21] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:13:21] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:13:21] [INFO ] Input system was already deterministic with 381 transitions.
[2025-06-02 20:13:21] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:13:21] [INFO ] Flatten gal took : 27 ms
[2025-06-02 20:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9606968473897511802.gal : 4 ms
[2025-06-02 20:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8719492436734909377.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9606968473897511802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8719492436734909377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:13:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:13:51] [INFO ] Applying decomposition
[2025-06-02 20:13:51] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5632858115215489885.txt' '-o' '/tmp/graph5632858115215489885.bin' '-w' '/tmp/graph5632858115215489885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5632858115215489885.bin' '-l' '-1' '-v' '-w' '/tmp/graph5632858115215489885.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:13:51] [INFO ] Decomposing Gal with order
[2025-06-02 20:13:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:13:51] [INFO ] Removed a total of 630 redundant transitions.
[2025-06-02 20:13:51] [INFO ] Flatten gal took : 35 ms
[2025-06-02 20:13:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 6 ms.
[2025-06-02 20:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9649808036205762000.gal : 3 ms
[2025-06-02 20:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15887910457710639125.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9649808036205762000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15887910457710639125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 192 transition count 449
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 192 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 192 transition count 446
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 68 place count 179 transition count 405
Iterating global reduction 1 with 13 rules applied. Total rules applied 81 place count 179 transition count 405
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 88 place count 172 transition count 387
Iterating global reduction 1 with 7 rules applied. Total rules applied 95 place count 172 transition count 387
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 169 transition count 378
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 169 transition count 378
Applied a total of 101 rules in 11 ms. Remains 169 /218 variables (removed 49) and now considering 378/493 (removed 115) transitions.
// Phase 1: matrix 378 rows 169 cols
[2025-06-02 20:14:21] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:14:21] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 20:14:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:14:22] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-02 20:14:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:30] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:30] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:30] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:30] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:31] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:31] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/547 variables, 169/197 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:14:42] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 198 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/169 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 378/547 variables, 169/198 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 377/575 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:08] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:15:18] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 577 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 169/218 places, 378/493 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60926 ms. Remains : 169/218 places, 378/493 transitions.
[2025-06-02 20:15:22] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:15:22] [INFO ] Flatten gal took : 25 ms
[2025-06-02 20:15:22] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-02 20:15:22] [INFO ] Flatten gal took : 29 ms
[2025-06-02 20:15:22] [INFO ] Flatten gal took : 20 ms
[2025-06-02 20:15:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14308962854755175614.gal : 4 ms
[2025-06-02 20:15:22] [INFO ] Time to serialize properties into /tmp/CTLFireability708011815203451775.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14308962854755175614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability708011815203451775.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 20:15:52] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:15:52] [INFO ] Applying decomposition
[2025-06-02 20:15:52] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5690642720519652049.txt' '-o' '/tmp/graph5690642720519652049.bin' '-w' '/tmp/graph5690642720519652049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5690642720519652049.bin' '-l' '-1' '-v' '-w' '/tmp/graph5690642720519652049.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:15:52] [INFO ] Decomposing Gal with order
[2025-06-02 20:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:15:52] [INFO ] Removed a total of 605 redundant transitions.
[2025-06-02 20:15:52] [INFO ] Flatten gal took : 28 ms
[2025-06-02 20:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 5 ms.
[2025-06-02 20:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5855915416726823054.gal : 2 ms
[2025-06-02 20:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12164101887865868179.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5855915416726823054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12164101887865868179.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7683e+11,14.3768,284660,5756,2592,341635,111459,553,1.16778e+06,232,1.09955e+06,0

Converting to forward existential form...Done !
original formula: E(AF((EX(((AX(FALSE) * (i3.u2.p30==1)) * ((i1.u6.p38==1)&&(i3.u2.p62==1)))) + AF(((i3.u2.p7==1)&&(i0.u4.p36==1))))) U !(E(EG(((((u29.p210...450
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((EX(((!(EX(!(FALSE))) * (i3.u2.p30==1)) * ((i1.u6.p38==1)&&(i3.u2.p62==1)))) + !(EG(!(((i3.u2...526
Reverse transition relation is NOT exact ! Due to transitions t1, t20, t38, t64, t77, t102, t143, t150, t151, t194, t196, t202, t203, t209, t218, t272, t27...1254
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 215 transition count 461
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 186 transition count 460
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 60 place count 186 transition count 454
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 180 transition count 454
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 95 place count 157 transition count 409
Iterating global reduction 2 with 23 rules applied. Total rules applied 118 place count 157 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 118 place count 157 transition count 407
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 155 transition count 407
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 134 place count 143 transition count 369
Iterating global reduction 2 with 12 rules applied. Total rules applied 146 place count 143 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 152 place count 137 transition count 354
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 137 transition count 354
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 134 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 134 transition count 345
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 207 place count 111 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 209 place count 111 transition count 323
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 216 place count 104 transition count 308
Iterating global reduction 3 with 7 rules applied. Total rules applied 223 place count 104 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 104 transition count 306
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 3 with 4 rules applied. Total rules applied 229 place count 102 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 100 transition count 302
Applied a total of 231 rules in 55 ms. Remains 100 /218 variables (removed 118) and now considering 302/493 (removed 191) transitions.
// Phase 1: matrix 302 rows 100 cols
[2025-06-02 20:16:22] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:16:23] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 20:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:16:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 20:16:23] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:16:23] [INFO ] Redundant transitions in 4 ms returned []
Running 292 sub problems to find dead transitions.
[2025-06-02 20:16:23] [INFO ] Invariant cache hit.
[2025-06-02 20:16:23] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 4/99 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 301/400 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 36/154 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 2/402 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 155 constraints, problems are : Problem set: 0 solved, 292 unsolved in 26198 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 4/99 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 301/400 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 36/154 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 291/445 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 2/402 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 447 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56456ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 56457ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/218 places, 302/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56856 ms. Remains : 100/218 places, 302/493 transitions.
[2025-06-02 20:17:19] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:17:19] [INFO ] Flatten gal took : 18 ms
[2025-06-02 20:17:19] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-02 20:17:19] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:17:19] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13310046955208532225.gal : 3 ms
[2025-06-02 20:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16038672961658315399.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13310046955208532225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16038672961658315399.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19414e+09,13.5872,268948,2,15124,5,894552,6,0,694,1.02489e+06,0

Converting to forward existential form...Done !
original formula: AF((AG((((p30==1)&&(p38==1))&&(p77==1))) * (p43==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((p30==1)&&(p38==1))&&(p77==1))))) * (p43==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...683
Detected timeout of ITS tools.
[2025-06-02 20:17:49] [INFO ] Flatten gal took : 17 ms
[2025-06-02 20:17:49] [INFO ] Applying decomposition
[2025-06-02 20:17:50] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1670849571447453904.txt' '-o' '/tmp/graph1670849571447453904.bin' '-w' '/tmp/graph1670849571447453904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1670849571447453904.bin' '-l' '-1' '-v' '-w' '/tmp/graph1670849571447453904.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:17:50] [INFO ] Decomposing Gal with order
[2025-06-02 20:17:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:17:50] [INFO ] Removed a total of 684 redundant transitions.
[2025-06-02 20:17:50] [INFO ] Flatten gal took : 35 ms
[2025-06-02 20:17:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 8 ms.
[2025-06-02 20:17:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7121783422778364110.gal : 3 ms
[2025-06-02 20:17:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13159225917288417609.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7121783422778364110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13159225917288417609.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.19414e+09,1.80136,38996,766,148,61515,762,372,143555,107,4623,0

Converting to forward existential form...Done !
original formula: AF((AG((((i1.u0.p30==1)&&(i0.u2.p38==1))&&(i1.u7.p77==1))) * (i0.u1.p43==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((i1.u0.p30==1)&&(i0.u2.p38==1))&&(i1.u7.p77==1))))) * (i0.u1.p43==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t34, t77, t80, t87, t89, t96, t239, t253, t274, t282, t291, t300, i0.t94, i0.t57, i0.t51...914
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,0,4.31337,74452,1,0,126523,2464,2432,307993,598,14471,219785
FORMULA MedleyA-PT-22-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 493/493 transitions.
Graph (complete) has 913 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 215 transition count 458
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 183 transition count 457
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 66 place count 183 transition count 452
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 178 transition count 452
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 99 place count 155 transition count 407
Iterating global reduction 2 with 23 rules applied. Total rules applied 122 place count 155 transition count 407
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 155 transition count 405
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 153 transition count 405
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 138 place count 141 transition count 367
Iterating global reduction 2 with 12 rules applied. Total rules applied 150 place count 141 transition count 367
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 135 transition count 352
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 135 transition count 352
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 132 transition count 343
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 132 transition count 343
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 215 place count 107 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 217 place count 107 transition count 319
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 224 place count 100 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 231 place count 100 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 100 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 97 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 95 transition count 296
Applied a total of 242 rules in 64 ms. Remains 95 /218 variables (removed 123) and now considering 296/493 (removed 197) transitions.
// Phase 1: matrix 296 rows 95 cols
[2025-06-02 20:17:54] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:17:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 20:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:17:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 20:17:54] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:17:54] [INFO ] Redundant transitions in 4 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-02 20:17:54] [INFO ] Invariant cache hit.
[2025-06-02 20:17:54] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 295/389 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 2/391 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/391 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 150 constraints, problems are : Problem set: 0 solved, 285 unsolved in 23320 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 3/94 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 295/389 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 284/433 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 2/391 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 435 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53621ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 53623ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/218 places, 296/493 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54070 ms. Remains : 95/218 places, 296/493 transitions.
[2025-06-02 20:18:48] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:18:48] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:18:48] [INFO ] Input system was already deterministic with 296 transitions.
[2025-06-02 20:18:48] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:18:48] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:18:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8421901325070536235.gal : 3 ms
[2025-06-02 20:18:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1317171791864264575.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8421901325070536235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1317171791864264575.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86424e+09,11.7948,231236,2,11939,5,815138,6,0,668,939014,0

Converting to forward existential form...Done !
original formula: AG(AF((p87==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p87==1)))] = FALSE
Hit Full ! (commute/partial/dont) 289/0/7
(forward)formula 0,0,15.6825,231236,1,0,8,815138,20,3,4779,939014,8
FORMULA MedleyA-PT-22-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2025-06-02 20:19:04] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:19:04] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:19:04] [INFO ] Applying decomposition
[2025-06-02 20:19:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16748456395843852449.txt' '-o' '/tmp/graph16748456395843852449.bin' '-w' '/tmp/graph16748456395843852449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16748456395843852449.bin' '-l' '-1' '-v' '-w' '/tmp/graph16748456395843852449.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:19:04] [INFO ] Decomposing Gal with order
[2025-06-02 20:19:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:19:04] [INFO ] Removed a total of 927 redundant transitions.
[2025-06-02 20:19:04] [INFO ] Flatten gal took : 37 ms
[2025-06-02 20:19:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 7 ms.
[2025-06-02 20:19:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6062498933367424367.gal : 4 ms
[2025-06-02 20:19:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2018435026016505759.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6062498933367424367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2018435026016505759.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.98277e+12,464.703,3756744,23585,3283,5.07473e+06,165626,796,1.69485e+07,268,2.08013e+06,0

Converting to forward existential form...Done !
original formula: EG((EX(AF((((i3.u3.p30==1)&&(i3.u14.p91==1))&&((i7.u32.p210==1)&&(i9.i0.u40.p234==1))))) + (((E((i2.u4.p8==1) U (i4.u20.p135==1)) * ((i6....561
=> equivalent forward existential formula: [FwdG(Init,(EX(!(EG(!((((i3.u3.p30==1)&&(i3.u14.p91==1))&&((i7.u32.p210==1)&&(i9.i0.u40.p234==1))))))) + (((E((i...610
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t53, t60, t81, t119, t126, t183, t190, t207, t220, t222, t224, t231, t233, t260, t27...1983
Detected timeout of ITS tools.
[2025-06-02 20:46:20] [INFO ] Applying decomposition
[2025-06-02 20:46:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:46:20] [INFO ] Decomposing Gal with order
[2025-06-02 20:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:46:20] [INFO ] Removed a total of 876 redundant transitions.
[2025-06-02 20:46:20] [INFO ] Flatten gal took : 34 ms
[2025-06-02 20:46:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 7 ms.
[2025-06-02 20:46:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14728594966099843988.gal : 3 ms
[2025-06-02 20:46:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16526867275324099051.ctl : 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14728594966099843988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16526867275324099051.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="MedleyA-PT-22"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-22, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;