Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414500483.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DoubleExponent-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414500483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678348730851

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 07:58:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 07:58:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:58:53] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-09 07:58:53] [INFO ] Transformed 1064 places.
[2023-03-09 07:58:53] [INFO ] Transformed 998 transitions.
[2023-03-09 07:58:53] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 159 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 07:58:54] [INFO ] Invariants computation overflowed in 201 ms
[2023-03-09 07:58:55] [INFO ] Implicit Places using invariants in 1174 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 07:58:55] [INFO ] Invariants computation overflowed in 159 ms
[2023-03-09 07:58:56] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 07:58:56] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-09 07:58:57] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1060/1064 places, 998/998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3631 ms. Remains : 1060/1064 places, 998/998 transitions.
Support contains 47 out of 1060 places after structural reductions.
[2023-03-09 07:58:58] [INFO ] Flatten gal took : 164 ms
[2023-03-09 07:58:58] [INFO ] Flatten gal took : 88 ms
[2023-03-09 07:58:58] [INFO ] Input system was already deterministic with 998 transitions.
Support contains 43 out of 1060 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 320 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 100205 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{13=1, 18=1}
Probabilistic random walk after 100205 steps, saw 50107 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :2
Running SMT prover for 23 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 07:59:03] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-09 07:59:04] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-09 07:59:19] [INFO ] After 13903ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :20
[2023-03-09 07:59:20] [INFO ] Deduced a trap composed of 67 places in 710 ms of which 117 ms to minimize.
[2023-03-09 07:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 898 ms
[2023-03-09 07:59:20] [INFO ] Deduced a trap composed of 103 places in 589 ms of which 2 ms to minimize.
[2023-03-09 07:59:21] [INFO ] Deduced a trap composed of 110 places in 579 ms of which 2 ms to minimize.
[2023-03-09 07:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1467 ms
[2023-03-09 07:59:22] [INFO ] Deduced a trap composed of 210 places in 266 ms of which 2 ms to minimize.
[2023-03-09 07:59:22] [INFO ] Deduced a trap composed of 187 places in 291 ms of which 1 ms to minimize.
[2023-03-09 07:59:22] [INFO ] Deduced a trap composed of 185 places in 241 ms of which 1 ms to minimize.
[2023-03-09 07:59:23] [INFO ] Deduced a trap composed of 173 places in 257 ms of which 1 ms to minimize.
[2023-03-09 07:59:23] [INFO ] Deduced a trap composed of 201 places in 257 ms of which 1 ms to minimize.
[2023-03-09 07:59:23] [INFO ] Deduced a trap composed of 199 places in 231 ms of which 1 ms to minimize.
[2023-03-09 07:59:24] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 1 ms to minimize.
[2023-03-09 07:59:24] [INFO ] Deduced a trap composed of 243 places in 306 ms of which 7 ms to minimize.
[2023-03-09 07:59:25] [INFO ] Deduced a trap composed of 192 places in 323 ms of which 1 ms to minimize.
[2023-03-09 07:59:25] [INFO ] Deduced a trap composed of 151 places in 315 ms of which 2 ms to minimize.
[2023-03-09 07:59:26] [INFO ] Deduced a trap composed of 219 places in 270 ms of which 1 ms to minimize.
[2023-03-09 07:59:26] [INFO ] Deduced a trap composed of 209 places in 272 ms of which 1 ms to minimize.
[2023-03-09 07:59:26] [INFO ] Deduced a trap composed of 161 places in 297 ms of which 1 ms to minimize.
[2023-03-09 07:59:27] [INFO ] Deduced a trap composed of 249 places in 291 ms of which 1 ms to minimize.
[2023-03-09 07:59:28] [INFO ] Deduced a trap composed of 139 places in 373 ms of which 1 ms to minimize.
[2023-03-09 07:59:28] [INFO ] Deduced a trap composed of 137 places in 323 ms of which 1 ms to minimize.
[2023-03-09 07:59:29] [INFO ] Deduced a trap composed of 127 places in 378 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 07:59:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 07:59:29] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 31556 ms.
Support contains 36 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 1057 transition count 797
Reduce places removed 199 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 213 rules applied. Total rules applied 416 place count 858 transition count 783
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 430 place count 844 transition count 783
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 430 place count 844 transition count 743
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 510 place count 804 transition count 743
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 13 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 860 place count 629 transition count 568
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 926 place count 596 transition count 568
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1006 place count 596 transition count 488
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1086 place count 516 transition count 488
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1167 place count 516 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1168 place count 515 transition count 487
Applied a total of 1168 rules in 365 ms. Remains 515 /1060 variables (removed 545) and now considering 487/998 (removed 511) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 515/1060 places, 487/998 transitions.
Incomplete random walk after 10000 steps, including 1245 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 118939 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{17=1}
Probabilistic random walk after 118939 steps, saw 59514 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :1
Running SMT prover for 19 properties.
// Phase 1: matrix 487 rows 515 cols
[2023-03-09 08:00:05] [INFO ] Computed 100 place invariants in 71 ms
[2023-03-09 08:00:05] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-09 08:00:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:00:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 52 ms returned sat
[2023-03-09 08:00:07] [INFO ] After 1613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-09 08:00:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 08:00:12] [INFO ] After 4883ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-09 08:00:12] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-09 08:00:13] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:00:13] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:00:13] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 1 ms to minimize.
[2023-03-09 08:00:13] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 0 ms to minimize.
[2023-03-09 08:00:14] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 0 ms to minimize.
[2023-03-09 08:00:14] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-09 08:00:14] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-09 08:00:14] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 0 ms to minimize.
[2023-03-09 08:00:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2540 ms
[2023-03-09 08:00:17] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 2 ms to minimize.
[2023-03-09 08:00:17] [INFO ] Deduced a trap composed of 153 places in 367 ms of which 1 ms to minimize.
[2023-03-09 08:00:17] [INFO ] Deduced a trap composed of 172 places in 357 ms of which 1 ms to minimize.
[2023-03-09 08:00:18] [INFO ] Deduced a trap composed of 160 places in 355 ms of which 1 ms to minimize.
[2023-03-09 08:00:18] [INFO ] Deduced a trap composed of 159 places in 361 ms of which 1 ms to minimize.
[2023-03-09 08:00:18] [INFO ] Deduced a trap composed of 160 places in 360 ms of which 6 ms to minimize.
[2023-03-09 08:00:19] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 1 ms to minimize.
[2023-03-09 08:00:19] [INFO ] Deduced a trap composed of 162 places in 368 ms of which 1 ms to minimize.
[2023-03-09 08:00:20] [INFO ] Deduced a trap composed of 170 places in 348 ms of which 1 ms to minimize.
[2023-03-09 08:00:20] [INFO ] Deduced a trap composed of 156 places in 352 ms of which 1 ms to minimize.
[2023-03-09 08:00:21] [INFO ] Deduced a trap composed of 172 places in 364 ms of which 2 ms to minimize.
[2023-03-09 08:00:21] [INFO ] Deduced a trap composed of 178 places in 357 ms of which 1 ms to minimize.
[2023-03-09 08:00:21] [INFO ] Deduced a trap composed of 164 places in 355 ms of which 1 ms to minimize.
[2023-03-09 08:00:22] [INFO ] Deduced a trap composed of 178 places in 357 ms of which 1 ms to minimize.
[2023-03-09 08:00:22] [INFO ] Deduced a trap composed of 160 places in 388 ms of which 1 ms to minimize.
[2023-03-09 08:00:23] [INFO ] Deduced a trap composed of 164 places in 445 ms of which 1 ms to minimize.
[2023-03-09 08:00:23] [INFO ] Deduced a trap composed of 181 places in 352 ms of which 1 ms to minimize.
[2023-03-09 08:00:24] [INFO ] Deduced a trap composed of 170 places in 348 ms of which 1 ms to minimize.
[2023-03-09 08:00:24] [INFO ] Deduced a trap composed of 172 places in 363 ms of which 1 ms to minimize.
[2023-03-09 08:00:24] [INFO ] Deduced a trap composed of 169 places in 366 ms of which 1 ms to minimize.
[2023-03-09 08:00:25] [INFO ] Deduced a trap composed of 174 places in 363 ms of which 1 ms to minimize.
[2023-03-09 08:00:25] [INFO ] Deduced a trap composed of 159 places in 354 ms of which 1 ms to minimize.
[2023-03-09 08:00:25] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 0 ms to minimize.
[2023-03-09 08:00:25] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9307 ms
[2023-03-09 08:00:27] [INFO ] Deduced a trap composed of 106 places in 242 ms of which 1 ms to minimize.
[2023-03-09 08:00:27] [INFO ] Deduced a trap composed of 113 places in 222 ms of which 1 ms to minimize.
[2023-03-09 08:00:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 577 ms
[2023-03-09 08:00:27] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 0 ms to minimize.
[2023-03-09 08:00:28] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2023-03-09 08:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-09 08:00:28] [INFO ] Deduced a trap composed of 150 places in 284 ms of which 0 ms to minimize.
[2023-03-09 08:00:29] [INFO ] Deduced a trap composed of 154 places in 380 ms of which 1 ms to minimize.
[2023-03-09 08:00:29] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 0 ms to minimize.
[2023-03-09 08:00:29] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 0 ms to minimize.
[2023-03-09 08:00:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1330 ms
[2023-03-09 08:00:29] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2023-03-09 08:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-09 08:00:30] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2023-03-09 08:00:30] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 08:00:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 08:00:30] [INFO ] After 25148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Parikh walk visited 0 properties in 30000 ms.
Support contains 35 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 487/487 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 515 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 484
Applied a total of 6 rules in 66 ms. Remains 512 /515 variables (removed 3) and now considering 484/487 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 512/515 places, 484/487 transitions.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA DoubleExponent-PT-020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 61 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:01:01] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-09 08:01:01] [INFO ] Implicit Places using invariants in 803 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:01:01] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-09 08:01:27] [INFO ] Implicit Places using invariants and state equation in 25427 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 26238 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 225 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:01:27] [INFO ] Invariants computation overflowed in 150 ms
[2023-03-09 08:01:28] [INFO ] Implicit Places using invariants in 833 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:01:28] [INFO ] Invariants computation overflowed in 133 ms
[2023-03-09 08:01:55] [INFO ] Implicit Places using invariants and state equation in 27628 ms returned []
Implicit Place search using SMT with State Equation took 28484 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55011 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s452 s811), p0:(LEQ s722 s289)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-00 finished in 55443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 50 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:01:56] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-09 08:01:57] [INFO ] Implicit Places using invariants in 1002 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:01:57] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-09 08:02:20] [INFO ] Implicit Places using invariants and state equation in 23574 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24579 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 131 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:02:21] [INFO ] Invariants computation overflowed in 134 ms
[2023-03-09 08:02:21] [INFO ] Implicit Places using invariants in 818 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:02:21] [INFO ] Invariants computation overflowed in 134 ms
[2023-03-09 08:02:22] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1839 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26603 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s462 s308)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 740 ms.
Product exploration explored 100000 steps with 33333 reset in 631 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-05 finished in 28229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((X(p1)&&F(p2))))))'
Support contains 6 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 55 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:02:24] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-09 08:02:25] [INFO ] Implicit Places using invariants in 788 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:02:25] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-09 08:02:26] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:02:26] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-09 08:02:27] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2961 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s742 s234), p2:(GT s767 s223), p1:(GT s686 s796)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-06 finished in 3353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 85 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:02:28] [INFO ] Invariants computation overflowed in 123 ms
[2023-03-09 08:02:28] [INFO ] Implicit Places using invariants in 855 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:02:28] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-09 08:02:53] [INFO ] Implicit Places using invariants and state equation in 24463 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25325 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 112 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:02:53] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-09 08:02:54] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:02:54] [INFO ] Invariants computation overflowed in 135 ms
[2023-03-09 08:03:21] [INFO ] Implicit Places using invariants and state equation in 27703 ms returned []
Implicit Place search using SMT with State Equation took 28553 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54075 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s487)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-07 finished in 54199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 54 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:03:22] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-09 08:03:22] [INFO ] Implicit Places using invariants in 797 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:03:23] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-09 08:03:24] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:03:24] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-09 08:03:25] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3042 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s507 s553)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-08 finished in 3210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1059 transition count 761
Reduce places removed 236 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 237 rules applied. Total rules applied 473 place count 823 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 474 place count 822 transition count 720
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 554 place count 782 transition count 720
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 994 place count 562 transition count 538
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 562 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 561 transition count 537
Applied a total of 996 rules in 254 ms. Remains 561 /1060 variables (removed 499) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 561 cols
[2023-03-09 08:03:25] [INFO ] Computed 101 place invariants in 64 ms
[2023-03-09 08:03:26] [INFO ] Implicit Places using invariants in 802 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 804 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 559/1060 places, 537/998 transitions.
Graph (complete) has 1748 edges and 559 vertex of which 558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 555 transition count 533
Applied a total of 7 rules in 53 ms. Remains 555 /559 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:03:26] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:03:26] [INFO ] Implicit Places using invariants in 529 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:03:26] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 08:03:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:03:47] [INFO ] Implicit Places using invariants and state equation in 20281 ms returned []
Implicit Place search using SMT with State Equation took 20811 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 555/1060 places, 533/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21925 ms. Remains : 555/1060 places, 533/998 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s416 s541), p1:(LEQ s50 s62)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13906 reset in 211 ms.
Product exploration explored 100000 steps with 13919 reset in 219 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 374 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1408 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 275238 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{1=1}
Probabilistic random walk after 275238 steps, saw 137690 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:03:51] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:03:51] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:03:52] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:03:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:03:53] [INFO ] After 1251ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:03:53] [INFO ] After 1312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:03:53] [INFO ] After 2004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1666 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 554 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 83 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 68 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322113 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322113 steps, saw 161142 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:03:58] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-09 08:03:58] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:04:00] [INFO ] After 1181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:04:00] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:04:01] [INFO ] After 1190ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:04:01] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 1 ms to minimize.
[2023-03-09 08:04:01] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2023-03-09 08:04:01] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2023-03-09 08:04:01] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 3 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 0 ms to minimize.
[2023-03-09 08:04:02] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 0 ms to minimize.
[2023-03-09 08:04:03] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 0 ms to minimize.
[2023-03-09 08:04:03] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2023-03-09 08:04:03] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2023-03-09 08:04:03] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 1 ms to minimize.
[2023-03-09 08:04:04] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:04:04] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 1 ms to minimize.
[2023-03-09 08:04:04] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 0 ms to minimize.
[2023-03-09 08:04:05] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 1 ms to minimize.
[2023-03-09 08:04:05] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 1 ms to minimize.
[2023-03-09 08:04:05] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-09 08:04:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4653 ms
[2023-03-09 08:04:06] [INFO ] After 5890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 08:04:06] [INFO ] After 7194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 30 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 27 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:04:08] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 08:04:09] [INFO ] Implicit Places using invariants in 1209 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:04:09] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 08:04:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:04:39] [INFO ] Performed 308/475 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-09 08:04:48] [INFO ] Implicit Places using invariants and state equation in 38988 ms returned [68, 73, 440, 445, 467, 473]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 40203 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 469/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 466 transition count 450
Applied a total of 6 rules in 31 ms. Remains 466 /469 variables (removed 3) and now considering 450/453 (removed 3) transitions.
// Phase 1: matrix 450 rows 466 cols
[2023-03-09 08:04:48] [INFO ] Computed 93 place invariants in 78 ms
[2023-03-09 08:04:51] [INFO ] Implicit Places using invariants in 2666 ms returned [42, 48, 91, 96, 116, 122, 143, 148, 149, 169, 174, 195, 201, 208, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 356, 362, 383, 385, 389, 409, 415, 443]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 2667 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 434 transition count 434
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 418 transition count 434
Applied a total of 32 rules in 26 ms. Remains 418 /434 variables (removed 16) and now considering 434/450 (removed 16) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:04:51] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 08:04:51] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:04:51] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:04:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:05:16] [INFO ] Implicit Places using invariants and state equation in 24640 ms returned []
Implicit Place search using SMT with State Equation took 25157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 68113 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331960 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331960 steps, saw 166010 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:05:19] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:05:19] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:05:20] [INFO ] After 587ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:05:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:05:20] [INFO ] After 630ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:05:20] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-09 08:05:20] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1237 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 12 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:05:22] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 08:05:22] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:05:22] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-09 08:05:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:05:48] [INFO ] Implicit Places using invariants and state equation in 25786 ms returned []
Implicit Place search using SMT with State Equation took 26445 ms to find 0 implicit places.
[2023-03-09 08:05:48] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:05:48] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:05:48] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26860 ms. Remains : 418/418 places, 434/434 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 29 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:05:49] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 08:05:50] [INFO ] Implicit Places using invariants in 758 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:05:50] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-09 08:05:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:06:09] [INFO ] Implicit Places using invariants and state equation in 19469 ms returned []
Implicit Place search using SMT with State Equation took 20229 ms to find 0 implicit places.
[2023-03-09 08:06:09] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:06:09] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 08:06:10] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20921 ms. Remains : 555/555 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1744 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 778 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 247766 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{1=1}
Probabilistic random walk after 247766 steps, saw 123954 distinct states, run finished after 3004 ms. (steps per millisecond=82 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:06:14] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 08:06:14] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:06:15] [INFO ] After 729ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:06:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:06:16] [INFO ] After 1411ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:06:16] [INFO ] After 1467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-09 08:06:16] [INFO ] After 2330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 555/555 places, 533/533 transitions.
Graph (complete) has 1666 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 554 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 83 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 160 place count 475 transition count 453
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 239 place count 475 transition count 453
Applied a total of 239 rules in 53 ms. Remains 475 /555 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 475/555 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 328717 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328717 steps, saw 164447 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:06:21] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 08:06:21] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:06:22] [INFO ] After 1203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:06:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:06:24] [INFO ] After 1337ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:06:24] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2023-03-09 08:06:24] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2023-03-09 08:06:24] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2023-03-09 08:06:25] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 0 ms to minimize.
[2023-03-09 08:06:25] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2023-03-09 08:06:25] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2023-03-09 08:06:25] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2023-03-09 08:06:26] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2023-03-09 08:06:26] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 1 ms to minimize.
[2023-03-09 08:06:26] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 1 ms to minimize.
[2023-03-09 08:06:27] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 0 ms to minimize.
[2023-03-09 08:06:27] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 1 ms to minimize.
[2023-03-09 08:06:27] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2023-03-09 08:06:28] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:06:28] [INFO ] Deduced a trap composed of 15 places in 276 ms of which 1 ms to minimize.
[2023-03-09 08:06:28] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 1 ms to minimize.
[2023-03-09 08:06:29] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-09 08:06:29] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 1 ms to minimize.
[2023-03-09 08:06:29] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 1 ms to minimize.
[2023-03-09 08:06:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5670 ms
[2023-03-09 08:06:30] [INFO ] After 7073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-09 08:06:30] [INFO ] After 8412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:06:32] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 08:06:33] [INFO ] Implicit Places using invariants in 1025 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:06:33] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-09 08:06:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:06:55] [INFO ] Implicit Places using invariants and state equation in 22417 ms returned [125, 172, 198, 204, 225, 281, 286, 306, 311, 332, 337, 359, 365, 386, 388, 392, 412, 418, 440, 445, 467, 473]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 23446 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 453 transition count 444
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 444 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 444 transition count 444
Applied a total of 22 rules in 38 ms. Remains 444 /453 variables (removed 9) and now considering 444/453 (removed 9) transitions.
// Phase 1: matrix 444 rows 444 cols
[2023-03-09 08:06:55] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 08:06:56] [INFO ] Implicit Places using invariants in 740 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2023-03-09 08:06:56] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-09 08:06:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:07:26] [INFO ] Performed 424/444 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:07:28] [INFO ] Implicit Places using invariants and state equation in 32276 ms returned []
Implicit Place search using SMT with State Equation took 33021 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/475 places, 444/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56519 ms. Remains : 444/475 places, 444/453 transitions.
Incomplete random walk after 10000 steps, including 1276 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 338445 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338445 steps, saw 169288 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 444 cols
[2023-03-09 08:07:31] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:07:31] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:07:32] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:32] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:07:33] [INFO ] After 1052ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:07:33] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2023-03-09 08:07:33] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2023-03-09 08:07:33] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2023-03-09 08:07:33] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:07:34] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2023-03-09 08:07:35] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2023-03-09 08:07:36] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-09 08:07:36] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2023-03-09 08:07:36] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2023-03-09 08:07:37] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-09 08:07:37] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 1 ms to minimize.
[2023-03-09 08:07:37] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2023-03-09 08:07:37] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2023-03-09 08:07:38] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-09 08:07:38] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2023-03-09 08:07:38] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-09 08:07:38] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5018 ms
[2023-03-09 08:07:38] [INFO ] After 6096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 08:07:38] [INFO ] After 6691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1473 ms.
Support contains 2 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 444/444 transitions.
Applied a total of 0 rules in 13 ms. Remains 444 /444 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 444/444 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 444/444 transitions.
Applied a total of 0 rules in 12 ms. Remains 444 /444 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 444 cols
[2023-03-09 08:07:40] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:07:40] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 444 rows 444 cols
[2023-03-09 08:07:40] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-09 08:07:41] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:08:08] [INFO ] Implicit Places using invariants and state equation in 27497 ms returned [421]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28175 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 443/444 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 443
Applied a total of 2 rules in 24 ms. Remains 442 /443 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 442 cols
[2023-03-09 08:08:08] [INFO ] Computed 76 place invariants in 76 ms
[2023-03-09 08:08:09] [INFO ] Implicit Places using invariants in 1590 ms returned [42, 48, 68, 73, 94, 99, 119, 145, 150, 151, 175, 206, 224, 247, 253]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1592 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/444 places, 443/444 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 427 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 418 transition count 434
Applied a total of 18 rules in 23 ms. Remains 418 /427 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:08:09] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:08:10] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:08:10] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:08:10] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-09 08:08:40] [INFO ] Performed 389/418 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:08:42] [INFO ] Implicit Places using invariants and state equation in 32397 ms returned []
Implicit Place search using SMT with State Equation took 32937 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/444 places, 434/444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62764 ms. Remains : 418/444 places, 434/444 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 13952 reset in 136 ms.
Product exploration explored 100000 steps with 13951 reset in 149 ms.
Support contains 4 out of 555 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 555/555 places, 533/533 transitions.
Applied a total of 0 rules in 17 ms. Remains 555 /555 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:08:43] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:08:44] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:08:44] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-09 08:08:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:09:05] [INFO ] Implicit Places using invariants and state equation in 21775 ms returned []
Implicit Place search using SMT with State Equation took 22296 ms to find 0 implicit places.
[2023-03-09 08:09:05] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 533 rows 555 cols
[2023-03-09 08:09:05] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-09 08:09:06] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22969 ms. Remains : 555/555 places, 533/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-09 finished in 341468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 822 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 821 transition count 759
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 476 place count 821 transition count 718
Deduced a syphon composed of 41 places in 10 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 920 place count 599 transition count 537
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 994 place count 562 transition count 537
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 995 place count 562 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 996 place count 561 transition count 536
Applied a total of 996 rules in 170 ms. Remains 561 /1060 variables (removed 499) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 561 cols
[2023-03-09 08:09:06] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:09:07] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 536 rows 561 cols
[2023-03-09 08:09:07] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 08:09:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-09 08:09:34] [INFO ] Implicit Places using invariants and state equation in 27155 ms returned []
Implicit Place search using SMT with State Equation took 27666 ms to find 0 implicit places.
[2023-03-09 08:09:34] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 536 rows 561 cols
[2023-03-09 08:09:34] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-09 08:09:34] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1060 places, 536/998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28218 ms. Remains : 561/1060 places, 536/998 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s208) (GT 1 s488) (GT s205 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-10 finished in 28311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 58 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:09:35] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-09 08:09:35] [INFO ] Implicit Places using invariants in 861 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:09:36] [INFO ] Invariants computation overflowed in 110 ms
[2023-03-09 08:09:59] [INFO ] Implicit Places using invariants and state equation in 23453 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24316 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 102 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:09:59] [INFO ] Invariants computation overflowed in 132 ms
[2023-03-09 08:10:00] [INFO ] Implicit Places using invariants in 845 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:10:00] [INFO ] Invariants computation overflowed in 213 ms
[2023-03-09 08:10:01] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26769 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s598 s396), p1:(LEQ s1030 s724)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3281 reset in 244 ms.
Product exploration explored 100000 steps with 3306 reset in 241 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 342 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 133484 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133484 steps, saw 66764 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-09 08:10:06] [INFO ] Invariants computation overflowed in 129 ms
[2023-03-09 08:10:06] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:10:09] [INFO ] After 2889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:10:11] [INFO ] Deduced a trap composed of 155 places in 275 ms of which 1 ms to minimize.
[2023-03-09 08:10:11] [INFO ] Deduced a trap composed of 149 places in 325 ms of which 1 ms to minimize.
[2023-03-09 08:10:12] [INFO ] Deduced a trap composed of 158 places in 416 ms of which 1 ms to minimize.
[2023-03-09 08:10:12] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 2 ms to minimize.
[2023-03-09 08:10:13] [INFO ] Deduced a trap composed of 139 places in 444 ms of which 1 ms to minimize.
[2023-03-09 08:10:14] [INFO ] Deduced a trap composed of 127 places in 541 ms of which 2 ms to minimize.
[2023-03-09 08:10:14] [INFO ] Deduced a trap composed of 101 places in 569 ms of which 1 ms to minimize.
[2023-03-09 08:10:15] [INFO ] Deduced a trap composed of 103 places in 611 ms of which 2 ms to minimize.
[2023-03-09 08:10:15] [INFO ] Deduced a trap composed of 115 places in 576 ms of which 3 ms to minimize.
[2023-03-09 08:10:16] [INFO ] Deduced a trap composed of 156 places in 515 ms of which 1 ms to minimize.
[2023-03-09 08:10:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 5706 ms
[2023-03-09 08:10:19] [INFO ] Deduced a trap composed of 144 places in 284 ms of which 1 ms to minimize.
[2023-03-09 08:10:19] [INFO ] Deduced a trap composed of 137 places in 506 ms of which 2 ms to minimize.
[2023-03-09 08:10:20] [INFO ] Deduced a trap composed of 161 places in 512 ms of which 2 ms to minimize.
[2023-03-09 08:10:20] [INFO ] Deduced a trap composed of 202 places in 501 ms of which 2 ms to minimize.
[2023-03-09 08:10:21] [INFO ] Deduced a trap composed of 223 places in 318 ms of which 1 ms to minimize.
[2023-03-09 08:10:21] [INFO ] Deduced a trap composed of 221 places in 321 ms of which 1 ms to minimize.
[2023-03-09 08:10:21] [INFO ] Deduced a trap composed of 235 places in 300 ms of which 0 ms to minimize.
[2023-03-09 08:10:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3442 ms
[2023-03-09 08:10:22] [INFO ] After 15525ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-09 08:10:22] [INFO ] After 15973ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1055 transition count 755
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 483 place count 815 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 484 place count 814 transition count 714
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 930 place count 591 transition count 531
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 1004 place count 554 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1082 place count 554 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 1160 place count 476 transition count 453
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1241 place count 476 transition count 453
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1242 place count 475 transition count 452
Applied a total of 1242 rules in 133 ms. Remains 475 /1057 variables (removed 582) and now considering 452/997 (removed 545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 475/1057 places, 452/997 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308951 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308951 steps, saw 154565 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2023-03-09 08:10:27] [INFO ] Computed 99 place invariants in 54 ms
[2023-03-09 08:10:27] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:10:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:10:27] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 87 ms returned sat
[2023-03-09 08:10:28] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:10:28] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-09 08:10:30] [INFO ] After 1843ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:10:30] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2023-03-09 08:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 08:10:30] [INFO ] After 2022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-09 08:10:30] [INFO ] After 2809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 22 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 22 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2023-03-09 08:10:32] [INFO ] Invariant cache hit.
[2023-03-09 08:10:35] [INFO ] Implicit Places using invariants in 3303 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 364, 385, 387, 391, 411, 417, 439, 444, 448, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3307 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 437 transition count 433
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 38 place count 418 transition count 433
Applied a total of 38 rules in 32 ms. Remains 418 /437 variables (removed 19) and now considering 433/452 (removed 19) transitions.
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:10:35] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-09 08:10:36] [INFO ] Implicit Places using invariants in 734 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:10:36] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-09 08:10:37] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-09 08:11:04] [INFO ] Implicit Places using invariants and state equation in 27718 ms returned []
Implicit Place search using SMT with State Equation took 28455 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31816 ms. Remains : 418/475 places, 433/452 transitions.
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319634 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319634 steps, saw 159844 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:11:07] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:11:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:11:08] [INFO ] After 1304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:11:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-09 08:11:10] [INFO ] After 1166ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 0 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2023-03-09 08:11:10] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 1 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 1 ms to minimize.
[2023-03-09 08:11:11] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 1 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2023-03-09 08:11:12] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2023-03-09 08:11:13] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2023-03-09 08:11:13] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 0 ms to minimize.
[2023-03-09 08:11:13] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 0 ms to minimize.
[2023-03-09 08:11:14] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 1 ms to minimize.
[2023-03-09 08:11:14] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 1 ms to minimize.
[2023-03-09 08:11:14] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 1 ms to minimize.
[2023-03-09 08:11:14] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 1 ms to minimize.
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 0 ms to minimize.
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-09 08:11:15] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2023-03-09 08:11:16] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-09 08:11:16] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-09 08:11:17] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7170 ms
[2023-03-09 08:11:17] [INFO ] After 8378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-09 08:11:17] [INFO ] After 9900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 12 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:11:19] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:11:20] [INFO ] Implicit Places using invariants in 739 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:11:20] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 08:11:20] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-09 08:11:37] [INFO ] Implicit Places using invariants and state equation in 17511 ms returned []
Implicit Place search using SMT with State Equation took 18252 ms to find 0 implicit places.
[2023-03-09 08:11:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2023-03-09 08:11:37] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:11:38] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18663 ms. Remains : 418/418 places, 433/433 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 417 transition count 432
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 2 place count 417 transition count 395
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 76 place count 380 transition count 395
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 95 place count 361 transition count 376
Iterating global reduction 2 with 19 rules applied. Total rules applied 114 place count 361 transition count 376
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 116 place count 360 transition count 375
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 360 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 358 transition count 373
Applied a total of 120 rules in 86 ms. Remains 358 /418 variables (removed 60) and now considering 373/433 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 358 cols
[2023-03-09 08:11:38] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:11:38] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:11:39] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:11:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:11:39] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:11:39] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-09 08:11:39] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2023-03-09 08:11:39] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 0 ms to minimize.
[2023-03-09 08:11:39] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-09 08:11:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 446 ms
[2023-03-09 08:11:39] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 08:11:39] [INFO ] After 1330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-11 finished in 124889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1059 transition count 757
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 819 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 819 transition count 717
Deduced a syphon composed of 40 places in 15 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 779 transition count 717
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 6 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 922 place count 598 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 998 place count 560 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 999 place count 559 transition count 535
Applied a total of 999 rules in 193 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-09 08:11:40] [INFO ] Invariants computation overflowed in 160 ms
[2023-03-09 08:11:40] [INFO ] Implicit Places using invariants in 687 ms returned []
// Phase 1: matrix 535 rows 559 cols
[2023-03-09 08:11:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-09 08:11:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:11:55] [INFO ] Implicit Places using invariants and state equation in 14559 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 15248 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1060 places, 535/998 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 533
Applied a total of 4 rules in 25 ms. Remains 556 /558 variables (removed 2) and now considering 533/535 (removed 2) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-09 08:11:55] [INFO ] Computed 100 place invariants in 51 ms
[2023-03-09 08:11:56] [INFO ] Implicit Places using invariants in 744 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 745 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 555/1060 places, 533/998 transitions.
Graph (complete) has 1743 edges and 555 vertex of which 554 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 553 transition count 531
Applied a total of 3 rules in 27 ms. Remains 553 /555 variables (removed 2) and now considering 531/533 (removed 2) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:11:56] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:11:56] [INFO ] Implicit Places using invariants in 606 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:11:56] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-09 08:11:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:12:26] [INFO ] Implicit Places using invariants and state equation in 29518 ms returned []
Implicit Place search using SMT with State Equation took 30126 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 46366 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s256)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13990 reset in 125 ms.
Product exploration explored 100000 steps with 13908 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1408 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275778 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275778 steps, saw 137940 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:12:29] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:12:31] [INFO ] After 1006ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:12:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:12:31] [INFO ] After 361ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 08:12:31] [INFO ] After 418ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-09 08:12:31] [INFO ] After 1561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 48 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 475/553 places, 453/531 transitions.
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310546 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310546 steps, saw 155361 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:12:34] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:12:35] [INFO ] After 258ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:12:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:12:35] [INFO ] After 598ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 08:12:35] [INFO ] After 644ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 08:12:35] [INFO ] After 1016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:12:35] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:12:36] [INFO ] Implicit Places using invariants in 1096 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:12:36] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 08:12:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:13:00] [INFO ] Implicit Places using invariants and state equation in 23337 ms returned [94, 99, 119, 146, 151, 152, 172, 198, 204, 227, 232, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 413, 419, 441, 446, 450, 467, 473]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 24435 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 446/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 446 transition count 441
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 434 transition count 441
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 434 transition count 441
Applied a total of 29 rules in 34 ms. Remains 434 /446 variables (removed 12) and now considering 441/453 (removed 12) transitions.
// Phase 1: matrix 441 rows 434 cols
[2023-03-09 08:13:00] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:13:00] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 441 rows 434 cols
[2023-03-09 08:13:01] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-09 08:13:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:13:20] [INFO ] Implicit Places using invariants and state equation in 19091 ms returned [199]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 19825 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 433/475 places, 441/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 433 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 432 transition count 440
Applied a total of 2 rules in 30 ms. Remains 432 /433 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:20] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:13:20] [INFO ] Implicit Places using invariants in 870 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:21] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 08:13:21] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:13:39] [INFO ] Implicit Places using invariants and state equation in 18516 ms returned []
Implicit Place search using SMT with State Equation took 19387 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 432/475 places, 440/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63725 ms. Remains : 432/475 places, 440/453 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 340283 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340283 steps, saw 170207 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:42] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:13:42] [INFO ] After 390ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:13:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:13:43] [INFO ] After 901ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:43] [INFO ] After 1379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:44] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:13:44] [INFO ] After 132ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:13:44] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 08:13:44] [INFO ] After 854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 432 /432 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 432/432 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 432 /432 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:44] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-09 08:13:45] [INFO ] Implicit Places using invariants in 847 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:45] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 08:13:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:13:56] [INFO ] Implicit Places using invariants and state equation in 10355 ms returned []
Implicit Place search using SMT with State Equation took 11204 ms to find 0 implicit places.
[2023-03-09 08:13:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 440 rows 432 cols
[2023-03-09 08:13:56] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:13:56] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11607 ms. Remains : 432/432 places, 440/440 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 432 transition count 402
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 394 transition count 402
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 89 place count 381 transition count 389
Iterating global reduction 0 with 13 rules applied. Total rules applied 102 place count 381 transition count 389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 380 transition count 388
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 380 transition count 386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 378 transition count 386
Applied a total of 108 rules in 39 ms. Remains 378 /432 variables (removed 54) and now considering 386/440 (removed 54) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 386 rows 378 cols
[2023-03-09 08:13:56] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-09 08:13:57] [INFO ] After 552ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:13:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:13:57] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 08:13:57] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2023-03-09 08:13:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2023-03-09 08:13:57] [INFO ] After 377ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:57] [INFO ] After 1031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:13:58] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:13:58] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:13:58] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-09 08:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-09 08:13:58] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 08:13:58] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 24 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:13:59] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-09 08:13:59] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:13:59] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-09 08:14:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:14:30] [INFO ] Performed 315/553 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-09 08:14:58] [INFO ] Implicit Places using invariants and state equation in 59095 ms returned []
Implicit Place search using SMT with State Equation took 59798 ms to find 0 implicit places.
[2023-03-09 08:14:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:14:58] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-09 08:14:59] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60374 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1375 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268724 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268724 steps, saw 134399 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:15:02] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-09 08:15:03] [INFO ] After 877ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:15:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:15:04] [INFO ] After 354ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 08:15:04] [INFO ] After 444ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 08:15:04] [INFO ] After 1469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 87 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1660 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 475 transition count 453
Applied a total of 236 rules in 72 ms. Remains 475 /553 variables (removed 78) and now considering 453/531 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 475/553 places, 453/531 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279757 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279757 steps, saw 139961 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:15:07] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-09 08:15:07] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:15:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:15:08] [INFO ] After 603ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 08:15:08] [INFO ] After 653ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 08:15:08] [INFO ] After 1221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:15:08] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-09 08:15:09] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-09 08:15:09] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-09 08:15:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:15:34] [INFO ] Implicit Places using invariants and state equation in 25035 ms returned [151, 198, 227, 255, 283, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 26119 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 454/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 454 transition count 445
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 446 transition count 445
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 446 transition count 445
Applied a total of 21 rules in 33 ms. Remains 446 /454 variables (removed 8) and now considering 445/453 (removed 8) transitions.
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:15:34] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-09 08:15:35] [INFO ] Implicit Places using invariants in 1001 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:15:35] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:15:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:16:04] [INFO ] Implicit Places using invariants and state equation in 28973 ms returned []
Implicit Place search using SMT with State Equation took 29976 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/475 places, 445/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56143 ms. Remains : 446/475 places, 445/453 transitions.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343245 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343245 steps, saw 171694 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:16:07] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-09 08:16:08] [INFO ] After 505ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 08:16:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:16:09] [INFO ] After 975ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:16:09] [INFO ] After 1568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:16:10] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:16:10] [INFO ] After 425ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:16:10] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 08:16:10] [INFO ] After 1166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 445/445 transitions.
Applied a total of 0 rules in 18 ms. Remains 446 /446 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 446/446 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 446 /446 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:16:10] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-09 08:16:11] [INFO ] Implicit Places using invariants in 1090 ms returned []
// Phase 1: matrix 445 rows 446 cols
[2023-03-09 08:16:11] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-09 08:16:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:16:31] [INFO ] Implicit Places using invariants and state equation in 20087 ms returned [202, 209]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 21180 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 444/446 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 442 transition count 443
Applied a total of 4 rules in 24 ms. Remains 442 /444 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 442 cols
[2023-03-09 08:16:31] [INFO ] Computed 76 place invariants in 62 ms
[2023-03-09 08:16:34] [INFO ] Implicit Places using invariants in 2077 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 225, 253, 279]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2080 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 427/446 places, 443/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 427 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 418 transition count 434
Applied a total of 18 rules in 35 ms. Remains 418 /427 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-09 08:16:34] [INFO ] Computed 61 place invariants in 85 ms
[2023-03-09 08:16:35] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2023-03-09 08:16:35] [INFO ] Invariant cache hit.
[2023-03-09 08:16:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-09 08:17:05] [INFO ] Implicit Places using invariants and state equation in 30259 ms returned []
Implicit Place search using SMT with State Equation took 31318 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/446 places, 434/445 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 54657 ms. Remains : 418/446 places, 434/445 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13916 reset in 205 ms.
Product exploration explored 100000 steps with 13800 reset in 236 ms.
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 21 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:17:06] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 08:17:07] [INFO ] Implicit Places using invariants in 858 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:17:07] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-09 08:17:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:17:25] [INFO ] Implicit Places using invariants and state equation in 17928 ms returned []
Implicit Place search using SMT with State Equation took 18799 ms to find 0 implicit places.
[2023-03-09 08:17:25] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-09 08:17:25] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-09 08:17:25] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19218 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLCardinality-12 finished in 345619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((G(p1)||X(p2)))))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 79 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:25] [INFO ] Invariants computation overflowed in 166 ms
[2023-03-09 08:17:26] [INFO ] Implicit Places using invariants in 692 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:26] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 08:17:27] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:27] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-09 08:17:28] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3316 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s67 s19), p1:(GT 2 s484), p2:(GT 1 s1048)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1111 ms.
Product exploration explored 100000 steps with 50000 reset in 1075 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLCardinality-13 finished in 5970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1&&F(p2))))'
Support contains 5 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 80 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:31] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-09 08:17:32] [INFO ] Implicit Places using invariants in 942 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:32] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-09 08:17:33] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-09 08:17:33] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-09 08:17:34] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3234 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s129), p2:(LEQ s579 s1046), p0:(GT s289 s899)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-14 finished in 3410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 822 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 821 transition count 759
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 476 place count 821 transition count 720
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 554 place count 782 transition count 720
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 992 place count 563 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 993 place count 562 transition count 537
Applied a total of 993 rules in 98 ms. Remains 562 /1060 variables (removed 498) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 562 cols
[2023-03-09 08:17:35] [INFO ] Computed 101 place invariants in 65 ms
[2023-03-09 08:17:35] [INFO ] Implicit Places using invariants in 864 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 866 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 560/1060 places, 537/998 transitions.
Graph (complete) has 1741 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 556 transition count 533
Applied a total of 7 rules in 39 ms. Remains 556 /560 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-09 08:17:36] [INFO ] Computed 99 place invariants in 82 ms
[2023-03-09 08:17:36] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-09 08:17:36] [INFO ] Invariant cache hit.
[2023-03-09 08:17:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 08:17:54] [INFO ] Implicit Places using invariants and state equation in 17188 ms returned []
Implicit Place search using SMT with State Equation took 18112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 556/1060 places, 533/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19116 ms. Remains : 556/1060 places, 533/998 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s161 s105)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLCardinality-15 finished in 19168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-09 08:17:54] [INFO ] Flatten gal took : 54 ms
[2023-03-09 08:17:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 08:17:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1060 places, 998 transitions and 2810 arcs took 11 ms.
Total runtime 1141006 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DoubleExponent-PT-020
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA DoubleExponent-PT-020-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678349925954

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 DoubleExponent-PT-020-LTLCardinality-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 1 0 2 0 0 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 4/1199 7/32 DoubleExponent-PT-020-LTLCardinality-09 524948 m, 104989 m/sec, 619422 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 1 0 2 0 0 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 9/1199 15/32 DoubleExponent-PT-020-LTLCardinality-09 1085884 m, 112187 m/sec, 1281400 t fired, .

Time elapsed: 10 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 1 0 2 0 0 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 14/1199 22/32 DoubleExponent-PT-020-LTLCardinality-09 1660045 m, 114832 m/sec, 1958791 t fired, .

Time elapsed: 15 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 1 0 2 0 0 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 19/1199 28/32 DoubleExponent-PT-020-LTLCardinality-09 2156247 m, 99240 m/sec, 2544383 t fired, .

Time elapsed: 20 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for DoubleExponent-PT-020-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 8 (type EXCL) for 7 DoubleExponent-PT-020-LTLCardinality-12
lola: time limit : 1787 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1787 8/32 DoubleExponent-PT-020-LTLCardinality-12 546868 m, 109373 m/sec, 645294 t fired, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1787 15/32 DoubleExponent-PT-020-LTLCardinality-12 1093943 m, 109415 m/sec, 1290912 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1787 22/32 DoubleExponent-PT-020-LTLCardinality-12 1679555 m, 117122 m/sec, 1981814 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1787 29/32 DoubleExponent-PT-020-LTLCardinality-12 2234970 m, 111083 m/sec, 2637281 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for DoubleExponent-PT-020-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DoubleExponent-PT-020-LTLCardinality-09: CONJ 0 1 0 0 2 0 1 0
DoubleExponent-PT-020-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 DoubleExponent-PT-020-LTLCardinality-09
lola: time limit : 3550 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for DoubleExponent-PT-020-LTLCardinality-09
lola: result : false
lola: markings : 1160
lola: fired transitions : 1335
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DoubleExponent-PT-020-LTLCardinality-09: CONJ false LTL model checker
DoubleExponent-PT-020-LTLCardinality-12: LTL unknown AGGR


Time elapsed: 50 secs. Pages in use: 32

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="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DoubleExponent-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819414500483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;