Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918200219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 18K Apr 29 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 29 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 175K Apr 29 23:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 671K Apr 29 23:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 123K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 359K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.9M May 10 09:33 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 BridgeAndVehicles-PT-V20P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652589384740

Running Version 202205111006
[2022-05-15 04:36:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 04:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 04:36:26] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2022-05-15 04:36:26] [INFO ] Transformed 108 places.
[2022-05-15 04:36:26] [INFO ] Transformed 2228 transitions.
[2022-05-15 04:36:26] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 63 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:36:26] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:36:26] [INFO ] Computed 7 place invariants in 21 ms
[2022-05-15 04:36:27] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
[2022-05-15 04:36:27] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:36:27] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-15 04:36:27] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-05-15 04:36:27] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:36:27] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 04:36:28] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2022-05-15 04:36:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:36:28] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 04:36:28] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Support contains 15 out of 108 places after structural reductions.
[2022-05-15 04:36:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 04:36:29] [INFO ] Flatten gal took : 198 ms
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 04:36:29] [INFO ] Flatten gal took : 114 ms
[2022-05-15 04:36:29] [INFO ] Input system was already deterministic with 2228 transitions.
Support contains 14 out of 108 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 04:36:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:36:30] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 04:36:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-15 04:36:30] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 04:36:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-05-15 04:36:30] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 04:36:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:30] [INFO ] After 85ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 04:36:30] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-15 04:36:30] [INFO ] After 565ms 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 3 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Applied a total of 3 rules in 424 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 04:36:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:36:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:36:32] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/108 places, 2227/2228 transitions.
Incomplete random walk after 10001 steps, including 57 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259548 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259548 steps, saw 68023 distinct states, run finished after 3002 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:36:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:36:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:35] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:36:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:36:35] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:35] [INFO ] After 88ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:35] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-15 04:36:35] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 201 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 307 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:36:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:36:36] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:36:36] [INFO ] Implicit Places using invariants in 358 ms returned []
[2022-05-15 04:36:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:36:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:36] [INFO ] Implicit Places using invariants and state equation in 606 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 979 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 103/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 195 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/105 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272674 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272674 steps, saw 71614 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:36:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:40] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:36:40] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:36:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:36:40] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:40] [INFO ] After 58ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:40] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 04:36:40] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 191 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 181 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:36:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:40] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:36:41] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-05-15 04:36:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:42] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2022-05-15 04:36:42] [INFO ] Redundant transitions in 123 ms returned []
[2022-05-15 04:36:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:36:42] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1944 place count 101 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1946 place count 99 transition count 285
Applied a total of 1946 rules in 26 ms. Remains 99 /103 variables (removed 4) and now considering 285/2227 (removed 1942) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 99 cols
[2022-05-15 04:36:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:43] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:36:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:36:43] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:36:43] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:43] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 04:36:43] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:36:43] [INFO ] Flatten gal took : 15 ms
[2022-05-15 04:36:43] [INFO ] Flatten gal took : 12 ms
[2022-05-15 04:36:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14098963183060934228.gal : 12 ms
[2022-05-15 04:36:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15220049835395470120.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9281119997517557450;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14098963183060934228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15220049835395470120.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15220049835395470120.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :592 after 73528
Reachability property AtomicPropp10 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.11484e+06,0.140555,8056,2,1258,15,11148,6,0,688,7357,0
Total reachable state count : 1114838

Verifying 1 reachability properties.
Reachability property AtomicPropp10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,4,0.143596,8056,2,106,15,11148,7,0,733,7357,0
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 10 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:36:43] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:36:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:36:44] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2022-05-15 04:36:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:36:44] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:36:44] [INFO ] Implicit Places using invariants in 256 ms returned []
[2022-05-15 04:36:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:36:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:45] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1469 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s24 s25) s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 24969 reset in 1042 ms.
Product exploration explored 100000 steps with 24983 reset in 934 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-15 04:36:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2022-05-15 04:36:48] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:36:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 04:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:36:48] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-05-15 04:36:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:36:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 04:36:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:36:49] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-15 04:36:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:50] [INFO ] [Nat]Added 102 Read/Feed constraints in 1447 ms returned sat
[2022-05-15 04:36:50] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 135 ms.
[2022-05-15 04:36:50] [INFO ] Added : 41 causal constraints over 9 iterations in 350 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2228/2228 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 2 place count 103 transition count 2227
Applied a total of 2 rules in 639 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 04:36:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:51] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:36:52] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2022-05-15 04:36:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:52] [INFO ] Implicit Places using invariants in 247 ms returned []
[2022-05-15 04:36:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:52] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:36:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:53] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2022-05-15 04:36:53] [INFO ] Redundant transitions in 94 ms returned []
[2022-05-15 04:36:53] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:36:54] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/104 places, 2227/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/104 places, 2227/2228 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-15 04:36:54] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:36:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:36:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:36:55] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-15 04:36:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:36:55] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-15 04:36:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:36:56] [INFO ] [Nat]Added 102 Read/Feed constraints in 768 ms returned sat
[2022-05-15 04:36:56] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 64 ms.
[2022-05-15 04:36:56] [INFO ] Added : 24 causal constraints over 6 iterations in 226 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24946 reset in 912 ms.
Product exploration explored 100000 steps with 25013 reset in 912 ms.
Built C files in :
/tmp/ltsmin2111314784141423920
[2022-05-15 04:36:58] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:36:58] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2111314784141423920
Running compilation step : cd /tmp/ltsmin2111314784141423920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2111314784141423920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2111314784141423920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 225 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:37:01] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:37:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:37:02] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2022-05-15 04:37:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:37:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:37:02] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-05-15 04:37:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:37:02] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 04:37:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:37:03] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
[2022-05-15 04:37:03] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-15 04:37:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:37:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:37:04] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin6987305255512265
[2022-05-15 04:37:04] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:37:04] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6987305255512265
Running compilation step : cd /tmp/ltsmin6987305255512265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6987305255512265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6987305255512265;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:37:07] [INFO ] Flatten gal took : 85 ms
[2022-05-15 04:37:07] [INFO ] Flatten gal took : 83 ms
[2022-05-15 04:37:07] [INFO ] Time to serialize gal into /tmp/LTL1161522273865716701.gal : 22 ms
[2022-05-15 04:37:07] [INFO ] Time to serialize properties into /tmp/LTL5328172589149768332.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1161522273865716701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5328172589149768332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1161522...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((CONTROLEUR_1+CONTROLEUR_2)>SUR_PONT_B)"))))
Formula 0 simplified : !XF"((CONTROLEUR_1+CONTROLEUR_2)>SUR_PONT_B)"
Detected timeout of ITS tools.
[2022-05-15 04:37:23] [INFO ] Flatten gal took : 80 ms
[2022-05-15 04:37:23] [INFO ] Applying decomposition
[2022-05-15 04:37:23] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9131682769832315509.txt' '-o' '/tmp/graph9131682769832315509.bin' '-w' '/tmp/graph9131682769832315509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9131682769832315509.bin' '-l' '-1' '-v' '-w' '/tmp/graph9131682769832315509.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:37:23] [INFO ] Decomposing Gal with order
[2022-05-15 04:37:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:37:24] [INFO ] Removed a total of 4163 redundant transitions.
[2022-05-15 04:37:25] [INFO ] Flatten gal took : 1513 ms
[2022-05-15 04:37:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2458 labels/synchronizations in 183 ms.
[2022-05-15 04:37:25] [INFO ] Time to serialize gal into /tmp/LTL5988890467924141863.gal : 6 ms
[2022-05-15 04:37:25] [INFO ] Time to serialize properties into /tmp/LTL4256852995927931655.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5988890467924141863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4256852995927931655.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5988890...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>gu1.SUR_PONT_B)"))))
Formula 0 simplified : !XF"((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>gu1.SUR_PONT_B)"
Reverse transition relation is NOT exact ! Due to transitions gi1.gu2.t43, gi1.t45, gi1.t42, gi1.t0, t44, t341, t1191, t2208_t21, t2223_t21, Intersection ...238
Computing Next relation with stutter on 40 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1363 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.8228,312848,1,0,322,1.00062e+06,132,176,9612,696035,516
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-01 finished in 56618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 170 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:37:40] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:37:40] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 04:37:41] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
[2022-05-15 04:37:41] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:37:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:37:41] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-15 04:37:41] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:37:41] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:37:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:37:42] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1427 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 182 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s52 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 602 reset in 703 ms.
Product exploration explored 100000 steps with 602 reset in 676 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3101 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 455 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=91 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 185 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:37:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:37:45] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
[2022-05-15 04:37:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:37:45] [INFO ] Implicit Places using invariants in 299 ms returned []
[2022-05-15 04:37:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:45] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:37:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:37:46] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2022-05-15 04:37:46] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-15 04:37:46] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:37:47] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2228/2228 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 3101 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 2355 steps, including 13 resets, run visited all 1 properties in 20 ms. (steps per millisecond=117 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 602 reset in 672 ms.
Product exploration explored 100000 steps with 602 reset in 669 ms.
Built C files in :
/tmp/ltsmin15019982718056194523
[2022-05-15 04:37:49] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:37:49] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15019982718056194523
Running compilation step : cd /tmp/ltsmin15019982718056194523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15019982718056194523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15019982718056194523;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 211 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:37:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:37:53] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2022-05-15 04:37:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:37:53] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-05-15 04:37:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:37:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:37:54] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2022-05-15 04:37:54] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-15 04:37:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2022-05-15 04:37:54] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:37:55] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2228/2228 transitions.
Built C files in :
/tmp/ltsmin10850918452092061585
[2022-05-15 04:37:55] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:37:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10850918452092061585
Running compilation step : cd /tmp/ltsmin10850918452092061585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10850918452092061585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10850918452092061585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:37:58] [INFO ] Flatten gal took : 73 ms
[2022-05-15 04:37:58] [INFO ] Flatten gal took : 75 ms
[2022-05-15 04:37:58] [INFO ] Time to serialize gal into /tmp/LTL138565697192063477.gal : 10 ms
[2022-05-15 04:37:58] [INFO ] Time to serialize properties into /tmp/LTL1964384347070311395.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL138565697192063477.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1964384347070311395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1385656...265
Read 1 LTL properties
Checking formula 0 : !((F(G("(SORTI_B<=CAPACITE)"))))
Formula 0 simplified : !FG"(SORTI_B<=CAPACITE)"
Detected timeout of ITS tools.
[2022-05-15 04:38:13] [INFO ] Flatten gal took : 72 ms
[2022-05-15 04:38:13] [INFO ] Applying decomposition
[2022-05-15 04:38:13] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4550596667561340574.txt' '-o' '/tmp/graph4550596667561340574.bin' '-w' '/tmp/graph4550596667561340574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4550596667561340574.bin' '-l' '-1' '-v' '-w' '/tmp/graph4550596667561340574.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:38:14] [INFO ] Decomposing Gal with order
[2022-05-15 04:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:38:14] [INFO ] Removed a total of 2095 redundant transitions.
[2022-05-15 04:38:14] [INFO ] Flatten gal took : 340 ms
[2022-05-15 04:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 9 ms.
[2022-05-15 04:38:14] [INFO ] Time to serialize gal into /tmp/LTL955178413190901746.gal : 6 ms
[2022-05-15 04:38:14] [INFO ] Time to serialize properties into /tmp/LTL12292131239315595838.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL955178413190901746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12292131239315595838.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9551784...266
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.SORTI_B<=gu1.CAPACITE)"))))
Formula 0 simplified : !FG"(gu1.SORTI_B<=gu1.CAPACITE)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9337010249968631063
[2022-05-15 04:38:29] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9337010249968631063
Running compilation step : cd /tmp/ltsmin9337010249968631063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9337010249968631063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9337010249968631063;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-08 finished in 52421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X(p0))||(G(X(G(p1)))&&p2)))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 174 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:38:32] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:38:32] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-15 04:38:33] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2022-05-15 04:38:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:38:33] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 04:38:33] [INFO ] Implicit Places using invariants in 292 ms returned []
[2022-05-15 04:38:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:38:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 04:38:34] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2022-05-15 04:38:34] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-15 04:38:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:38:34] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 04:38:35] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s51 s24), p2:(GT s56 s22), p1:(GT s49 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-10 finished in 2636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 106 transition count 2227
Applied a total of 3 rules in 208 ms. Remains 106 /108 variables (removed 2) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 04:38:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-15 04:38:35] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:38:36] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2022-05-15 04:38:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-15 04:38:36] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 04:38:36] [INFO ] Implicit Places using invariants in 306 ms returned []
[2022-05-15 04:38:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-15 04:38:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:38:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:38:37] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1554 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 176 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 684 reset in 703 ms.
Product exploration explored 100000 steps with 685 reset in 730 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3099 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2022-05-15 04:38:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:38:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:38:40] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-15 04:38:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:38:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:38:41] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-15 04:38:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:38:42] [INFO ] [Nat]Added 102 Read/Feed constraints in 1007 ms returned sat
[2022-05-15 04:38:42] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2022-05-15 04:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2022-05-15 04:38:42] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 67 ms.
[2022-05-15 04:38:42] [INFO ] Added : 25 causal constraints over 6 iterations in 261 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 190 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:38:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:42] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:38:43] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
[2022-05-15 04:38:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:38:43] [INFO ] Implicit Places using invariants in 316 ms returned []
[2022-05-15 04:38:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:38:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:38:45] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2022-05-15 04:38:45] [INFO ] Redundant transitions in 56 ms returned []
[2022-05-15 04:38:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:38:46] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3099 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2022-05-15 04:38:46] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:46] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:38:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:38:47] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-15 04:38:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:38:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:38:47] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-15 04:38:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:38:48] [INFO ] [Nat]Added 102 Read/Feed constraints in 1008 ms returned sat
[2022-05-15 04:38:49] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2022-05-15 04:38:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2022-05-15 04:38:49] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 92 ms.
[2022-05-15 04:38:49] [INFO ] Added : 25 causal constraints over 6 iterations in 252 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 685 reset in 707 ms.
Product exploration explored 100000 steps with 685 reset in 727 ms.
Built C files in :
/tmp/ltsmin3836155259987095754
[2022-05-15 04:38:50] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:38:50] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3836155259987095754
Running compilation step : cd /tmp/ltsmin3836155259987095754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3836155259987095754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3836155259987095754;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 193 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:38:54] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:38:54] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
[2022-05-15 04:38:54] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:38:55] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-15 04:38:55] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:38:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:38:56] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2022-05-15 04:38:56] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-15 04:38:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2022-05-15 04:38:56] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 04:38:56] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin6195613701106907338
[2022-05-15 04:38:56] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:38:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6195613701106907338
Running compilation step : cd /tmp/ltsmin6195613701106907338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6195613701106907338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6195613701106907338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:39:00] [INFO ] Flatten gal took : 67 ms
[2022-05-15 04:39:00] [INFO ] Flatten gal took : 67 ms
[2022-05-15 04:39:00] [INFO ] Time to serialize gal into /tmp/LTL8455966252739429853.gal : 9 ms
[2022-05-15 04:39:00] [INFO ] Time to serialize properties into /tmp/LTL6594624806053503729.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8455966252739429853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6594624806053503729.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8455966...266
Read 1 LTL properties
Checking formula 0 : !((F(G("(SORTI_B>=1)"))))
Formula 0 simplified : !FG"(SORTI_B>=1)"
Detected timeout of ITS tools.
[2022-05-15 04:39:15] [INFO ] Flatten gal took : 67 ms
[2022-05-15 04:39:15] [INFO ] Applying decomposition
[2022-05-15 04:39:15] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9018395595853177599.txt' '-o' '/tmp/graph9018395595853177599.bin' '-w' '/tmp/graph9018395595853177599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9018395595853177599.bin' '-l' '-1' '-v' '-w' '/tmp/graph9018395595853177599.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:39:15] [INFO ] Decomposing Gal with order
[2022-05-15 04:39:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:39:16] [INFO ] Removed a total of 4214 redundant transitions.
[2022-05-15 04:39:16] [INFO ] Flatten gal took : 474 ms
[2022-05-15 04:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 17 ms.
[2022-05-15 04:39:16] [INFO ] Time to serialize gal into /tmp/LTL18090023835630936500.gal : 1 ms
[2022-05-15 04:39:16] [INFO ] Time to serialize properties into /tmp/LTL14409326301546135069.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18090023835630936500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14409326301546135069.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1809002...247
Read 1 LTL properties
Checking formula 0 : !((F(G("(i1.u1.SORTI_B>=1)"))))
Formula 0 simplified : !FG"(i1.u1.SORTI_B>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3353813368100163783
[2022-05-15 04:39:31] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3353813368100163783
Running compilation step : cd /tmp/ltsmin3353813368100163783;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3353813368100163783;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3353813368100163783;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-11 finished in 58904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2228
Applied a total of 1 rules in 8 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:39:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:39:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:39:34] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
[2022-05-15 04:39:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:39:34] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 04:39:35] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-05-15 04:39:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2022-05-15 04:39:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 04:39:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:37] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2203 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 10 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s53 s23), p1:(LEQ 3 s0)], 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 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-12 finished in 2949 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2227
Applied a total of 4 rules in 20 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 04:39:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:39:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:39:37] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2022-05-15 04:39:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:39:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:38] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-15 04:39:38] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:39:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:38] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 931 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 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:(LEQ s71 s23)], 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]]
Product exploration explored 100000 steps with 602 reset in 652 ms.
Product exploration explored 100000 steps with 602 reset in 668 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324139 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324139 steps, saw 84019 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:39:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:39:43] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:39:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:39:43] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:43] [INFO ] After 58ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:43] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 04:39:43] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 160 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:39:44] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:44] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324655 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324655 steps, saw 84126 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:39:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:47] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-15 04:39:47] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:39:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:39:47] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:47] [INFO ] After 62ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:48] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 04:39:48] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 167 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 166 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:39:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:48] [INFO ] Implicit Places using invariants in 317 ms returned []
[2022-05-15 04:39:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:48] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:39:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:50] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2022-05-15 04:39:50] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-15 04:39:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:50] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:39:50] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1944 place count 101 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1946 place count 99 transition count 285
Applied a total of 1946 rules in 12 ms. Remains 99 /103 variables (removed 4) and now considering 285/2227 (removed 1942) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 99 cols
[2022-05-15 04:39:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:39:50] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:39:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:39:51] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:39:51] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:51] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-15 04:39:51] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:51] [INFO ] Flatten gal took : 12 ms
[2022-05-15 04:39:51] [INFO ] Flatten gal took : 9 ms
[2022-05-15 04:39:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14173552996357896687.gal : 1 ms
[2022-05-15 04:39:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7748391146106234799.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2745349096339545225;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14173552996357896687.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7748391146106234799.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7748391146106234799.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :592 after 73528
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.11484e+06,0.143451,8264,2,1258,15,11148,6,0,688,7357,0
Total reachable state count : 1114838

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.146551,8264,2,106,15,11148,7,0,733,7357,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:39:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:51] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:39:52] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
[2022-05-15 04:39:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:39:52] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-05-15 04:39:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:53] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2022-05-15 04:39:53] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:54] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322757 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322757 steps, saw 83616 distinct states, run finished after 3003 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:39:57] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:39:57] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:39:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:39:58] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:39:58] [INFO ] After 59ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:39:58] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 04:39:58] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 168 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:39:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:39:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:39:58] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10001 steps, including 57 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323441 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323441 steps, saw 83792 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:40:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:40:02] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:40:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:40:02] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:40:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:40:02] [INFO ] After 70ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:40:02] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 04:40:02] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 161 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 162 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:40:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:40:03] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-15 04:40:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:40:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:40:04] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2022-05-15 04:40:04] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-15 04:40:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:40:05] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1944 place count 101 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1946 place count 99 transition count 285
Applied a total of 1946 rules in 11 ms. Remains 99 /103 variables (removed 4) and now considering 285/2227 (removed 1942) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 99 cols
[2022-05-15 04:40:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:40:05] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:40:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:40:05] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:40:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:40:05] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:40:05] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-15 04:40:05] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:40:05] [INFO ] Flatten gal took : 13 ms
[2022-05-15 04:40:05] [INFO ] Flatten gal took : 9 ms
[2022-05-15 04:40:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12502140221149297002.gal : 2 ms
[2022-05-15 04:40:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7205228996058622494.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8842754060869485171;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12502140221149297002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7205228996058622494.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7205228996058622494.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :592 after 73528
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.11484e+06,0.140731,8256,2,1258,15,11148,6,0,688,7357,0
Total reachable state count : 1114838

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.143785,8256,2,106,15,11148,7,0,733,7357,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 602 reset in 659 ms.
Product exploration explored 100000 steps with 602 reset in 660 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 182 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:40:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:40:08] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2022-05-15 04:40:08] [INFO ] Redundant transitions in 49 ms returned []
[2022-05-15 04:40:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:40:08] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Product exploration explored 100000 steps with 602 reset in 713 ms.
Product exploration explored 100000 steps with 602 reset in 740 ms.
Built C files in :
/tmp/ltsmin5324309979517480237
[2022-05-15 04:40:10] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5324309979517480237
Running compilation step : cd /tmp/ltsmin5324309979517480237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5324309979517480237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5324309979517480237;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 13 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:40:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:13] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:40:14] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
[2022-05-15 04:40:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:40:14] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-05-15 04:40:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:14] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:40:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:40:15] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2022-05-15 04:40:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:40:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:40:16] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin11555135261742484267
[2022-05-15 04:40:16] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11555135261742484267
Running compilation step : cd /tmp/ltsmin11555135261742484267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11555135261742484267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11555135261742484267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:40:19] [INFO ] Flatten gal took : 65 ms
[2022-05-15 04:40:19] [INFO ] Flatten gal took : 66 ms
[2022-05-15 04:40:19] [INFO ] Time to serialize gal into /tmp/LTL2486721433503625190.gal : 8 ms
[2022-05-15 04:40:19] [INFO ] Time to serialize properties into /tmp/LTL10472573279259953203.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2486721433503625190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10472573279259953203.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2486721...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(COMPTEUR_19<=CAPACITE)"))))
Formula 0 simplified : !GX"(COMPTEUR_19<=CAPACITE)"
Detected timeout of ITS tools.
[2022-05-15 04:40:34] [INFO ] Flatten gal took : 72 ms
[2022-05-15 04:40:34] [INFO ] Applying decomposition
[2022-05-15 04:40:34] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18094075721951202653.txt' '-o' '/tmp/graph18094075721951202653.bin' '-w' '/tmp/graph18094075721951202653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18094075721951202653.bin' '-l' '-1' '-v' '-w' '/tmp/graph18094075721951202653.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:40:34] [INFO ] Decomposing Gal with order
[2022-05-15 04:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:40:35] [INFO ] Removed a total of 2137 redundant transitions.
[2022-05-15 04:40:35] [INFO ] Flatten gal took : 300 ms
[2022-05-15 04:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 10 ms.
[2022-05-15 04:40:35] [INFO ] Time to serialize gal into /tmp/LTL7958785206022724796.gal : 5 ms
[2022-05-15 04:40:35] [INFO ] Time to serialize properties into /tmp/LTL10240773963451427365.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7958785206022724796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10240773963451427365.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7958785...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(gu2.COMPTEUR_19<=gu2.CAPACITE)"))))
Formula 0 simplified : !GX"(gu2.COMPTEUR_19<=gu2.CAPACITE)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1682296791974861240
[2022-05-15 04:40:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1682296791974861240
Running compilation step : cd /tmp/ltsmin1682296791974861240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1682296791974861240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1682296791974861240;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 finished in 76076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0)&&G(p1)))||F(p2)||p2)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 188 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:40:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:40:53] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 04:40:54] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
[2022-05-15 04:40:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:40:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 04:40:54] [INFO ] Implicit Places using invariants in 286 ms returned []
[2022-05-15 04:40:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-15 04:40:54] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 04:40:55] [INFO ] Implicit Places using invariants and state equation in 733 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1035 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 190 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 106/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ s48 s62), p1:(GT s23 s53), p0:(GT s0 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6725 reset in 700 ms.
Product exploration explored 100000 steps with 6843 reset in 704 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 42 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
[2022-05-15 04:40:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:40:57] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 04:40:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:40:58] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-15 04:40:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:40:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:40:59] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-05-15 04:40:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:40:59] [INFO ] [Nat]Added 102 Read/Feed constraints in 715 ms returned sat
[2022-05-15 04:40:59] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 67 ms.
[2022-05-15 04:41:00] [INFO ] Added : 17 causal constraints over 4 iterations in 214 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 184 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:41:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:00] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-15 04:41:00] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2022-05-15 04:41:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:01] [INFO ] Implicit Places using invariants in 294 ms returned []
[2022-05-15 04:41:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:41:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:41:02] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1427 ms to find 0 implicit places.
[2022-05-15 04:41:02] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-15 04:41:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:41:02] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 2228/2228 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 3102 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 44 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
[2022-05-15 04:41:04] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:41:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 04:41:04] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-15 04:41:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 04:41:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 04:41:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 04:41:05] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-05-15 04:41:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:41:05] [INFO ] [Nat]Added 102 Read/Feed constraints in 710 ms returned sat
[2022-05-15 04:41:06] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 65 ms.
[2022-05-15 04:41:06] [INFO ] Added : 17 causal constraints over 4 iterations in 210 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 6613 reset in 698 ms.
Product exploration explored 100000 steps with 6789 reset in 707 ms.
Built C files in :
/tmp/ltsmin16905884104574226756
[2022-05-15 04:41:07] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:41:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16905884104574226756
Running compilation step : cd /tmp/ltsmin16905884104574226756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16905884104574226756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16905884104574226756;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 196 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-15 04:41:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:11] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
[2022-05-15 04:41:11] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:12] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-15 04:41:12] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:41:13] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2022-05-15 04:41:13] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-15 04:41:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-15 04:41:13] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:41:13] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 2228/2228 transitions.
Built C files in :
/tmp/ltsmin7378084680653196790
[2022-05-15 04:41:13] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:41:13] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7378084680653196790
Running compilation step : cd /tmp/ltsmin7378084680653196790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7378084680653196790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7378084680653196790;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:41:16] [INFO ] Flatten gal took : 63 ms
[2022-05-15 04:41:17] [INFO ] Flatten gal took : 65 ms
[2022-05-15 04:41:17] [INFO ] Time to serialize gal into /tmp/LTL3346204251618436678.gal : 7 ms
[2022-05-15 04:41:17] [INFO ] Time to serialize properties into /tmp/LTL13881785776047645473.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3346204251618436678.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13881785776047645473.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3346204...267
Read 1 LTL properties
Checking formula 0 : !((G(((G((F("(ROUTE_A>SORTI_A)"))&&(G("(SORTI_A>SORTI_B)"))))||(F("(CHOIX_1<=COMPTEUR_7)")))||("(CHOIX_1<=COMPTEUR_7)"))))
Formula 0 simplified : !G("(CHOIX_1<=COMPTEUR_7)" | G(F"(ROUTE_A>SORTI_A)" & G"(SORTI_A>SORTI_B)") | F"(CHOIX_1<=COMPTEUR_7)")
Detected timeout of ITS tools.
[2022-05-15 04:41:32] [INFO ] Flatten gal took : 64 ms
[2022-05-15 04:41:32] [INFO ] Applying decomposition
[2022-05-15 04:41:32] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1654401651107208211.txt' '-o' '/tmp/graph1654401651107208211.bin' '-w' '/tmp/graph1654401651107208211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1654401651107208211.bin' '-l' '-1' '-v' '-w' '/tmp/graph1654401651107208211.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:41:32] [INFO ] Decomposing Gal with order
[2022-05-15 04:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:41:32] [INFO ] Removed a total of 2222 redundant transitions.
[2022-05-15 04:41:32] [INFO ] Flatten gal took : 341 ms
[2022-05-15 04:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 20 ms.
[2022-05-15 04:41:32] [INFO ] Time to serialize gal into /tmp/LTL3477548041864311557.gal : 5 ms
[2022-05-15 04:41:33] [INFO ] Time to serialize properties into /tmp/LTL6071186304555080502.ltl : 145 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3477548041864311557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6071186304555080502.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3477548...266
Read 1 LTL properties
Checking formula 0 : !((G(((G((F("(gu3.ROUTE_A>gu3.SORTI_A)"))&&(G("(gu3.SORTI_A>gu3.SORTI_B)"))))||(F("(gu4.CHOIX_1<=gu4.COMPTEUR_7)")))||("(gu4.CHOIX_1<=...175
Formula 0 simplified : !G("(gu4.CHOIX_1<=gu4.COMPTEUR_7)" | G(F"(gu3.ROUTE_A>gu3.SORTI_A)" & G"(gu3.SORTI_A>gu3.SORTI_B)") | F"(gu4.CHOIX_1<=gu4.COMPTEUR_7...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13983826712904966654
[2022-05-15 04:41:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13983826712904966654
Running compilation step : cd /tmp/ltsmin13983826712904966654;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13983826712904966654;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13983826712904966654;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-15 finished in 57836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Found a SL insensitive property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Applied a total of 3 rules in 33 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2022-05-15 04:41:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:41:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:52] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
[2022-05-15 04:41:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:41:52] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:41:52] [INFO ] Implicit Places using invariants in 309 ms returned []
[2022-05-15 04:41:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-15 04:41:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:41:52] [INFO ] Implicit Places using invariants and state equation in 563 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 889 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 16 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/108 places, 2227/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 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:(LEQ s71 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 602 reset in 653 ms.
Product exploration explored 100000 steps with 602 reset in 673 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323811 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323811 steps, saw 83944 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:41:57] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:41:57] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 04:41:57] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:41:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:41:57] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:41:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:41:57] [INFO ] After 58ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:41:57] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 04:41:57] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 167 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:41:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:41:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:41:58] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325674 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325674 steps, saw 84343 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:42:01] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:01] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:42:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:42:01] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:02] [INFO ] After 55ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:02] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 04:42:02] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 165 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 164 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:02] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-15 04:42:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:04] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2022-05-15 04:42:04] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-15 04:42:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:42:04] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1944 place count 101 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1946 place count 99 transition count 285
Applied a total of 1946 rules in 17 ms. Remains 99 /103 variables (removed 4) and now considering 285/2227 (removed 1942) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 99 cols
[2022-05-15 04:42:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:04] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:42:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:42:04] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:42:04] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:04] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 04:42:04] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:04] [INFO ] Flatten gal took : 11 ms
[2022-05-15 04:42:04] [INFO ] Flatten gal took : 8 ms
[2022-05-15 04:42:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8301045848071365991.gal : 2 ms
[2022-05-15 04:42:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2297532796538664024.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9285106522349634138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8301045848071365991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2297532796538664024.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2297532796538664024.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :592 after 73528
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.11484e+06,0.141342,8260,2,1258,15,11148,6,0,688,7357,0
Total reachable state count : 1114838

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.145022,8260,2,106,15,11148,7,0,733,7357,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 10 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:05] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
[2022-05-15 04:42:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:06] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-15 04:42:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:07] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
[2022-05-15 04:42:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:08] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322851 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322851 steps, saw 83638 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:42:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:11] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:42:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 04:42:11] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:11] [INFO ] After 65ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:11] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-15 04:42:11] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 159 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:12] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327420 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327420 steps, saw 84700 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 04:42:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:15] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:42:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:42:15] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:15] [INFO ] After 57ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:15] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-15 04:42:15] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 157 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 160 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:16] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-15 04:42:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:17] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2022-05-15 04:42:17] [INFO ] Redundant transitions in 53 ms returned []
[2022-05-15 04:42:17] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:18] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1944 place count 101 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1946 place count 99 transition count 285
Applied a total of 1946 rules in 12 ms. Remains 99 /103 variables (removed 4) and now considering 285/2227 (removed 1942) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 99 cols
[2022-05-15 04:42:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:18] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 04:42:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 04:42:18] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 04:42:18] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:18] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 04:42:18] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 04:42:18] [INFO ] Flatten gal took : 11 ms
[2022-05-15 04:42:18] [INFO ] Flatten gal took : 8 ms
[2022-05-15 04:42:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12213742323833863064.gal : 1 ms
[2022-05-15 04:42:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1190539147912812803.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14335218877961584206;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12213742323833863064.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1190539147912812803.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality1190539147912812803.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 42
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :42 after 82
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :82 after 158
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :158 after 592
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :592 after 73528
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.11484e+06,0.135928,8256,2,1258,15,11148,6,0,688,7357,0
Total reachable state count : 1114838

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,4,0.138917,8256,2,106,15,11148,7,0,733,7357,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 602 reset in 652 ms.
Product exploration explored 100000 steps with 602 reset in 675 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 183 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:21] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
[2022-05-15 04:42:21] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-15 04:42:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:22] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Product exploration explored 100000 steps with 602 reset in 654 ms.
Product exploration explored 100000 steps with 602 reset in 664 ms.
Built C files in :
/tmp/ltsmin692479264542750380
[2022-05-15 04:42:23] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin692479264542750380
Running compilation step : cd /tmp/ltsmin692479264542750380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin692479264542750380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin692479264542750380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-15 04:42:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:26] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 04:42:26] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
[2022-05-15 04:42:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:27] [INFO ] Implicit Places using invariants in 279 ms returned []
[2022-05-15 04:42:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 04:42:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 04:42:28] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2022-05-15 04:42:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-15 04:42:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 04:42:29] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin7424354123356236872
[2022-05-15 04:42:29] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7424354123356236872
Running compilation step : cd /tmp/ltsmin7424354123356236872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7424354123356236872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7424354123356236872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 04:42:32] [INFO ] Flatten gal took : 63 ms
[2022-05-15 04:42:32] [INFO ] Flatten gal took : 63 ms
[2022-05-15 04:42:32] [INFO ] Time to serialize gal into /tmp/LTL6799304684782481474.gal : 8 ms
[2022-05-15 04:42:32] [INFO ] Time to serialize properties into /tmp/LTL16833921127165185367.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6799304684782481474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16833921127165185367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6799304...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(COMPTEUR_19<=CAPACITE)"))))
Formula 0 simplified : !GX"(COMPTEUR_19<=CAPACITE)"
Detected timeout of ITS tools.
[2022-05-15 04:42:47] [INFO ] Flatten gal took : 64 ms
[2022-05-15 04:42:47] [INFO ] Applying decomposition
[2022-05-15 04:42:47] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5106416690421264151.txt' '-o' '/tmp/graph5106416690421264151.bin' '-w' '/tmp/graph5106416690421264151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5106416690421264151.bin' '-l' '-1' '-v' '-w' '/tmp/graph5106416690421264151.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:42:47] [INFO ] Decomposing Gal with order
[2022-05-15 04:42:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:42:47] [INFO ] Removed a total of 2137 redundant transitions.
[2022-05-15 04:42:47] [INFO ] Flatten gal took : 284 ms
[2022-05-15 04:42:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 9 ms.
[2022-05-15 04:42:48] [INFO ] Time to serialize gal into /tmp/LTL2732063237107411911.gal : 5 ms
[2022-05-15 04:42:48] [INFO ] Time to serialize properties into /tmp/LTL15120930506819561728.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2732063237107411911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15120930506819561728.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2732063...267
Read 1 LTL properties
Checking formula 0 : !((G(X("(gu2.COMPTEUR_19<=gu2.CAPACITE)"))))
Formula 0 simplified : !GX"(gu2.COMPTEUR_19<=gu2.CAPACITE)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16626981590693654444
[2022-05-15 04:43:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16626981590693654444
Running compilation step : cd /tmp/ltsmin16626981590693654444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16626981590693654444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16626981590693654444;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 finished in 74880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p0)&&G(p1)))||F(p2)||p2)))'
[2022-05-15 04:43:06] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10609312974087320949
[2022-05-15 04:43:06] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-15 04:43:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10609312974087320949
Running compilation step : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 04:43:06] [INFO ] Applying decomposition
[2022-05-15 04:43:06] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13556788193996247514.txt' '-o' '/tmp/graph13556788193996247514.bin' '-w' '/tmp/graph13556788193996247514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13556788193996247514.bin' '-l' '-1' '-v' '-w' '/tmp/graph13556788193996247514.weights' '-q' '0' '-e' '0.001'
[2022-05-15 04:43:06] [INFO ] Decomposing Gal with order
[2022-05-15 04:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 04:43:06] [INFO ] Removed a total of 2326 redundant transitions.
[2022-05-15 04:43:06] [INFO ] Flatten gal took : 324 ms
[2022-05-15 04:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 401 labels/synchronizations in 10 ms.
[2022-05-15 04:43:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality18250911739076966902.gal : 5 ms
[2022-05-15 04:43:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality5733932549707161618.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18250911739076966902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5733932549707161618.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 4 LTL properties
Checking formula 0 : !((F(G("(gu0.SORTI_B<=gu5.CAPACITE)"))))
Formula 0 simplified : !FG"(gu0.SORTI_B<=gu5.CAPACITE)"
Compilation finished in 4931 ms.
Running link step : cd /tmp/ltsmin10609312974087320949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi1.gu2.t169, gi1.gu2.t170, gi1.gu2.t171, gi1.gu2.t172, gi1.gu2.t173, gi1.gu2.t174, gi1.gu2.t...5617
Computing Next relation with stutter on 40 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 05:05:20] [INFO ] Flatten gal took : 148 ms
[2022-05-15 05:05:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality14761454638818387162.gal : 20 ms
[2022-05-15 05:05:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality18243074049763456036.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14761454638818387162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18243074049763456036.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 4 LTL properties
Checking formula 0 : !((F(G("(SORTI_B<=CAPACITE)"))))
Formula 0 simplified : !FG"(SORTI_B<=CAPACITE)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 424484 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](([]((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))||<>((LTLAPp5==true))||(LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 05:27:34] [INFO ] Flatten gal took : 244 ms
[2022-05-15 05:27:34] [INFO ] Input system was already deterministic with 2228 transitions.
[2022-05-15 05:27:34] [INFO ] Transformed 108 places.
[2022-05-15 05:27:35] [INFO ] Transformed 2228 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 05:27:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality13630097671950514972.gal : 36 ms
[2022-05-15 05:27:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality8078781562424339641.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13630097671950514972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8078781562424339641.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(SORTI_B<=CAPACITE)"))))
Formula 0 simplified : !FG"(SORTI_B<=CAPACITE)"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](([]((<>((LTLAPp3==true))&&[]((LTLAPp4==true))))||<>((LTLAPp5==true))||(LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin10609312974087320949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N50, 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 r024-tall-165251918200219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 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 ;