About the Execution of ITS-Tools for MedleyA-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 271879.00 | 0.00 | 0.00 | TFTFTTFTFTTFTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100194.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-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100194
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K 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 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 39K 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-13-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-13-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-13-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-13-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-13-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748866626054
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:17:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:17:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:17:08] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-02 12:17:08] [INFO ] Transformed 173 places.
[2025-06-02 12:17:08] [INFO ] Transformed 159 transitions.
[2025-06-02 12:17:08] [INFO ] Found NUPN structural information;
[2025-06-02 12:17:08] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Support contains 102 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 170 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 163 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 163 transition count 152
Applied a total of 17 rules in 37 ms. Remains 163 /173 variables (removed 10) and now considering 152/159 (removed 7) transitions.
// Phase 1: matrix 152 rows 163 cols
[2025-06-02 12:17:08] [INFO ] Computed 18 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:09] [INFO ] Implicit Places using invariants in 348 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/173 places, 152/159 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 458 ms. Remains : 162/173 places, 152/159 transitions.
Support contains 102 out of 162 places after structural reductions.
[2025-06-02 12:17:09] [INFO ] Flatten gal took : 65 ms
[2025-06-02 12:17:09] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:17:09] [INFO ] Input system was already deterministic with 152 transitions.
Reduction of identical properties reduced properties to check from 87 to 86
RANDOM walk for 40000 steps (1142 resets) in 2997 ms. (13 steps per ms) remains 7/86 properties
BEST_FIRST walk for 40002 steps (216 resets) in 379 ms. (105 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (284 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (279 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (302 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (298 resets) in 230 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (276 resets) in 94 ms. (421 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (292 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
// Phase 1: matrix 152 rows 162 cols
[2025-06-02 12:17:10] [INFO ] Computed 17 invariants in 11 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 59/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 33/111 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 6 (OVERLAPS) 51/162 variables, 7/17 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:11] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 152/314 variables, 162/180 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:11] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 2/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/314 variables, 0/182 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 182 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 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: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/103 variables, 6/10 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/12 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 59/162 variables, 7/19 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/20 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 152/314 variables, 162/184 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 2/186 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:17:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 1/187 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/187 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/314 variables, 0/187 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 187 constraints, problems are : Problem set: 4 solved, 2 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2093ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 1 properties in 72 ms.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 161 transition count 123
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 132 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 131 transition count 121
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 62 place count 131 transition count 94
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 117 place count 103 transition count 94
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 102 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 101 transition count 93
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 130 place count 91 transition count 83
Iterating global reduction 5 with 10 rules applied. Total rules applied 140 place count 91 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 140 place count 91 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 150 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 85 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 84 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 83 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 83 transition count 75
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 202 place count 60 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 218 place count 52 transition count 68
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 219 place count 52 transition count 67
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 52 transition count 62
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 229 place count 47 transition count 62
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 232 place count 47 transition count 59
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 236 place count 44 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 247 place count 44 transition count 47
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 248 place count 43 transition count 46
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 43 transition count 46
Applied a total of 249 rules in 96 ms. Remains 43 /162 variables (removed 119) and now considering 46/152 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 43/162 places, 46/152 transitions.
RANDOM walk for 40000 steps (5840 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (4000 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 351 steps, run visited all 1 properties in 11 ms. (steps per millisecond=31 )
Probabilistic random walk after 351 steps, saw 140 distinct states, run finished after 18 ms. (steps per millisecond=19 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-13-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:17:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-13-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:17:13] [INFO ] Input system was already deterministic with 152 transitions.
Support contains 94 out of 162 places (down from 97) after GAL structural reductions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 160 transition count 120
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 129 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 128 transition count 118
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 66 place count 128 transition count 91
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 121 place count 100 transition count 91
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 99 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 98 transition count 90
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 134 place count 88 transition count 80
Iterating global reduction 5 with 10 rules applied. Total rules applied 144 place count 88 transition count 80
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 144 place count 88 transition count 75
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 154 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 82 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 82 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 81 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 81 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 80 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 80 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 200 place count 60 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 59 transition count 51
Applied a total of 201 rules in 43 ms. Remains 59 /162 variables (removed 103) and now considering 51/152 (removed 101) transitions.
// Phase 1: matrix 51 rows 59 cols
[2025-06-02 12:17:13] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:13] [INFO ] Implicit Places using invariants in 86 ms returned [0, 10, 29, 31, 33, 37]
[2025-06-02 12:17:13] [INFO ] Actually due to overlaps returned [0, 33, 10, 37]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 88 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/162 places, 51/152 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 55 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 53 transition count 49
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 53 transition count 47
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 51 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 50 transition count 46
Applied a total of 10 rules in 8 ms. Remains 50 /55 variables (removed 5) and now considering 46/51 (removed 5) transitions.
// Phase 1: matrix 46 rows 50 cols
[2025-06-02 12:17:13] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:13] [INFO ] Implicit Places using invariants in 57 ms returned [24, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/162 places, 46/152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 47 transition count 44
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 4 place count 46 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 45 transition count 43
Applied a total of 6 rules in 8 ms. Remains 45 /48 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 45 cols
[2025-06-02 12:17:13] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 12:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:13] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 45/162 places, 43/152 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 334 ms. Remains : 45/162 places, 43/152 transitions.
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:17:13] [INFO ] Input system was already deterministic with 43 transitions.
RANDOM walk for 200 steps (20 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-13-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:17:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:17:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7496269288796247097.gal : 1 ms
[2025-06-02 12:17:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4304822535764613067.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7496269288796247097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4304822535764613067.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 139
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 145 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Applied a total of 37 rules in 16 ms. Remains 143 /162 variables (removed 19) and now considering 134/152 (removed 18) transitions.
// Phase 1: matrix 134 rows 143 cols
[2025-06-02 12:17:13] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:13] [INFO ] Implicit Places using invariants in 111 ms returned [30, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/162 places, 134/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 141 /141 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 141/162 places, 134/152 transitions.
[2025-06-02 12:17:14] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:17:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:17:14] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:17:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:17:14] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:17:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4209860517553060602.gal : 5 ms
[2025-06-02 12:17:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6687282076069810440.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4209860517553060602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6687282076069810440.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37884e+06,0.285755,9944,2,2198,5,19470,6,0,700,30580,0
Converting to forward existential form...Done !
original formula: (E(!(((E((p35==1) U (p42==1)) + AX((p35==1))) * !(EF((p53==1))))) U !(E(EF(AG((p100==1))) U !(EF((p132==1)))))) + AF((EG(AX(((p69==1)&&(p...186
=> equivalent forward existential formula: [FwdG((Init * !(E(!(((E((p35==1) U (p42==1)) + !(EX(!((p35==1))))) * !(E(TRUE U (p53==1))))) U !(E(E(TRUE U !(E(...282
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t63, t74, t77, t81, t87, Intersection with reachable ...226
Using saturation style SCC detection
(forward)formula 0,1,5.1741,135804,1,0,521,763409,323,221,4151,635126,625
FORMULA MedleyA-PT-13-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 147 transition count 138
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 147 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 144 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 142 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 142 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 141 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 141 transition count 132
Applied a total of 41 rules in 37 ms. Remains 141 /162 variables (removed 21) and now considering 132/152 (removed 20) transitions.
// Phase 1: matrix 132 rows 141 cols
[2025-06-02 12:17:19] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:19] [INFO ] Implicit Places using invariants in 169 ms returned [30, 73]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 170 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/162 places, 132/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 139/162 places, 132/152 transitions.
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:17:19] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:17:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17974103756191359973.gal : 4 ms
[2025-06-02 12:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability3761799832912476017.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17974103756191359973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3761799832912476017.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.285717,9688,2,2148,5,19161,6,0,690,29724,0
Converting to forward existential form...Done !
original formula: AF((EF((p94==1)) * EG(AX((p74==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p94==1)) * EG(!(EX(!((p74==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t60, t61, t63, t73, t76, t86, Intersection with reach...231
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:17:49] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:17:49] [INFO ] Applying decomposition
[2025-06-02 12:17:49] [INFO ] Flatten gal took : 19 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/graph3630014984966195184.txt' '-o' '/tmp/graph3630014984966195184.bin' '-w' '/tmp/graph3630014984966195184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3630014984966195184.bin' '-l' '-1' '-v' '-w' '/tmp/graph3630014984966195184.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:17:49] [INFO ] Decomposing Gal with order
[2025-06-02 12:17:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:17:49] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-02 12:17:49] [INFO ] Flatten gal took : 65 ms
[2025-06-02 12:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-02 12:17:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9771528672113798173.gal : 6 ms
[2025-06-02 12:17:49] [INFO ] Time to serialize properties into /tmp/CTLFireability246347899170373927.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9771528672113798173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability246347899170373927.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.31837e+06,0.060053,5712,356,26,3304,210,411,4172,51,380,0
Converting to forward existential form...Done !
original formula: AF((EF((i5.i0.u14.p94==1)) * EG(AX((i8.u23.p74==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (i5.i0.u14.p94==1)) * EG(!(EX(!((i8.u23.p74==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t36, i1.i0.u0.t86, i4.t73, i4.i1.u16.t76, i4.i2.u29.t48, i5.i0.u38.t34, i6.i0.t61, i...322
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.51497,60368,1,0,120751,370,2416,157384,245,775,204666
FORMULA MedleyA-PT-13-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 152 transition count 142
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 152 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 150 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 150 transition count 140
Applied a total of 24 rules in 10 ms. Remains 150 /162 variables (removed 12) and now considering 140/152 (removed 12) transitions.
// Phase 1: matrix 140 rows 150 cols
[2025-06-02 12:17:51] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:17:51] [INFO ] Implicit Places using invariants in 246 ms returned [32, 81]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 248 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/162 places, 140/152 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 148/162 places, 140/152 transitions.
[2025-06-02 12:17:51] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:17:51] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:17:51] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-02 12:17:51] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:17:51] [INFO ] Flatten gal took : 10 ms
[2025-06-02 12:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14371888908303461609.gal : 3 ms
[2025-06-02 12:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6639350516100354530.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14371888908303461609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6639350516100354530.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.68277e+06,0.410323,11912,2,3363,5,24562,6,0,734,40472,0
Converting to forward existential form...Done !
original formula: AF((EF(AX(((p65==1) + AF((p159==1))))) + AG(((E((p8==1) U (p25==1)) + EF(((p27==1)&&(p143==1)))) + ((((p16==0)||(p154==0))||(p128==0)) * ...172
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(((p65==1) + !(EG(!((p159==1))))))))) + !(E(TRUE U !(((E((p8==1) U (p25==1)) + E(TR...253
Reverse transition relation is NOT exact ! Due to transitions t3, t17, t20, t28, t35, t37, t44, t49, t51, t55, t56, t59, t64, t67, t68, t74, t78, t81, t91,...256
Detected timeout of ITS tools.
[2025-06-02 12:18:21] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:21] [INFO ] Applying decomposition
[2025-06-02 12:18:21] [INFO ] Flatten gal took : 6 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/graph10106378396638780233.txt' '-o' '/tmp/graph10106378396638780233.bin' '-w' '/tmp/graph10106378396638780233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10106378396638780233.bin' '-l' '-1' '-v' '-w' '/tmp/graph10106378396638780233.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:18:21] [INFO ] Decomposing Gal with order
[2025-06-02 12:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:18:21] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:18:21] [INFO ] Flatten gal took : 19 ms
[2025-06-02 12:18:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 12:18:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15082764050257727703.gal : 7 ms
[2025-06-02 12:18:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12474500539661696334.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15082764050257727703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12474500539661696334.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.68277e+06,0.093048,6124,483,38,4274,270,453,5563,55,650,0
Converting to forward existential form...Done !
original formula: AF((EF(AX(((i2.i1.u19.p65==1) + AF((i8.u53.p159==1))))) + AG(((E((i0.u2.p8==1) U (i3.i1.u16.p25==1)) + EF(((i1.i1.u6.p27==1)&&(i1.i0.u50....260
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U !(EX(!(((i2.i1.u19.p65==1) + !(EG(!((i8.u53.p159==1))))))))) + !(E(TRUE U !(((E((i0.u2.p8...341
Reverse transition relation is NOT exact ! Due to transitions t3, t81, i1.i0.u50.t17, i2.t78, i2.i1.u19.t64, i2.i1.u19.t67, i3.i0.u0.t91, i3.i1.u16.t68, i3...391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,2.43555,73708,1,0,128154,383,2655,214893,251,900,215295
FORMULA MedleyA-PT-13-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 149 transition count 140
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 146 transition count 137
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 146 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 145 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Applied a total of 37 rules in 15 ms. Remains 143 /162 variables (removed 19) and now considering 134/152 (removed 18) transitions.
// Phase 1: matrix 134 rows 143 cols
[2025-06-02 12:18:24] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:24] [INFO ] Implicit Places using invariants in 107 ms returned [31, 75]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/162 places, 134/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 141/162 places, 134/152 transitions.
[2025-06-02 12:18:24] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:18:24] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:24] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:18:24] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:24] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14763766677246778426.gal : 1 ms
[2025-06-02 12:18:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17545032106616846292.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14763766677246778426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17545032106616846292.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43392e+06,0.275779,9852,2,2166,5,19283,6,0,700,30143,0
Converting to forward existential form...Done !
original formula: AX(!(A(((EG((p53==1)) * AX((p109==1))) * (p121!=1)) U (AF((p84==1)) + (p2==1)))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((!(EG(!((p84==1)))) + (p2==1)))))) * !(E(!((!(EG(!((p84==1)))) + (p2==1))) U (!(((EG((p53==...244
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t60, t61, t63, t74, t77, t81, t87, Intersection with ...236
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:18:54] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:18:54] [INFO ] Applying decomposition
[2025-06-02 12:18:54] [INFO ] Flatten gal took : 5 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/graph8128450304687300652.txt' '-o' '/tmp/graph8128450304687300652.bin' '-w' '/tmp/graph8128450304687300652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8128450304687300652.bin' '-l' '-1' '-v' '-w' '/tmp/graph8128450304687300652.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:18:54] [INFO ] Decomposing Gal with order
[2025-06-02 12:18:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:18:54] [INFO ] Removed a total of 24 redundant transitions.
[2025-06-02 12:18:54] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:18:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-02 12:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12663745769973671080.gal : 6 ms
[2025-06-02 12:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4915941855520187450.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12663745769973671080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4915941855520187450.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43392e+06,0.053074,5348,325,16,2788,154,414,3267,31,322,0
Converting to forward existential form...Done !
original formula: AX(!(A(((EG((i3.i1.u17.p53==1)) * AX((i5.i2.u36.p109==1))) * (i7.i0.u42.p121!=1)) U (AF((i4.i1.u27.p84==1)) + (i0.i0.u3.p2==1)))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((!(EG(!((i4.i1.u27.p84==1)))) + (i0.i0.u3.p2==1)))))) * !(E(!((!(EG(!((i4.i1.u27.p84==1))))...331
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t36, t77, i0.i1.u0.t87, i2.i0.t74, i2.i1.u20.t63, i3.i0.u16.t81, i4.i0.t61, i4.i0.u2...330
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.45587,50788,1,0,95503,154,2490,147764,161,322,156060
FORMULA MedleyA-PT-13-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 139
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 145 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 142 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 142 transition count 133
Applied a total of 39 rules in 13 ms. Remains 142 /162 variables (removed 20) and now considering 133/152 (removed 19) transitions.
// Phase 1: matrix 133 rows 142 cols
[2025-06-02 12:18:56] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:18:56] [INFO ] Implicit Places using invariants in 232 ms returned [30, 73]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/162 places, 133/152 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 140/162 places, 133/152 transitions.
[2025-06-02 12:18:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:56] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-02 12:18:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8569302863049835881.gal : 2 ms
[2025-06-02 12:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9066063164346225871.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8569302863049835881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9066063164346225871.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41041e+06,0.247486,9320,2,2418,5,18298,6,0,695,26255,0
Converting to forward existential form...Done !
original formula: EF(AG(A(((p51==1) * (A((p156==1) U (p36==1)) + EX((p79==1)))) U ((p118==1)&&(p130==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(((p118==1)&&(p130==1))) U (!(((p51==1) * (!((E(!((p36==1)) U (!((p156==1...289
Reverse transition relation is NOT exact ! Due to transitions t4, t18, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t74, t77, t87, Intersection with ...236
Detected timeout of ITS tools.
[2025-06-02 12:19:26] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:26] [INFO ] Applying decomposition
[2025-06-02 12:19:26] [INFO ] Flatten gal took : 5 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/graph14676635865577246360.txt' '-o' '/tmp/graph14676635865577246360.bin' '-w' '/tmp/graph14676635865577246360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14676635865577246360.bin' '-l' '-1' '-v' '-w' '/tmp/graph14676635865577246360.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:19:26] [INFO ] Decomposing Gal with order
[2025-06-02 12:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:19:26] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-02 12:19:26] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 12:19:26] [INFO ] Time to serialize gal into /tmp/CTLFireability4766018446435299176.gal : 4 ms
[2025-06-02 12:19:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5718959049997898937.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4766018446435299176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5718959049997898937.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41041e+06,0.072306,5948,407,34,3721,220,407,5432,53,458,0
Converting to forward existential form...Done !
original formula: EF(AG(A(((i3.u5.p51==1) * (A((i10.u54.p156==1) U (i5.i0.u11.p36==1)) + EX((i6.i1.u28.p79==1)))) U ((i9.i1.u41.p118==1)&&(i9.i0.u46.p130==...161
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(((i9.i1.u41.p118==1)&&(i9.i0.u46.p130==1))) U (!(((i3.u5.p51==1) * (!((E...403
Reverse transition relation is NOT exact ! Due to transitions t20, t37, t77, i1.i0.u0.t87, i4.u51.t18, i5.i0.t74, i5.i1.u20.t64, i5.i1.u30.t49, i6.i0.t62, ...338
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,1.44691,49852,1,0,95025,385,2379,125765,247,946,154390
FORMULA MedleyA-PT-13-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 147 transition count 138
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 147 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 144 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 142 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 142 transition count 133
Applied a total of 39 rules in 11 ms. Remains 142 /162 variables (removed 20) and now considering 133/152 (removed 19) transitions.
// Phase 1: matrix 133 rows 142 cols
[2025-06-02 12:19:28] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:28] [INFO ] Implicit Places using invariants in 112 ms returned [30, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/162 places, 133/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 140/162 places, 133/152 transitions.
[2025-06-02 12:19:28] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:28] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:28] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-02 12:19:28] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:28] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:28] [INFO ] Time to serialize gal into /tmp/CTLFireability570957309847246158.gal : 1 ms
[2025-06-02 12:19:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11533841473798494097.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability570957309847246158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11533841473798494097.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33359e+06,0.292462,9844,2,2185,5,19363,6,0,695,30172,0
Converting to forward existential form...Done !
original formula: EG(A(!(EG(AX((p136==1)))) U ((!(EX(((p118==1)&&(p130==1)))) + !(EF(((p69==1)&&(p85==1))))) + AF(((p151==1)&&(p171==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((!(EX(((p118==1)&&(p130==1)))) + !(E(TRUE U ((p69==1)&&(p85==1))))) + !(EG(!(((p151==1)&&(p17...438
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t54, t57, t63, t73, t76, t86, Intersection with reachable at ea...221
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,24.045,580156,1,0,1358,3.70355e+06,309,602,4323,3.34029e+06,1620
FORMULA MedleyA-PT-13-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 160 transition count 127
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 136 transition count 121
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 63 place count 130 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 129 transition count 119
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 64 place count 129 transition count 94
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 114 place count 104 transition count 94
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 102 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 101 transition count 93
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 128 place count 91 transition count 83
Iterating global reduction 6 with 10 rules applied. Total rules applied 138 place count 91 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 138 place count 91 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 146 place count 87 transition count 79
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 147 place count 86 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 149 place count 85 transition count 77
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 84 transition count 76
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 84 transition count 76
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 188 place count 66 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 65 transition count 57
Applied a total of 189 rules in 33 ms. Remains 65 /162 variables (removed 97) and now considering 57/152 (removed 95) transitions.
// Phase 1: matrix 57 rows 65 cols
[2025-06-02 12:19:52] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:52] [INFO ] Implicit Places using invariants in 68 ms returned [0, 11, 16, 29, 31, 33]
[2025-06-02 12:19:52] [INFO ] Actually due to overlaps returned [0, 33, 11, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/162 places, 57/152 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 61 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 59 transition count 55
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 59 transition count 53
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 57 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 56 transition count 52
Applied a total of 10 rules in 6 ms. Remains 56 /61 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 56 cols
[2025-06-02 12:19:52] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:52] [INFO ] Implicit Places using invariants in 55 ms returned [23, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/162 places, 52/152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 53 transition count 50
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 4 place count 52 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 51 transition count 49
Applied a total of 6 rules in 8 ms. Remains 51 /54 variables (removed 3) and now considering 49/52 (removed 3) transitions.
// Phase 1: matrix 49 rows 51 cols
[2025-06-02 12:19:52] [INFO ] Computed 8 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 12:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:52] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 51/162 places, 49/152 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 328 ms. Remains : 51/162 places, 49/152 transitions.
[2025-06-02 12:19:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:52] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:19:52] [INFO ] Input system was already deterministic with 49 transitions.
[2025-06-02 12:19:52] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:19:52] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16562233141270119168.gal : 0 ms
[2025-06-02 12:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16812884857105894547.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16562233141270119168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16812884857105894547.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5436,0.015884,4164,2,196,5,1548,6,0,255,1892,0
Converting to forward existential form...Done !
original formula: (EG(AF(((p79==0)&&(p150==0)))) + AG((((!(E((p114==1) U (p83==1))) + (p172==1)) + (p8==1)) * (p143==1))))
=> equivalent forward existential formula: ([(FwdU(((FwdU((Init * !(EG(!(EG(!(((p79==0)&&(p150==0)))))))),TRUE) * !((p8==1))) * !((p172==1))),(p114==1)) * ...262
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t13, t28, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,1,0.430918,15428,1,0,297,63607,140,138,1522,72756,353
FORMULA MedleyA-PT-13-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 147 transition count 138
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 147 transition count 138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 145 transition count 136
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 142 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 142 transition count 133
Applied a total of 39 rules in 13 ms. Remains 142 /162 variables (removed 20) and now considering 133/152 (removed 19) transitions.
// Phase 1: matrix 133 rows 142 cols
[2025-06-02 12:19:53] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:53] [INFO ] Implicit Places using invariants in 156 ms returned [31, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 157 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/162 places, 133/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 140/162 places, 133/152 transitions.
[2025-06-02 12:19:53] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:19:53] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:19:53] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-02 12:19:53] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:19:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:19:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10154660804088638550.gal : 1 ms
[2025-06-02 12:19:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10751133067668281720.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10154660804088638550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10751133067668281720.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.35851e+06,0.260743,9960,2,2195,5,19473,6,0,695,31168,0
Converting to forward existential form...Done !
original formula: EX((AX(EG(((p143==1) * AX((p136==1))))) + EG((p38==0))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(EG(((p143==1) * !(EX(!((p136==1))))))))))] != FALSE + [FwdG(EY(Init),(p38==0))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t36, t43, t48, t49, t54, t57, t60, t61, t63, t68, t75, t77, t87, Intersection ...241
Hit Full ! (commute/partial/dont) 131/0/2
(forward)formula 0,1,2.03438,54576,1,0,359,211152,299,135,3955,237828,396
FORMULA MedleyA-PT-13-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 150 transition count 141
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 150 transition count 141
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 149 transition count 140
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 149 transition count 140
Applied a total of 25 rules in 6 ms. Remains 149 /162 variables (removed 13) and now considering 140/152 (removed 12) transitions.
// Phase 1: matrix 140 rows 149 cols
[2025-06-02 12:19:55] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:19:55] [INFO ] Implicit Places using invariants in 114 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/162 places, 140/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 148/162 places, 140/152 transitions.
[2025-06-02 12:19:55] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:19:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:55] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-02 12:19:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:19:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8583535192257674228.gal : 0 ms
[2025-06-02 12:19:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16820291291107770501.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8583535192257674228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16820291291107770501.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.20307e+06,0.233929,11320,2,2802,5,22470,6,0,734,37531,0
Converting to forward existential form...Done !
original formula: ((A((EF(((p39==1)&&(p61==1))) * A((p18==1) U (p21==1))) U (A((p105==1) U (p123==1)) + AX((p127==1)))) + EG(((p79==0) + EF(((p155==1)&&(p1...270
=> equivalent forward existential formula: [FwdG((Init * !((!((E(!((!((E(!((p123==1)) U (!((p105==1)) * !((p123==1)))) + EG(!((p123==1))))) + !(EX(!((p127=...653
Reverse transition relation is NOT exact ! Due to transitions t3, t18, t20, t35, t38, t42, t50, t51, t56, t59, t66, t68, t72, t80, t81, t91, Intersection ...241
Detected timeout of ITS tools.
[2025-06-02 12:20:25] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:25] [INFO ] Applying decomposition
[2025-06-02 12:20:25] [INFO ] Flatten gal took : 4 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/graph14862967145660114016.txt' '-o' '/tmp/graph14862967145660114016.bin' '-w' '/tmp/graph14862967145660114016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14862967145660114016.bin' '-l' '-1' '-v' '-w' '/tmp/graph14862967145660114016.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:20:25] [INFO ] Decomposing Gal with order
[2025-06-02 12:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:20:25] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-02 12:20:25] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 12:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1685807321593520016.gal : 4 ms
[2025-06-02 12:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8596623928454306199.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1685807321593520016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8596623928454306199.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.20307e+06,0.076257,5968,441,33,4020,210,435,4836,58,561,0
Converting to forward existential form...Done !
original formula: ((A((EF(((i1.u20.p39==1)&&(i5.u21.p61==1))) * A((i4.i1.u5.p18==1) U (i1.u6.p21==1))) U (A((i6.i1.u37.p105==1) U (i8.i1.u44.p123==1)) + AX...413
=> equivalent forward existential formula: [FwdG((Init * !((!((E(!((!((E(!((i8.i1.u44.p123==1)) U (!((i6.i1.u37.p105==1)) * !((i8.i1.u44.p123==1)))) + EG(!...928
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t51, i1.t72, i1.u6.t80, i1.u20.t66, i2.u51.t18, i4.t68, i4.i0.t81, i5.t56, i5.u30.t5...328
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,6.83852,185552,1,0,324910,500,2783,477774,297,1323,485373
FORMULA MedleyA-PT-13-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 160 transition count 121
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 130 transition count 119
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 129 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 128 transition count 118
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 66 place count 128 transition count 92
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 119 place count 101 transition count 92
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 100 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 99 transition count 91
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 132 place count 89 transition count 81
Iterating global reduction 6 with 10 rules applied. Total rules applied 142 place count 89 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 142 place count 89 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 152 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 153 place count 83 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 155 place count 82 transition count 74
Iterating global reduction 6 with 1 rules applied. Total rules applied 156 place count 82 transition count 74
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 157 place count 81 transition count 73
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 81 transition count 73
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 198 place count 61 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 60 transition count 52
Applied a total of 199 rules in 19 ms. Remains 60 /162 variables (removed 102) and now considering 52/152 (removed 100) transitions.
// Phase 1: matrix 52 rows 60 cols
[2025-06-02 12:20:32] [INFO ] Computed 14 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:32] [INFO ] Implicit Places using invariants in 88 ms returned [0, 10, 15, 27, 33, 37]
[2025-06-02 12:20:32] [INFO ] Actually due to overlaps returned [0, 33, 10, 15, 37]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 89 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/162 places, 52/152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 55 transition count 49
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 52 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 51 transition count 48
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 51 transition count 45
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 48 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 47 transition count 44
Applied a total of 16 rules in 5 ms. Remains 47 /55 variables (removed 8) and now considering 44/52 (removed 8) transitions.
// Phase 1: matrix 44 rows 47 cols
[2025-06-02 12:20:32] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:33] [INFO ] Implicit Places using invariants in 52 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/162 places, 44/152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 43
Applied a total of 2 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 43/44 (removed 1) transitions.
// Phase 1: matrix 43 rows 45 cols
[2025-06-02 12:20:33] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 12:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:33] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 45/162 places, 43/152 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 305 ms. Remains : 45/162 places, 43/152 transitions.
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 1 ms
[2025-06-02 12:20:33] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 2 ms
[2025-06-02 12:20:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5565729692073377868.gal : 1 ms
[2025-06-02 12:20:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9096655165363925144.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5565729692073377868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9096655165363925144.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1524,0.012814,4072,2,159,5,729,6,0,226,539,0
Converting to forward existential form...Done !
original formula: EG(((p45==0)||(p95==0)))
=> equivalent forward existential formula: [FwdG(Init,((p45==0)||(p95==0)))] != FALSE
Hit Full ! (commute/partial/dont) 40/0/3
(forward)formula 0,1,0.03377,4712,1,0,10,4307,19,4,1112,2841,8
FORMULA MedleyA-PT-13-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 150 transition count 140
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 150 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 149 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 149 transition count 139
Applied a total of 26 rules in 4 ms. Remains 149 /162 variables (removed 13) and now considering 139/152 (removed 13) transitions.
// Phase 1: matrix 139 rows 149 cols
[2025-06-02 12:20:33] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:33] [INFO ] Implicit Places using invariants in 98 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 148/162 places, 139/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 148/162 places, 139/152 transitions.
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:33] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:33] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:20:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1019728120356709452.gal : 1 ms
[2025-06-02 12:20:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12782203394984448121.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1019728120356709452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12782203394984448121.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91441e+06,0.260226,11196,2,3134,5,22238,6,0,733,36174,0
Converting to forward existential form...Done !
original formula: A((!((!(((p73==1)&&(p85==1))) * AG((((p97==1)&&(p103==1))||(p22!=1))))) + !(((p56==1) * EF(((((p39==1)&&(p61==1))&&(p162==1)) + EG(((p39=...562
=> equivalent forward existential formula: [((Init * !(EG(!((((E((E((p55==1) U ((p93==1)&&(p110==1))) + (p54!=1)) U (EG((p72==1)) * !(EX(!(((p120==1)&&(p13...1684
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t10, t20, t35, t38, t42, t50, t51, t56, t59, t66, t68, t71, t78, t80, t90, t111, t114...257
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 12:21:03] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:21:03] [INFO ] Applying decomposition
[2025-06-02 12:21:03] [INFO ] Flatten gal took : 3 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/graph13100070208080138002.txt' '-o' '/tmp/graph13100070208080138002.bin' '-w' '/tmp/graph13100070208080138002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13100070208080138002.bin' '-l' '-1' '-v' '-w' '/tmp/graph13100070208080138002.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:21:03] [INFO ] Decomposing Gal with order
[2025-06-02 12:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:21:03] [INFO ] Removed a total of 26 redundant transitions.
[2025-06-02 12:21:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-02 12:21:03] [INFO ] Time to serialize gal into /tmp/CTLFireability663133233070405740.gal : 3 ms
[2025-06-02 12:21:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9051202130194404092.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability663133233070405740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9051202130194404092.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91441e+06,0.061552,5736,435,31,3334,267,447,3865,56,515,0
Converting to forward existential form...Done !
original formula: A((!((!(((i7.i1.u25.p73==1)&&(i5.u29.p85==1))) * AG((((i6.i1.u32.p97==1)&&(i6.i2.u35.p103==1))||(i3.i1.u12.p22!=1))))) + !(((i7.i0.u18.p5...882
=> equivalent forward existential formula: [((Init * !(EG(!((((E((E((i7.i0.u53.p55==1) U ((i8.i0.u14.p93==1)&&(i6.i1.u34.p110==1))) + (i1.i0.u17.p54!=1)) U...2488
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t51, t80, t111, t114, i1.t68, i3.t78, i3.i0.u7.t71, i4.u1.t90, i5.t56, i5.u26.t59, i...350
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.28814,160488,1,0,302953,419,2812,427356,286,933,488290
FORMULA MedleyA-PT-13-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 139
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 145 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 144 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 143 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 143 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 142 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 142 transition count 133
Applied a total of 39 rules in 7 ms. Remains 142 /162 variables (removed 20) and now considering 133/152 (removed 19) transitions.
// Phase 1: matrix 133 rows 142 cols
[2025-06-02 12:21:08] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:08] [INFO ] Implicit Places using invariants in 98 ms returned [30, 73]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/162 places, 133/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 140/162 places, 133/152 transitions.
[2025-06-02 12:21:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:21:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:21:08] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-02 12:21:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:21:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:21:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16804072949316728003.gal : 0 ms
[2025-06-02 12:21:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3015372920494389871.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16804072949316728003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3015372920494389871.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.59178e+06,0.242498,10472,2,2749,5,20702,6,0,695,34393,0
Converting to forward existential form...Done !
original formula: A(E(((p155==1)&&(p163==1)) U !(((p1==1)&&(p17==1)))) U EF((((AG(((p118==1)&&(p130==1))) + AX((((p114==1)&&(p10==1))&&(p165==1)))) + (E(((...253
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (((!(E(TRUE U !(((p118==1)&&(p130==1))))) + !(EX(!((((p114==1)&&(p10==1))&&(p165==1)))...760
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t7, t18, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t66, t74, t77, t87, t107, ...261
(forward)formula 0,1,12.1201,317492,1,0,808,1.89347e+06,307,357,3948,1.85892e+06,853
FORMULA MedleyA-PT-13-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 152/152 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 152
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 139
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 145 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 145 transition count 136
Applied a total of 33 rules in 5 ms. Remains 145 /162 variables (removed 17) and now considering 136/152 (removed 16) transitions.
// Phase 1: matrix 136 rows 145 cols
[2025-06-02 12:21:21] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:21] [INFO ] Implicit Places using invariants in 115 ms returned [30, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/162 places, 136/152 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 143/162 places, 136/152 transitions.
[2025-06-02 12:21:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:21:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:21:21] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-02 12:21:21] [INFO ] Flatten gal took : 3 ms
[2025-06-02 12:21:21] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:21:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10603880273944898771.gal : 1 ms
[2025-06-02 12:21:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14190043391193181632.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10603880273944898771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14190043391193181632.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54196e+06,0.180266,10148,2,2317,5,20184,6,0,710,31848,0
Converting to forward existential form...Done !
original formula: (A((EF(((p62==1)&&(p77==1))) * E(EF((p94!=1)) U (EG((p32==1)) * !(((p28==1)||(p127==1)))))) U (p50==1)) * AX(EF(EX(A((p152==1) U (p101==1...161
=> equivalent forward existential formula: ((([((FwdU(Init,!((p50==1))) * !((p50==1))) * !(E(TRUE U ((p62==1)&&(p77==1)))))] = FALSE * [((FwdU(Init,!((p50=...408
Reverse transition relation is NOT exact ! Due to transitions t3, t19, t34, t37, t41, t49, t55, t58, t65, t75, t78, t88, Intersection with reachable at ea...221
Hit Full ! (commute/partial/dont) 133/0/3
(forward)formula 0,0,16.3683,480196,1,0,1145,3.02196e+06,313,478,4235,3.03099e+06,1318
FORMULA MedleyA-PT-13-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 12:21:37] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:21:37] [INFO ] Flatten gal took : 3 ms
Total runtime 269741 ms.
BK_STOP 1748866897933
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-13.tgz
mv MedleyA-PT-13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;