About the Execution of ITS-Tools for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 854486.00 | 0.00 | 0.00 | FFTFFFFFTFTFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 238K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-22-LTLFireability-00
FORMULA_NAME MedleyA-PT-22-LTLFireability-01
FORMULA_NAME MedleyA-PT-22-LTLFireability-02
FORMULA_NAME MedleyA-PT-22-LTLFireability-03
FORMULA_NAME MedleyA-PT-22-LTLFireability-04
FORMULA_NAME MedleyA-PT-22-LTLFireability-05
FORMULA_NAME MedleyA-PT-22-LTLFireability-06
FORMULA_NAME MedleyA-PT-22-LTLFireability-07
FORMULA_NAME MedleyA-PT-22-LTLFireability-08
FORMULA_NAME MedleyA-PT-22-LTLFireability-09
FORMULA_NAME MedleyA-PT-22-LTLFireability-10
FORMULA_NAME MedleyA-PT-22-LTLFireability-11
FORMULA_NAME MedleyA-PT-22-LTLFireability-12
FORMULA_NAME MedleyA-PT-22-LTLFireability-13
FORMULA_NAME MedleyA-PT-22-LTLFireability-14
FORMULA_NAME MedleyA-PT-22-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748897664925
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 20:54:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:54:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:54:27] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2025-06-02 20:54:27] [INFO ] Transformed 307 places.
[2025-06-02 20:54:27] [INFO ] Transformed 740 transitions.
[2025-06-02 20:54:27] [INFO ] Found NUPN structural information;
[2025-06-02 20:54:27] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-22-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 98 place count 209 transition count 629
Iterating global reduction 1 with 94 rules applied. Total rules applied 192 place count 209 transition count 629
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 200 place count 209 transition count 621
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 224 place count 185 transition count 565
Iterating global reduction 2 with 24 rules applied. Total rules applied 248 place count 185 transition count 565
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 256 place count 177 transition count 545
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 177 transition count 545
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 267 place count 174 transition count 536
Iterating global reduction 2 with 3 rules applied. Total rules applied 270 place count 174 transition count 536
Applied a total of 270 rules in 183 ms. Remains 174 /307 variables (removed 133) and now considering 536/740 (removed 204) transitions.
// Phase 1: matrix 536 rows 174 cols
[2025-06-02 20:54:28] [INFO ] Computed 22 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:29] [INFO ] Implicit Places using invariants in 513 ms returned []
[2025-06-02 20:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:29] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2025-06-02 20:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:44] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:44] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:44] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 10/32 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/32 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 536/710 variables, 174/206 constraints. Problems are: Problem set: 144 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:57] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/710 variables, and 208 constraints, problems are : Problem set: 144 solved, 391 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 16/16 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 6/22 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 12/34 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/34 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 536/710 variables, 174/208 constraints. Problems are: Problem set: 144 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 391/599 constraints. Problems are: Problem set: 144 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:22] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:25] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:25] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:31] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/710 variables, and 603 constraints, problems are : Problem set: 144 solved, 391 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 391/535 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61914ms problems are : Problem set: 144 solved, 391 unsolved
Search for dead transitions found 144 dead transitions in 61965ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/307 places, 392/740 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63488 ms. Remains : 174/307 places, 392/740 transitions.
Support contains 41 out of 174 places after structural reductions.
[2025-06-02 20:55:32] [INFO ] Flatten gal took : 101 ms
[2025-06-02 20:55:32] [INFO ] Flatten gal took : 51 ms
[2025-06-02 20:55:32] [INFO ] Input system was already deterministic with 392 transitions.
Support contains 38 out of 174 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (1167 resets) in 2748 ms. (14 steps per ms) remains 18/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 65 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 65 ms. (60 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (19 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (22 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 53 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 58 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (20 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (22 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (23 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (22 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
// Phase 1: matrix 392 rows 174 cols
[2025-06-02 20:55:33] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/88 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 61/149 variables, 11/17 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 8/157 variables, 3/20 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 382/539 variables, 157/177 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/177 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 19/558 variables, 12/189 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/189 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 2/191 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 1/192 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 6/565 variables, 3/195 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/566 variables, 1/196 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:35] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:35] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 2/198 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/566 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 198 constraints, problems are : Problem set: 4 solved, 14 unsolved in 2309 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 58/87 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 62/149 variables, 11/17 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/157 variables, 3/20 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/20 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 382/539 variables, 157/177 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 6/183 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 2/185 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:36] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 1/186 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:37] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/187 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/187 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 19/558 variables, 12/199 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 6/205 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/205 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/559 variables, 2/207 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/559 variables, 1/208 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/559 variables, 0/208 constraints. Problems are: Problem set: 6 solved, 12 unsolved
SMT process timed out in 7380ms, After SMT, problems are : Problem set: 6 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 392/392 transitions.
Graph (complete) has 741 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 173 transition count 371
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 154 transition count 371
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 40 place count 154 transition count 366
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 149 transition count 366
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 145 transition count 359
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 145 transition count 359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 144 transition count 356
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 144 transition count 356
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 97 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 124 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 124 transition count 337
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 120 transition count 371
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 123 place count 120 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 136 place count 120 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 119 transition count 353
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 119 transition count 347
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 150 place count 113 transition count 347
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 166 place count 113 transition count 413
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 182 place count 97 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 97 transition count 412
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 189 place count 97 transition count 412
Applied a total of 189 rules in 176 ms. Remains 97 /174 variables (removed 77) and now considering 412/392 (removed -20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 97/174 places, 412/392 transitions.
RANDOM walk for 40000 steps (2779 resets) in 1910 ms. (20 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (547 resets) in 360 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (542 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (492 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (526 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (406 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (537 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (549 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (398 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (302 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
// Phase 1: matrix 412 rows 97 cols
[2025-06-02 20:55:42] [INFO ] Computed 22 invariants in 6 ms
[2025-06-02 20:55:42] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 26/92 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 4/96 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 412/508 variables, 96/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 58/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/509 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/509 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 177 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 97/97 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/66 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 26/92 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 4/96 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 412/508 variables, 96/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 58/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:44] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/509 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/509 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 187 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5931 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 97/97 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7241ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 1999 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 97 transition count 410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 95 transition count 410
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 95 transition count 408
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 93 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 17 place count 88 transition count 404
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 87 transition count 399
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 87 transition count 399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 86 transition count 401
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 86 transition count 397
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 82 transition count 397
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 81 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 81 transition count 391
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 40 place count 81 transition count 772
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 81 place count 72 transition count 740
Applied a total of 81 rules in 89 ms. Remains 72 /97 variables (removed 25) and now considering 740/412 (removed -328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 72/97 places, 740/412 transitions.
RANDOM walk for 40000 steps (4441 resets) in 2156 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33079 steps (445 resets) in 93 ms. (351 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-22-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA MedleyA-PT-22-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 741 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 6 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Graph (complete) has 741 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 172 transition count 365
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 147 transition count 365
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 51 place count 147 transition count 360
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 142 transition count 360
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 134 transition count 341
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 134 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 134 transition count 340
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 134 transition count 338
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 132 transition count 338
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 86 place count 128 transition count 326
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 128 transition count 326
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 126 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 126 transition count 320
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 134 place count 105 transition count 301
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 103 transition count 299
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 103 transition count 299
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 150 place count 97 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 170 place count 97 transition count 308
Applied a total of 170 rules in 104 ms. Remains 97 /174 variables (removed 77) and now considering 308/392 (removed 84) transitions.
// Phase 1: matrix 308 rows 97 cols
[2025-06-02 20:55:52] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:55:52] [INFO ] Implicit Places using invariants in 128 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/174 places, 308/392 transitions.
Applied a total of 0 rules in 16 ms. Remains 96 /96 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 96/174 places, 308/392 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-00
Product exploration explored 100000 steps with 10367 reset in 590 ms.
Product exploration explored 100000 steps with 10375 reset in 530 ms.
Computed a total of 9 stabilizing places and 125 stable transitions
Computed a total of 9 stabilizing places and 125 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (4115 resets) in 565 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (724 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (726 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (746 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (707 resets) in 100 ms. (396 steps per ms) remains 1/4 properties
// Phase 1: matrix 308 rows 96 cols
[2025-06-02 20:55:54] [INFO ] Computed 19 invariants in 3 ms
[2025-06-02 20:55:54] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 6/404 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/96 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 308/308 transitions.
Applied a total of 0 rules in 15 ms. Remains 96 /96 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2025-06-02 20:55:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:55:55] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 20:55:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:55:55] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-06-02 20:55:55] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:55:55] [INFO ] Redundant transitions in 36 ms returned []
Running 302 sub problems to find dead transitions.
[2025-06-02 20:55:55] [INFO ] Invariant cache hit.
[2025-06-02 20:55:55] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 308/403 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 130/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 245 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 308/403 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 130/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 302/546 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:42] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 547 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/96 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60485ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60489ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61128 ms. Remains : 96/96 places, 308/308 transitions.
Computed a total of 9 stabilizing places and 125 stable transitions
Computed a total of 9 stabilizing places and 125 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (4148 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (732 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1187651 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 1
Probabilistic random walk after 1187651 steps, saw 203147 distinct states, run finished after 3011 ms. (steps per millisecond=394 ) properties seen :0
[2025-06-02 20:56:59] [INFO ] Invariant cache hit.
[2025-06-02 20:56:59] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 42/74 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 295/377 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 96/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/403 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 34/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/404 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/404 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 245 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/74 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/82 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 295/377 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 96/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/377 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/403 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 34/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/404 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 246 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 307
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 96 transition count 301
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 90 transition count 301
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 90 transition count 411
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 63 place count 74 transition count 393
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 74 transition count 393
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 73 transition count 385
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 73 transition count 385
Applied a total of 73 rules in 79 ms. Remains 73 /96 variables (removed 23) and now considering 385/308 (removed -77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 73/96 places, 385/308 transitions.
RANDOM walk for 30314 steps (4259 resets) in 304 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 10338 reset in 728 ms.
Product exploration explored 100000 steps with 10394 reset in 344 ms.
Built C files in :
/tmp/ltsmin8661155852964032387
[2025-06-02 20:57:02] [INFO ] Computing symmetric may disable matrix : 308 transitions.
[2025-06-02 20:57:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:57:02] [INFO ] Computing symmetric may enable matrix : 308 transitions.
[2025-06-02 20:57:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:57:02] [INFO ] Computing Do-Not-Accords matrix : 308 transitions.
[2025-06-02 20:57:02] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:57:02] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8661155852964032387
Running compilation step : cd /tmp/ltsmin8661155852964032387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1844 ms.
Running link step : cd /tmp/ltsmin8661155852964032387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8661155852964032387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2708925767913707216.hoa' '--buchi-type=spotba'
LTSmin run took 11664 ms.
FORMULA MedleyA-PT-22-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-22-LTLFireability-00 finished in 83668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p1||X((p2||X(X(F(p2))))))))))'
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 375
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 167 transition count 374
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 164 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 164 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 162 transition count 359
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 162 transition count 359
Applied a total of 25 rules in 9 ms. Remains 162 /174 variables (removed 12) and now considering 359/392 (removed 33) transitions.
// Phase 1: matrix 359 rows 162 cols
[2025-06-02 20:57:16] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:57:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 20:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:57:16] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-02 20:57:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:24] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:24] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:24] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:24] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:24] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:25] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:35] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 191 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/521 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 358/549 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:13] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:13] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:13] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 552 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 359/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60845 ms. Remains : 162/174 places, 359/392 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-01
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-01 finished in 61065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Graph (complete) has 741 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 172 transition count 364
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 146 transition count 364
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 53 place count 146 transition count 359
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 141 transition count 359
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 134 transition count 341
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 134 transition count 341
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 77 place count 134 transition count 339
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 132 transition count 339
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 129 transition count 330
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 129 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 127 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 127 transition count 324
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 138 place count 102 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 102 transition count 301
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 98 transition count 295
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 98 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 157 place count 93 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 170 place count 93 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 92 transition count 315
Applied a total of 172 rules in 53 ms. Remains 92 /174 variables (removed 82) and now considering 315/392 (removed 77) transitions.
// Phase 1: matrix 315 rows 92 cols
[2025-06-02 20:58:17] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:58:17] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 20:58:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:58:17] [INFO ] State equation strengthened by 171 read => feed constraints.
[2025-06-02 20:58:17] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:58:17] [INFO ] Redundant transitions in 9 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-02 20:58:17] [INFO ] Invariant cache hit.
[2025-06-02 20:58:17] [INFO ] State equation strengthened by 171 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 315/406 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 171/281 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 282 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 315/406 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 171/281 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 305/586 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 587 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/174 places, 315/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61182 ms. Remains : 92/174 places, 315/392 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-04 finished in 61238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Graph (complete) has 741 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 172 transition count 364
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 146 transition count 364
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 53 place count 146 transition count 360
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 142 transition count 360
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 136 transition count 347
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 136 transition count 347
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 73 place count 136 transition count 345
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 134 transition count 345
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 132 transition count 338
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 132 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 131 transition count 335
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 131 transition count 335
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 130 place count 106 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 106 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 102 transition count 306
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 102 transition count 306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 153 place count 95 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 191 place count 95 transition count 312
Applied a total of 191 rules in 57 ms. Remains 95 /174 variables (removed 79) and now considering 312/392 (removed 80) transitions.
// Phase 1: matrix 312 rows 95 cols
[2025-06-02 20:59:18] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:59:18] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 20:59:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:59:18] [INFO ] State equation strengthened by 142 read => feed constraints.
[2025-06-02 20:59:18] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:59:18] [INFO ] Redundant transitions in 6 ms returned []
Running 306 sub problems to find dead transitions.
[2025-06-02 20:59:18] [INFO ] Invariant cache hit.
[2025-06-02 20:59:18] [INFO ] State equation strengthened by 142 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 256 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 306/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
SMT process timed out in 60308ms, After SMT, problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/174 places, 312/392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60893 ms. Remains : 95/174 places, 312/392 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-06
Product exploration explored 100000 steps with 10432 reset in 535 ms.
Product exploration explored 100000 steps with 10416 reset in 554 ms.
Computed a total of 9 stabilizing places and 128 stable transitions
Computed a total of 9 stabilizing places and 128 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4182 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (661 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5292 steps, run visited all 1 properties in 25 ms. (steps per millisecond=211 )
Probabilistic random walk after 5292 steps, saw 1573 distinct states, run finished after 32 ms. (steps per millisecond=165 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2025-06-02 21:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 21:00:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:21] [INFO ] State equation strengthened by 142 read => feed constraints.
[2025-06-02 21:00:21] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:00:21] [INFO ] Redundant transitions in 4 ms returned []
Running 306 sub problems to find dead transitions.
[2025-06-02 21:00:21] [INFO ] Invariant cache hit.
[2025-06-02 21:00:21] [INFO ] State equation strengthened by 142 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 256 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 306/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 562 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61003 ms. Remains : 95/95 places, 312/312 transitions.
Computed a total of 9 stabilizing places and 128 stable transitions
Computed a total of 9 stabilizing places and 128 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4179 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (654 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5292 steps, run visited all 1 properties in 41 ms. (steps per millisecond=129 )
Probabilistic random walk after 5292 steps, saw 1573 distinct states, run finished after 41 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10459 reset in 568 ms.
Product exploration explored 100000 steps with 10402 reset in 477 ms.
Built C files in :
/tmp/ltsmin4174610521028572476
[2025-06-02 21:01:23] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2025-06-02 21:01:23] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:01:23] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2025-06-02 21:01:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:01:23] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2025-06-02 21:01:23] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:01:23] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4174610521028572476
Running compilation step : cd /tmp/ltsmin4174610521028572476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1342 ms.
Running link step : cd /tmp/ltsmin4174610521028572476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4174610521028572476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13693335561841231101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 312/312 transitions.
Applied a total of 0 rules in 15 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2025-06-02 21:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:01:38] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 21:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:01:38] [INFO ] State equation strengthened by 142 read => feed constraints.
[2025-06-02 21:01:39] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:01:39] [INFO ] Redundant transitions in 3 ms returned []
Running 306 sub problems to find dead transitions.
[2025-06-02 21:01:39] [INFO ] Invariant cache hit.
[2025-06-02 21:01:39] [INFO ] State equation strengthened by 142 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 256 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 312/406 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 142/255 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 306/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (OVERLAPS) 1/407 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 562 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60472ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61010 ms. Remains : 95/95 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin10678028782366400901
[2025-06-02 21:02:39] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2025-06-02 21:02:39] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:02:39] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2025-06-02 21:02:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:02:39] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2025-06-02 21:02:39] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:02:39] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10678028782366400901
Running compilation step : cd /tmp/ltsmin10678028782366400901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1339 ms.
Running link step : cd /tmp/ltsmin10678028782366400901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10678028782366400901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18417043055715840908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 21:02:54] [INFO ] Flatten gal took : 52 ms
[2025-06-02 21:02:55] [INFO ] Flatten gal took : 53 ms
[2025-06-02 21:02:55] [INFO ] Time to serialize gal into /tmp/LTL14515177010606933962.gal : 8 ms
[2025-06-02 21:02:55] [INFO ] Time to serialize properties into /tmp/LTL15444030937074901223.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14515177010606933962.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12508693828753975781.hoa' '-atoms' '/tmp/LTL15444030937074901223.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15444030937074901223.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12508693828753975781.hoa
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t33, t35, t38, t42, t45, t58, t70, t73, t74, t78, t82, t83, t105, t1...944
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
[2025-06-02 21:03:10] [INFO ] Flatten gal took : 30 ms
[2025-06-02 21:03:10] [INFO ] Flatten gal took : 36 ms
[2025-06-02 21:03:10] [INFO ] Time to serialize gal into /tmp/LTL8250596448958209837.gal : 5 ms
[2025-06-02 21:03:10] [INFO ] Time to serialize properties into /tmp/LTL3024671967366327118.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8250596448958209837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3024671967366327118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p30!=1)||(p45!=1))||(p87!=1))"))))
Formula 0 simplified : GF!"(((p30!=1)||(p45!=1))||(p87!=1))"
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t33, t35, t38, t42, t45, t58, t70, t73, t74, t78, t82, t83, t105, t1...944
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
[2025-06-02 21:03:25] [INFO ] Flatten gal took : 40 ms
[2025-06-02 21:03:25] [INFO ] Applying decomposition
[2025-06-02 21:03:25] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13545583250721863150.txt' '-o' '/tmp/graph13545583250721863150.bin' '-w' '/tmp/graph13545583250721863150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13545583250721863150.bin' '-l' '-1' '-v' '-w' '/tmp/graph13545583250721863150.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:03:25] [INFO ] Decomposing Gal with order
[2025-06-02 21:03:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:03:25] [INFO ] Removed a total of 629 redundant transitions.
[2025-06-02 21:03:25] [INFO ] Flatten gal took : 139 ms
[2025-06-02 21:03:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 27 ms.
[2025-06-02 21:03:25] [INFO ] Time to serialize gal into /tmp/LTL9951271114407342460.gal : 8 ms
[2025-06-02 21:03:25] [INFO ] Time to serialize properties into /tmp/LTL13185397809731504495.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9951271114407342460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13185397809731504495.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i0.i0.u0.p30!=1)||(i0.i1.u1.p45!=1))||(i0.i0.u7.p87!=1))"))))
Formula 0 simplified : GF!"(((i0.i0.u0.p30!=1)||(i0.i1.u1.p45!=1))||(i0.i0.u7.p87!=1))"
Reverse transition relation is NOT exact ! Due to transitions t318_t46, t13_t53_t101_t102_t103_t107_t54_t55_t56_t60_t14_t15_t16_t20_t59_t21, i0.t378_t147, ...1024
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-22-LTLFireability-06 finished in 262486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 374
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 167 transition count 373
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 163 transition count 361
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 163 transition count 361
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 161 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 161 transition count 355
Applied a total of 27 rules in 7 ms. Remains 161 /174 variables (removed 13) and now considering 355/392 (removed 37) transitions.
// Phase 1: matrix 355 rows 161 cols
[2025-06-02 21:03:40] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:03:40] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 21:03:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:03:41] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2025-06-02 21:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:47] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:48] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:48] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:48] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:56] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:05] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:07] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 193 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/545 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:25] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 354 unsolved
SMT process timed out in 60362ms, After SMT, problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 355/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60791 ms. Remains : 161/174 places, 355/392 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 684 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLFireability-08 finished in 61668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 375
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 167 transition count 374
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 164 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 164 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 163 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 163 transition count 363
Applied a total of 23 rules in 15 ms. Remains 163 /174 variables (removed 11) and now considering 363/392 (removed 29) transitions.
// Phase 1: matrix 363 rows 163 cols
[2025-06-02 21:04:42] [INFO ] Computed 22 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:04:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 21:04:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:04:43] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2025-06-02 21:04:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:50] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:50] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:51] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:51] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:51] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:51] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:52] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:52] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/526 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:02] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 526/526 variables, and 194 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 363/526 variables, 163/194 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 362/556 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:26] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:26] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:26] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:28] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/526 variables, and 560 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60630ms
Starting structural reductions in LTL mode, iteration 1 : 163/174 places, 363/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61215 ms. Remains : 163/174 places, 363/392 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-09
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-09 finished in 61340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 167 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 164 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 164 transition count 367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 162 transition count 361
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 162 transition count 361
Applied a total of 25 rules in 9 ms. Remains 162 /174 variables (removed 12) and now considering 361/392 (removed 31) transitions.
// Phase 1: matrix 361 rows 162 cols
[2025-06-02 21:05:43] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:05:43] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 21:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:05:44] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2025-06-02 21:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:49] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:49] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:49] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:49] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:50] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:50] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:58] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:08] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:10] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 193 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 361/523 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 360/551 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:25] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:42] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:44] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 554 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Starting structural reductions in LTL mode, iteration 1 : 162/174 places, 361/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60994 ms. Remains : 162/174 places, 361/392 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-13 finished in 61153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 392/392 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 167 transition count 374
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 167 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 167 transition count 373
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 163 transition count 361
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 163 transition count 361
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 161 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 161 transition count 355
Applied a total of 27 rules in 10 ms. Remains 161 /174 variables (removed 13) and now considering 355/392 (removed 37) transitions.
// Phase 1: matrix 355 rows 161 cols
[2025-06-02 21:06:44] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:06:45] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 21:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:06:45] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2025-06-02 21:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:53] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:54] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:02] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:11] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 192 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/191 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/545 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:26] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 354 unsolved
SMT process timed out in 60581ms, After SMT, problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Starting structural reductions in LTL mode, iteration 1 : 161/174 places, 355/392 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61187 ms. Remains : 161/174 places, 355/392 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Product exploration explored 100000 steps with 33333 reset in 369 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 683 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLFireability-15 finished in 61992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-06-02 21:07:47] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8148110225777292597
[2025-06-02 21:07:47] [INFO ] Computing symmetric may disable matrix : 392 transitions.
[2025-06-02 21:07:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:47] [INFO ] Computing symmetric may enable matrix : 392 transitions.
[2025-06-02 21:07:47] [INFO ] Applying decomposition
[2025-06-02 21:07:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:47] [INFO ] Flatten gal took : 22 ms
[2025-06-02 21:07:47] [INFO ] Computing Do-Not-Accords matrix : 392 transitions.
[2025-06-02 21:07:47] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:47] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8148110225777292597
Running compilation step : cd /tmp/ltsmin8148110225777292597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12478134747038218995.txt' '-o' '/tmp/graph12478134747038218995.bin' '-w' '/tmp/graph12478134747038218995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12478134747038218995.bin' '-l' '-1' '-v' '-w' '/tmp/graph12478134747038218995.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:07:47] [INFO ] Decomposing Gal with order
[2025-06-02 21:07:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:07:47] [INFO ] Removed a total of 765 redundant transitions.
[2025-06-02 21:07:47] [INFO ] Flatten gal took : 50 ms
[2025-06-02 21:07:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 16 ms.
[2025-06-02 21:07:47] [INFO ] Time to serialize gal into /tmp/LTLFireability11832576958930112301.gal : 6 ms
[2025-06-02 21:07:47] [INFO ] Time to serialize properties into /tmp/LTLFireability8986885614723279579.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11832576958930112301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8986885614723279579.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i0.u2.p30!=1)||(i0.u6.p45!=1))||(i0.u13.p87!=1))"))))
Formula 0 simplified : GF!"(((i0.u2.p30!=1)||(i0.u6.p45!=1))||(i0.u13.p87!=1))"
Compilation finished in 1589 ms.
Running link step : cd /tmp/ltsmin8148110225777292597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8148110225777292597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 50271 ms.
FORMULA MedleyA-PT-22-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 851929 ms.
BK_STOP 1748898519411
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;