About the Execution of ITS-Tools for MedleyA-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 985720.00 | 0.00 | 0.00 | FTTTTFTFTTTTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100170.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 107K 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-10-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-10-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748856110343
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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 09:21:52] [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 09:21:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:21:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-06-02 09:21:52] [INFO ] Transformed 149 places.
[2025-06-02 09:21:52] [INFO ] Transformed 340 transitions.
[2025-06-02 09:21:52] [INFO ] Found NUPN structural information;
[2025-06-02 09:21:53] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 72 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 122 transition count 315
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 122 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 122 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 118 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 118 transition count 310
Applied a total of 60 rules in 117 ms. Remains 118 /149 variables (removed 31) and now considering 310/340 (removed 30) transitions.
// Phase 1: matrix 310 rows 118 cols
[2025-06-02 09:21:53] [INFO ] Computed 10 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:21:53] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-02 09:21:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:21:54] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 09:21:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/118 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:00] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:00] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:01] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:01] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:01] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:01] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:02] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 12/22 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:05] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:05] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:05] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:06] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:06] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:06] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:06] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 7/29 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/29 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 310/428 variables, 118/147 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:13] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:13] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/149 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:15] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:16] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:16] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:17] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:17] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:17] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 6/155 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:22] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:23] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 157 constraints, problems are : Problem set: 64 solved, 245 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 27/37 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/37 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 310/428 variables, 118/155 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 245/400 constraints. Problems are: Problem set: 64 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 2/402 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:43] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:43] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 2/404 constraints. Problems are: Problem set: 64 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 404 constraints, problems are : Problem set: 64 solved, 245 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 245/309 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60826ms problems are : Problem set: 64 solved, 245 unsolved
Search for dead transitions found 64 dead transitions in 60863ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 118/149 places, 246/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61849 ms. Remains : 118/149 places, 246/340 transitions.
Support contains 72 out of 118 places after structural reductions.
[2025-06-02 09:22:55] [INFO ] Flatten gal took : 111 ms
[2025-06-02 09:22:55] [INFO ] Flatten gal took : 59 ms
[2025-06-02 09:22:55] [INFO ] Input system was already deterministic with 246 transitions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (1736 resets) in 3687 ms. (10 steps per ms) remains 52/74 properties
BEST_FIRST walk for 4003 steps (42 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (38 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (43 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (41 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (38 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (38 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (39 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (37 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (44 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (44 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (42 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (41 resets) in 64 ms. (61 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (41 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (40 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (41 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (32 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (43 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
// Phase 1: matrix 246 rows 118 cols
[2025-06-02 09:22:57] [INFO ] Computed 10 invariants in 10 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/87 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 47 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 3 (OVERLAPS) 21/108 variables, 6/10 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:58] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:58] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:58] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:58] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 4/14 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:59] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:59] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/16 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:59] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/17 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 239/347 variables, 108/125 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:00] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/126 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:01] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 1/127 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/127 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 11/358 variables, 7/134 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/364 variables, and 134 constraints, problems are : Problem set: 9 solved, 43 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/118 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 43 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/87 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 21/108 variables, 6/10 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 8/18 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:03] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:03] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:03] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/21 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:03] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/22 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/22 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 239/347 variables, 108/130 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 18/148 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:04] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:04] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:05] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 3/151 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:05] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 15 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/152 constraints. Problems are: Problem set: 12 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/153 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/364 variables, and 153 constraints, problems are : Problem set: 12 solved, 40 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/118 constraints, PredecessorRefiner: 18/52 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 10173ms problems are : Problem set: 12 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 117 transition count 240
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 113 transition count 240
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 113 transition count 235
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 108 transition count 235
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 101 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 101 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 101 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 99 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 97 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 82 place count 97 transition count 210
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 95 transition count 208
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 95 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 94 transition count 207
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 89 place count 94 transition count 206
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 94 place count 94 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 93 transition count 205
Applied a total of 95 rules in 160 ms. Remains 93 /118 variables (removed 25) and now considering 205/246 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 93/118 places, 205/246 transitions.
RANDOM walk for 40000 steps (2455 resets) in 754 ms. (52 steps per ms) remains 30/40 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (49 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (50 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (52 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (49 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (50 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (55 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (34 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (51 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (35 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (52 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (52 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (41 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (54 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (49 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4001 steps (50 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (53 resets) in 16 ms. (235 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (51 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (45 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
// Phase 1: matrix 205 rows 93 cols
[2025-06-02 09:23:08] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 29/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/70 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 22/92 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:08] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 10 ms to minimize.
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 205/297 variables, 92/104 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 1/298 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/298 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 105 constraints, problems are : Problem set: 1 solved, 25 unsolved in 1981 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 24/61 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 25/86 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 6/92 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:10] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:10] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:11] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:11] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:11] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:11] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 205/297 variables, 92/110 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 10/120 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:12] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:13] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:13] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 2/123 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:13] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:13] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:14] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:14] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:14] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 5/128 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:14] [INFO ] Deduced a trap along path composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 1/129 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 1/298 variables, 1/130 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/298 variables, 15/145 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:19] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:22] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 10 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/298 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/298 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 20 (OVERLAPS) 0/298 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 147 constraints, problems are : Problem set: 1 solved, 25 unsolved in 20961 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 25/26 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22992ms problems are : Problem set: 1 solved, 25 unsolved
Parikh walk visited 24 properties in 19864 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 205/205 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 93 transition count 202
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 90 transition count 202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 90 transition count 199
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 87 transition count 199
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 22 place count 77 transition count 185
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 77 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 74 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 74 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 73 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 73 transition count 173
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 62 place count 61 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 58 transition count 158
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 58 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 78 place count 53 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 53 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 96 place count 52 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 52 transition count 187
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 52 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 49 transition count 184
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 49 transition count 223
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 46 transition count 223
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 114 place count 46 transition count 223
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 43 transition count 220
Applied a total of 117 rules in 102 ms. Remains 43 /93 variables (removed 50) and now considering 220/205 (removed -15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 43/93 places, 220/205 transitions.
RANDOM walk for 40000 steps (4153 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (588 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54189 steps, run visited all 1 properties in 207 ms. (steps per millisecond=261 )
Probabilistic random walk after 54189 steps, saw 15974 distinct states, run finished after 215 ms. (steps per millisecond=252 ) properties seen :1
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:23:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 09:23:51] [INFO ] Flatten gal took : 36 ms
FORMULA MedleyA-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:23:51] [INFO ] Flatten gal took : 32 ms
[2025-06-02 09:23:51] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 65 out of 118 places (down from 68) after GAL structural reductions.
Computed a total of 12 stabilizing places and 14 stable transitions
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 116 transition count 232
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 104 transition count 230
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 104 transition count 226
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 100 transition count 226
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 50 place count 85 transition count 204
Iterating global reduction 2 with 15 rules applied. Total rules applied 65 place count 85 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 65 place count 85 transition count 203
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 67 place count 84 transition count 203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 80 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 80 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 79 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 79 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 78 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 78 transition count 184
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 105 place count 64 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 64 transition count 170
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 61 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 61 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 61 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 61 transition count 161
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 118 place count 60 transition count 161
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 120 place count 59 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 57 transition count 158
Applied a total of 122 rules in 72 ms. Remains 57 /118 variables (removed 61) and now considering 158/246 (removed 88) transitions.
// Phase 1: matrix 158 rows 57 cols
[2025-06-02 09:23:51] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 09:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:23:51] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:23:51] [INFO ] Redundant transitions in 11 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-02 09:23:51] [INFO ] Invariant cache hit.
[2025-06-02 09:23:52] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 157/213 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 2/215 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 81 constraints, problems are : Problem set: 0 solved, 151 unsolved in 9439 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 3/56 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 157/213 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 150/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 2/215 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:10] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 13 (OVERLAPS) 0/215 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 233 constraints, problems are : Problem set: 0 solved, 151 unsolved in 18675 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28200ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 28201ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/118 places, 158/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28529 ms. Remains : 57/118 places, 158/246 transitions.
[2025-06-02 09:24:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:20] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:24:20] [INFO ] Input system was already deterministic with 158 transitions.
[2025-06-02 09:24:20] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:24:20] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17788769624628131231.gal : 8 ms
[2025-06-02 09:24:20] [INFO ] Time to serialize properties into /tmp/CTLFireability69127797966705453.ctl : 6 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/CTLFireability17788769624628131231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability69127797966705453.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 -...282
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,961648,0.427631,15536,2,1582,5,36159,6,0,381,52196,0
Converting to forward existential form...Done !
original formula: EG(((!(A(!((((p21==1)&&(p28==1))&&((p47==1)&&(p115==1)))) U AG((p29==1)))) + (p136==0)) + EF((p34==1))))
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(!(E(TRUE U !((p29==1))))) U (!(!((((p21==1)&&(p28==1))&&((p47==1)&&(p115==1))))) * !(!(E(T...260
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t7, t8, t9, t10, t12, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t26, ...390
(forward)formula 0,1,24.1991,534712,1,0,554,2.81815e+06,346,227,3765,2.36846e+06,657
FORMULA MedleyA-PT-10-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 116 transition count 232
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 104 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 102 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 31 place count 102 transition count 225
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 37 place count 99 transition count 225
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 50 place count 86 transition count 206
Iterating global reduction 3 with 13 rules applied. Total rules applied 63 place count 86 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 86 transition count 205
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 64 place count 86 transition count 204
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 85 transition count 204
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 81 transition count 190
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 81 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 79 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 79 transition count 184
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 1 rules applied. Total rules applied 79 place count 79 transition count 183
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 81 place count 78 transition count 182
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 101 place count 68 transition count 172
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 102 place count 67 transition count 171
Iterating global reduction 6 with 1 rules applied. Total rules applied 103 place count 67 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 107 place count 67 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 107 place count 67 transition count 165
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 111 place count 65 transition count 165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 115 place count 63 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 62 transition count 162
Applied a total of 116 rules in 63 ms. Remains 62 /118 variables (removed 56) and now considering 162/246 (removed 84) transitions.
// Phase 1: matrix 162 rows 62 cols
[2025-06-02 09:24:44] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:44] [INFO ] Implicit Places using invariants in 105 ms returned [6, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/118 places, 162/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 176 ms. Remains : 60/118 places, 162/246 transitions.
[2025-06-02 09:24:44] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:44] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:44] [INFO ] Input system was already deterministic with 162 transitions.
[2025-06-02 09:24:45] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:45] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:24:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6370968169761873302.gal : 6 ms
[2025-06-02 09:24:45] [INFO ] Time to serialize properties into /tmp/CTLFireability555809978113876919.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/CTLFireability6370968169761873302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability555809978113876919.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25539e+06,0.361661,15304,2,1946,5,41272,6,0,402,49683,0
Converting to forward existential form...Done !
original formula: AG(!(E(!(((((p45==1)||(p38==1))||((((p14==1)&&(p61==1))&&((p125==1)&&(p145==1)))||(p74==1)))||(p107==1))) U ((p99==1) + AF(((p60==1)&&(p1...166
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(((((p45==1)||(p38==1))||((((p14==1)&&(p61==1))&&((p125==1)&&(p145==1)))||(p74==1)))||(...356
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t9, t10, t11, t13, t14, t15, t16, t17, t19, t20, t21, t22, t23, t24, ...509
Hit Full ! (commute/partial/dont) 79/254/83
(forward)formula 0,0,16.8305,415812,1,0,537,2.45595e+06,355,200,4127,2.24909e+06,619
FORMULA MedleyA-PT-10-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 116 transition count 239
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 111 transition count 237
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 109 transition count 236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 109 transition count 234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 107 transition count 234
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 39 place count 88 transition count 208
Iterating global reduction 3 with 19 rules applied. Total rules applied 58 place count 88 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 88 transition count 206
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 86 transition count 198
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 86 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 85 transition count 195
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 85 transition count 195
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 79 place count 78 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 77 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 77 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 77 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 85 place count 77 transition count 181
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 74 transition count 181
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 4 with 2 rules applied. Total rules applied 93 place count 73 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 72 transition count 179
Applied a total of 94 rules in 40 ms. Remains 72 /118 variables (removed 46) and now considering 179/246 (removed 67) transitions.
// Phase 1: matrix 179 rows 72 cols
[2025-06-02 09:25:02] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:02] [INFO ] Implicit Places using invariants in 58 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/118 places, 179/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 103 ms. Remains : 71/118 places, 179/246 transitions.
[2025-06-02 09:25:02] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:25:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:25:02] [INFO ] Input system was already deterministic with 179 transitions.
[2025-06-02 09:25:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:25:02] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9244663605118285745.gal : 4 ms
[2025-06-02 09:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1426690671531584738.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/CTLFireability9244663605118285745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1426690671531584738.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,5.26472e+06,0.894379,26984,2,3425,5,74061,6,0,461,95770,0
Converting to forward existential form...Done !
original formula: (EF(AG((((((p82==0)||(p122==0))||((p125==0)||(p147==0)))&&(((p14==0)||(p61==0))||((p125==0)||(p145==0))))||((((p140==1)&&(p44==1))&&((p11...450
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((((p82==0)||(p122==0))||((p125==0)||(p147==0)))&&(((p14==0)||(p61==0))||((p1...2727
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t6, t7, t8, t9, t11, t12, t13, t15, t16, t18, t20, t21, t23, t24, t27, t28, t...595
(forward)formula 0,1,5.55219,121212,1,0,403,661150,380,139,4528,513672,436
FORMULA MedleyA-PT-10-CTLFireability-2025-02 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 : 118/118 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 99 transition count 220
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 99 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 99 transition count 217
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 95 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 95 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 92 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 92 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 91 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 91 transition count 192
Applied a total of 57 rules in 6 ms. Remains 91 /118 variables (removed 27) and now considering 192/246 (removed 54) transitions.
// Phase 1: matrix 192 rows 91 cols
[2025-06-02 09:25:07] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-02 09:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:08] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-02 09:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:09] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:09] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:10] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:10] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/283 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:13] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:17] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:18] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:21] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:21] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 110 constraints, problems are : Problem set: 0 solved, 191 unsolved in 22609 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/283 variables, 91/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 191/299 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:34] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 302 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52739ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 52741ms
Starting structural reductions in LTL mode, iteration 1 : 91/118 places, 192/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52970 ms. Remains : 91/118 places, 192/246 transitions.
[2025-06-02 09:26:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:26:00] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:26:00] [INFO ] Input system was already deterministic with 192 transitions.
[2025-06-02 09:26:00] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:26:00] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:26:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5058634199368640220.gal : 5 ms
[2025-06-02 09:26:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16721731945449843021.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/CTLFireability5058634199368640220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16721731945449843021.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30897e+07,1.98727,42888,2,6094,5,121335,6,0,556,154163,0
Converting to forward existential form...Done !
original formula: (E(((p39==1)&&(p62==1)) U (p85==1)) + A((EX(AX((((p82==1)&&(p98==1))&&(p108==1)))) * EF(!((((p21==1)&&(p35==1))&&((p75==1)&&(p86==1))))))...262
=> equivalent forward existential formula: ([(FwdU(Init,((p39==1)&&(p62==1))) * (p85==1))] != FALSE + [((Init * !(EG(!(!(E(TRUE U !(!((E(!((((p14==1)&&(p25...981
Hit Full ! (commute/partial/dont) 184/7/8
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t26, t27, t29, t31, t32, t35, t36, ...440
Detected timeout of ITS tools.
[2025-06-02 09:26:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:26:30] [INFO ] Applying decomposition
[2025-06-02 09:26:31] [INFO ] Flatten gal took : 10 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/graph14925617978437195234.txt' '-o' '/tmp/graph14925617978437195234.bin' '-w' '/tmp/graph14925617978437195234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14925617978437195234.bin' '-l' '-1' '-v' '-w' '/tmp/graph14925617978437195234.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:26:31] [INFO ] Decomposing Gal with order
[2025-06-02 09:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:26:31] [INFO ] Removed a total of 399 redundant transitions.
[2025-06-02 09:26:31] [INFO ] Flatten gal took : 85 ms
[2025-06-02 09:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 17 ms.
[2025-06-02 09:26:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14751060319348366605.gal : 5 ms
[2025-06-02 09:26:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13006456376400646103.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/CTLFireability14751060319348366605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13006456376400646103.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,1.30897e+07,0.170867,8820,465,132,8242,878,427,19403,102,2837,0
Converting to forward existential form...Done !
original formula: (E(((i1.u5.p39==1)&&(i2.u9.p62==1)) U (i3.u14.p85==1)) + A((EX(AX((((i5.u11.p82==1)&&(i4.u15.p98==1))&&(i5.u19.p108==1)))) * EF(!((((i2.u...381
=> equivalent forward existential formula: ([(FwdU(Init,((i1.u5.p39==1)&&(i2.u9.p62==1))) * (i3.u14.p85==1))] != FALSE + [((Init * !(EG(!(!(E(TRUE U !(!((E...1362
Reverse transition relation is NOT exact ! Due to transitions t17, t51, t76, t82, t172, t173, t174, t175, i0.u4.t72, i1.t65, i1.t62, i1.t61, i1.u5.t49, i1....603
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
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
(forward)formula 0,0,12.6863,296340,1,0,438993,7922,2464,1.39027e+06,488,77332,546328
FORMULA MedleyA-PT-10-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 98 transition count 219
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 98 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 98 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 93 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 93 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 89 transition count 187
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 87 transition count 181
Applied a total of 65 rules in 6 ms. Remains 87 /118 variables (removed 31) and now considering 181/246 (removed 65) transitions.
// Phase 1: matrix 181 rows 87 cols
[2025-06-02 09:26:44] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 09:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:44] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-02 09:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:46] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:46] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:49] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:52] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:52] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 16114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:04] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:08] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:18] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 286 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46215ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 46215ms
Starting structural reductions in LTL mode, iteration 1 : 87/118 places, 181/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46580 ms. Remains : 87/118 places, 181/246 transitions.
[2025-06-02 09:27:30] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:27:30] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:27:30] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-02 09:27:30] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:27:30] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9701335970402229814.gal : 5 ms
[2025-06-02 09:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12269122516930738223.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/CTLFireability9701335970402229814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12269122516930738223.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07361e+07,1.6364,36252,2,4440,5,104342,6,0,529,133789,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...367
(forward)formula 0,1,3.80578,72848,1,0,308,311478,377,108,5063,305858,368
FORMULA MedleyA-PT-10-CTLFireability-2025-04 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 : 118/118 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 99 transition count 221
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 99 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 99 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 96 transition count 207
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 96 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 94 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 94 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 93 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 93 transition count 200
Applied a total of 53 rules in 7 ms. Remains 93 /118 variables (removed 25) and now considering 200/246 (removed 46) transitions.
// Phase 1: matrix 200 rows 93 cols
[2025-06-02 09:27:34] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 09:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-02 09:27:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:37] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:37] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:37] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:37] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/293 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:45] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:45] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 0/293 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 110 constraints, problems are : Problem set: 0 solved, 199 unsolved in 16923 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/293 variables, 93/108 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 199/307 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:09] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:28:11] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 15 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/293 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 311 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47033ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 47034ms
Starting structural reductions in LTL mode, iteration 1 : 93/118 places, 200/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47261 ms. Remains : 93/118 places, 200/246 transitions.
[2025-06-02 09:28:21] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:28:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:28:21] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-02 09:28:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:28:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:28:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13007954329910225915.gal : 3 ms
[2025-06-02 09:28:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18209786251615331174.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/CTLFireability13007954329910225915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18209786251615331174.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,1.57286e+07,2.639,55476,2,6167,5,153651,6,0,572,217350,0
Converting to forward existential form...Done !
original formula: (EX(AF(AX(EX((p121==1))))) + E(EF(EX((p51==1))) U (EF((((p82==1)&&(p89==1))&&(p113==1))) * !((AG((p55==1)) + (!((((p14==1)&&(p25==1))&&((...235
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(EX(!(EX((p121==1)))))))))] != FALSE + ([(((FwdU(Init,E(TRUE U EX((p51==1)))) * E(TRUE U (...473
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t23, t25, t26, t27, t28, t29, t30, t31, ...504
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 09:28:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:28:52] [INFO ] Applying decomposition
[2025-06-02 09:28:52] [INFO ] Flatten gal took : 9 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/graph16575196967125004579.txt' '-o' '/tmp/graph16575196967125004579.bin' '-w' '/tmp/graph16575196967125004579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16575196967125004579.bin' '-l' '-1' '-v' '-w' '/tmp/graph16575196967125004579.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:28:52] [INFO ] Decomposing Gal with order
[2025-06-02 09:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:28:52] [INFO ] Removed a total of 400 redundant transitions.
[2025-06-02 09:28:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 09:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 18 ms.
[2025-06-02 09:28:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6273318705034835888.gal : 5 ms
[2025-06-02 09:28:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1616424756174862610.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/CTLFireability6273318705034835888.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1616424756174862610.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.57286e+07,0.155609,8480,574,265,7924,1320,360,17923,131,8530,0
Converting to forward existential form...Done !
original formula: (EX(AF(AX(EX((i5.u18.p121==1))))) + E(EF(EX((i1.u9.p51==1))) U (EF((((i5.u10.p82==1)&&(i4.u14.p89==1))&&(i5.u18.p113==1))) * !((AG((i1.u9...341
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(EX(!(EX((i5.u18.p121==1)))))))))] != FALSE + ([(((FwdU(Init,E(TRUE U EX((i1.u9.p51==1))))...612
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t52, t82, t176, t177, t178, t179, t190, t191, t192, t193, i0.t130, i0.i0.t86, i0.i0....771
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
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 5
Fast SCC detection found an SCC at level 6
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
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
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,1,19.5112,430576,1,0,658851,24308,2427,1.75086e+06,785,195522,599707
FORMULA MedleyA-PT-10-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 99 transition count 220
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 99 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 99 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 94 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 94 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 93 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 93 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 92 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 92 transition count 194
Applied a total of 54 rules in 9 ms. Remains 92 /118 variables (removed 26) and now considering 194/246 (removed 52) transitions.
// Phase 1: matrix 194 rows 92 cols
[2025-06-02 09:29:11] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 09:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:12] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 09:29:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:15] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:15] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/286 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:18] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:23] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:29] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/286 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/286 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 107 constraints, problems are : Problem set: 0 solved, 193 unsolved in 23657 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/286 variables, 92/105 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 193/298 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:39] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:39] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:39] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:44] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:53] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 305 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53818ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 53819ms
Starting structural reductions in LTL mode, iteration 1 : 92/118 places, 194/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54100 ms. Remains : 92/118 places, 194/246 transitions.
[2025-06-02 09:30:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:30:05] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:06] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 09:30:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:30:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:30:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13196000472802484237.gal : 2 ms
[2025-06-02 09:30:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4447355470450578378.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/CTLFireability13196000472802484237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4447355470450578378.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5136e+07,2.26076,56532,2,6406,5,157897,6,0,562,233796,0
Converting to forward existential form...Done !
original formula: EG(EX(!(A(((E((p55==1) U (p105==1)) + (((p21==1)&&(p32==1))&&((p75==1)&&(p122==1)))) + ((p21==1)&&(p58==1))) U (p34==1)))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(!((E(!((p34==1)) U (!(((E((p55==1) U (p105==1)) + (((p21==1)&&(p32==1))&&((p75==1)&&(p122==1))))...229
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t25, t26, t28, t29, t30, t31, t32, t33, ...457
Detected timeout of ITS tools.
[2025-06-02 09:30:36] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:30:36] [INFO ] Applying decomposition
[2025-06-02 09:30:36] [INFO ] Flatten gal took : 13 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/graph5776673310414541316.txt' '-o' '/tmp/graph5776673310414541316.bin' '-w' '/tmp/graph5776673310414541316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5776673310414541316.bin' '-l' '-1' '-v' '-w' '/tmp/graph5776673310414541316.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:30:36] [INFO ] Decomposing Gal with order
[2025-06-02 09:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:30:36] [INFO ] Removed a total of 373 redundant transitions.
[2025-06-02 09:30:36] [INFO ] Flatten gal took : 32 ms
[2025-06-02 09:30:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 13 ms.
[2025-06-02 09:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12966388188106087278.gal : 4 ms
[2025-06-02 09:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2838299177616235254.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/CTLFireability12966388188106087278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2838299177616235254.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5136e+07,0.347212,9984,425,277,10088,1559,350,21869,127,13037,0
Converting to forward existential form...Done !
original formula: EG(EX(!(A(((E((i3.u9.p55==1) U (i6.u18.p105==1)) + (((i3.u2.p21==1)&&(i2.u6.p32==1))&&((i4.u10.p75==1)&&(i6.u18.p122==1)))) + ((i3.u2.p21...198
=> equivalent forward existential formula: [FwdG(Init,EX(!(!((E(!((i2.u6.p34==1)) U (!(((E((i3.u9.p55==1) U (i6.u18.p105==1)) + (((i3.u2.p21==1)&&(i2.u6.p3...298
Reverse transition relation is NOT exact ! Due to transitions t17, t51, t82, t86, i1.u3.t78, i2.t72, i2.t68, i2.t67, i2.u5.t74, i2.u5.t75, i2.u8.t49, i2.u8...742
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
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,12.8881,279936,1,0,449447,23020,2155,1.1646e+06,714,235180,636130
FORMULA MedleyA-PT-10-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 101 transition count 223
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 101 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 101 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 99 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 99 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 98 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 98 transition count 212
Applied a total of 43 rules in 4 ms. Remains 98 /118 variables (removed 20) and now considering 212/246 (removed 34) transitions.
// Phase 1: matrix 212 rows 98 cols
[2025-06-02 09:30:49] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-02 09:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:49] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-02 09:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:52] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:53] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/310 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:57] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:02] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:02] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 118 constraints, problems are : Problem set: 0 solved, 211 unsolved in 22339 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/310 variables, 98/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 211/327 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:18] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:18] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:19] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:19] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:19] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:27] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 335 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52458ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 52459ms
Starting structural reductions in LTL mode, iteration 1 : 98/118 places, 212/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52662 ms. Remains : 98/118 places, 212/246 transitions.
[2025-06-02 09:31:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:31:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:31:41] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 09:31:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:31:41] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15898839990338715241.gal : 2 ms
[2025-06-02 09:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6151763796673041937.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/CTLFireability15898839990338715241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6151763796673041937.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.01414e+07,2.10713,51968,2,6966,5,142162,6,0,604,206405,0
Converting to forward existential form...Done !
original formula: (EX(E((((E((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1))) U (((p21==1)&&(p28==1))&&(p47==1))) + EF((((p82==1)&&(p122==1))&&((p125==1)&&(p1...490
=> equivalent forward existential formula: ([(Init * !(EX(E((((E((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1))) U (((p21==1)&&(p28==1))&&(p47==1))) + E(TRUE...631
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t23, t25, t26, t27, t29, t30, t31, t32, ...577
(forward)formula 0,0,7.04332,153488,1,0,394,723483,445,138,5739,670097,439
FORMULA MedleyA-PT-10-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 103 transition count 226
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 103 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 103 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 101 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 101 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 100 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 100 transition count 215
Applied a total of 39 rules in 3 ms. Remains 100 /118 variables (removed 18) and now considering 215/246 (removed 31) transitions.
// Phase 1: matrix 215 rows 100 cols
[2025-06-02 09:31:49] [INFO ] Computed 10 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:49] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 09:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:49] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 09:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:52] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:52] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:52] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:52] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:53] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:53] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/315 variables, 100/116 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:57] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:00] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:01] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:02] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:02] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:07] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 9 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/315 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 12 (OVERLAPS) 0/315 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 122 constraints, problems are : Problem set: 0 solved, 214 unsolved in 26996 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/315 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 214/334 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:21] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:23] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:28] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:28] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:29] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/315 variables, and 341 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57133ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 57134ms
Starting structural reductions in LTL mode, iteration 1 : 100/118 places, 215/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57561 ms. Remains : 100/118 places, 215/246 transitions.
[2025-06-02 09:32:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:32:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:32:46] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 09:32:46] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:32:46] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:32:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13790688441934284627.gal : 4 ms
[2025-06-02 09:32:46] [INFO ] Time to serialize properties into /tmp/CTLFireability191360208664495350.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/CTLFireability13790688441934284627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability191360208664495350.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.50273e+07,4.7992,88352,2,9477,5,232068,6,0,615,386339,0
Converting to forward existential form...Done !
original formula: E(E(!(EF((p120==1))) U (EX(EF((p56==1))) * AG((((((p82==1)&&(p122==1))&&((p125==1)&&(p143==1)))||(p80==1))||((((p21==1)&&(p61==1))&&((p82...575
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,E(!(E(TRUE U (p120==1))) U (EX(E(TRUE U (p56==1))) * !(E(TRUE U !((((((p82==1)&&(p122==1))&&...1726
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t21, t22, t23, t24, t26, t27, t28, t29, t30, t31, t32, ...597
Detected timeout of ITS tools.
[2025-06-02 09:33:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:33:16] [INFO ] Applying decomposition
[2025-06-02 09:33:16] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5672490342459410827.txt' '-o' '/tmp/graph5672490342459410827.bin' '-w' '/tmp/graph5672490342459410827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5672490342459410827.bin' '-l' '-1' '-v' '-w' '/tmp/graph5672490342459410827.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:33:16] [INFO ] Decomposing Gal with order
[2025-06-02 09:33:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:33:16] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 09:33:16] [INFO ] Flatten gal took : 35 ms
[2025-06-02 09:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 11 ms.
[2025-06-02 09:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12739954606439560250.gal : 3 ms
[2025-06-02 09:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10002613957746954955.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/CTLFireability12739954606439560250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10002613957746954955.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,2.50273e+07,0.789418,19328,757,209,24192,1652,427,82686,94,7038,0
Converting to forward existential form...Done !
original formula: E(E(!(EF((i6.u26.p120==1))) U (EX(EF((i2.u14.p56==1))) * AG((((((i6.u16.p82==1)&&(i6.u28.p122==1))&&((i6.u28.p125==1)&&(i6.u28.p143==1)))...862
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,E(!(E(TRUE U (i6.u26.p120==1))) U (EX(E(TRUE U (i2.u14.p56==1))) * !(E(TRUE U !((((((i6.u16....2441
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t91, t95, t141, t191, t192, t193, t194, t202, t204, t206, t208, i0.u4.t86, i1.t80, i...785
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
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 116 transition count 228
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 100 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 35 place count 100 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 97 transition count 223
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 55 place count 83 transition count 202
Iterating global reduction 2 with 14 rules applied. Total rules applied 69 place count 83 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 69 place count 83 transition count 200
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 73 place count 81 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 77 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 77 transition count 182
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 74 transition count 174
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 74 transition count 174
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 2 with 1 rules applied. Total rules applied 88 place count 74 transition count 173
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 73 transition count 172
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 92 place count 71 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 71 transition count 166
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 119 place count 58 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 58 transition count 153
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 123 place count 55 transition count 148
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 55 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 55 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 130 place count 55 transition count 142
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 134 place count 53 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 138 place count 51 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 49 transition count 138
Applied a total of 140 rules in 34 ms. Remains 49 /118 variables (removed 69) and now considering 138/246 (removed 108) transitions.
// Phase 1: matrix 138 rows 49 cols
[2025-06-02 09:33:47] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:47] [INFO ] Implicit Places using invariants in 111 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/118 places, 138/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 150 ms. Remains : 48/118 places, 138/246 transitions.
[2025-06-02 09:33:47] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:33:47] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:33:47] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-02 09:33:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:33:47] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:33:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15151304250612405760.gal : 2 ms
[2025-06-02 09:33:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3099922252866121754.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/ReachabilityCardinality15151304250612405760.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3099922252866121754.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 ...329
RANDOM walk for 30932 steps (4279 resets) in 357 ms. (86 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-10-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality3099922252866121754.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 98 transition count 219
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 98 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 98 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 94 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 94 transition count 201
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 91 transition count 194
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 91 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 89 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 89 transition count 188
Applied a total of 61 rules in 11 ms. Remains 89 /118 variables (removed 29) and now considering 188/246 (removed 58) transitions.
// Phase 1: matrix 188 rows 89 cols
[2025-06-02 09:33:47] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 09:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:33:47] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-06-02 09:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:49] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:49] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:50] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:50] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:53] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:57] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:58] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 106 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/277 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 187/291 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:20] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:20] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:20] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 12 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/277 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 296 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48529ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 48530ms
Starting structural reductions in LTL mode, iteration 1 : 89/118 places, 188/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48806 ms. Remains : 89/118 places, 188/246 transitions.
[2025-06-02 09:34:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:34:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 09:34:36] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-02 09:34:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:34:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:34:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3222379881617332221.gal : 3 ms
[2025-06-02 09:34:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1930313516155091689.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/CTLFireability3222379881617332221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1930313516155091689.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22067e+07,2.52229,49792,2,4985,5,135340,6,0,544,190156,0
Converting to forward existential form...Done !
original formula: AG((AF((((p75==0)||(p86==0))||((p125==0)||(p143==0)))) + AX(AX((((p21==0)||(p37==0))||(p42==0))))))
=> equivalent forward existential formula: [(EY(EY((FwdU(Init,TRUE) * !(!(EG(!((((p75==0)||(p86==0))||((p125==0)||(p143==0)))))))))) * !((((p21==0)||(p37==...180
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...430
(forward)formula 0,1,5.79539,97788,1,0,433,428587,401,141,5325,396887,497
FORMULA MedleyA-PT-10-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 98 transition count 219
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 98 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 98 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 93 transition count 197
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 93 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 89 transition count 187
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 87 transition count 181
Applied a total of 65 rules in 4 ms. Remains 87 /118 variables (removed 31) and now considering 181/246 (removed 65) transitions.
// Phase 1: matrix 181 rows 87 cols
[2025-06-02 09:34:42] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 09:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:34:42] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-02 09:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:44] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:44] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:47] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:51] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:34:52] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 17641 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:03] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:07] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:15] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:35:24] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 286 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47732ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 47732ms
Starting structural reductions in LTL mode, iteration 1 : 87/118 places, 181/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47969 ms. Remains : 87/118 places, 181/246 transitions.
[2025-06-02 09:35:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:35:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:35:30] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-02 09:35:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:35:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:35:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13687886369432992210.gal : 2 ms
[2025-06-02 09:35:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2258796370321197842.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/CTLFireability13687886369432992210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2258796370321197842.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07361e+07,1.53492,36124,2,4440,5,104342,6,0,529,133789,0
Converting to forward existential form...Done !
original formula: EF((EG(AF((p31==0))) * EX((((p21==1)&&(p61==1))&&((p125==1)&&(p141==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(!(EG(!((p31==0))))))) * (((p21==1)&&(p61==1))&&((p125==1)&&(p141==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...367
Detected timeout of ITS tools.
[2025-06-02 09:36:00] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:36:00] [INFO ] Applying decomposition
[2025-06-02 09:36:00] [INFO ] Flatten gal took : 9 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/graph1905626352058173619.txt' '-o' '/tmp/graph1905626352058173619.bin' '-w' '/tmp/graph1905626352058173619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1905626352058173619.bin' '-l' '-1' '-v' '-w' '/tmp/graph1905626352058173619.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:36:00] [INFO ] Decomposing Gal with order
[2025-06-02 09:36:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:36:00] [INFO ] Removed a total of 383 redundant transitions.
[2025-06-02 09:36:00] [INFO ] Flatten gal took : 27 ms
[2025-06-02 09:36:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 5 ms.
[2025-06-02 09:36:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15368199411634641734.gal : 3 ms
[2025-06-02 09:36:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5673939587858129953.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/CTLFireability15368199411634641734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5673939587858129953.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07361e+07,0.210242,9908,520,107,10566,499,355,24712,90,1598,0
Converting to forward existential form...Done !
original formula: EF((EG(AF((i1.u6.p31==0))) * EX((((i2.u1.p21==1)&&(i2.u9.p61==1))&&((i3.u21.p125==1)&&(i3.u25.p141==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(!(EG(!((i1.u6.p31==0))))))) * (((i2.u1.p21==1)&&(i2.u9.p61==1))&&((i3.u21.p125==1)&&(...183
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t46, t75, t119, i0.u4.t67, i1.t60, i1.t57, i1.t56, i1.u5.t44, i1.u5.t65, i1.u5.t66, ...522
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
Fast SCC detection found an SCC at level 6
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,1,10.5203,238988,1,0,372665,6747,1955,1.16561e+06,453,61943,343677
FORMULA MedleyA-PT-10-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 246/246 transitions.
Graph (complete) has 458 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 116 transition count 231
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 103 transition count 230
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 28 place count 103 transition count 227
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 100 transition count 227
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 48 place count 86 transition count 207
Iterating global reduction 2 with 14 rules applied. Total rules applied 62 place count 86 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 86 transition count 206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 83 transition count 196
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 83 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 81 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 81 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 80 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 80 transition count 188
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 97 place count 68 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 68 transition count 176
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 66 transition count 174
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 66 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 108 place count 66 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 108 place count 66 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 63 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 61 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 60 transition count 163
Applied a total of 119 rules in 23 ms. Remains 60 /118 variables (removed 58) and now considering 163/246 (removed 83) transitions.
// Phase 1: matrix 163 rows 60 cols
[2025-06-02 09:36:10] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 09:36:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:36:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:36:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:36:11] [INFO ] Redundant transitions in 7 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-02 09:36:11] [INFO ] Invariant cache hit.
[2025-06-02 09:36:11] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 163/222 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/223 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 84 constraints, problems are : Problem set: 0 solved, 154 unsolved in 7567 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 4/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 163/222 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 154/237 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 238 constraints, problems are : Problem set: 0 solved, 154 unsolved in 20007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27667ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 27668ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/118 places, 163/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27930 ms. Remains : 60/118 places, 163/246 transitions.
[2025-06-02 09:36:38] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:36:38] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:36:38] [INFO ] Input system was already deterministic with 163 transitions.
[2025-06-02 09:36:38] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:36:38] [INFO ] Flatten gal took : 6 ms
[2025-06-02 09:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15882488444845243497.gal : 2 ms
[2025-06-02 09:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability793049334344155289.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/CTLFireability15882488444845243497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability793049334344155289.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95977e+06,0.367135,14464,2,1864,5,40007,6,0,400,32990,0
Converting to forward existential form...Done !
original formula: EG((EF((E((((p82==1)&&(p98==1))&&(p103==1)) U ((p66==1)&&(p87==1))) + AF((((p21==1)&&(p61==1))&&((p125==1)&&(p141==1)))))) * (p107==0)))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((((p82==1)&&(p98==1))&&(p103==1)) U ((p66==1)&&(p87==1))) + !(EG(!((((p21==1)&&(p61==1))...209
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t7, t9, t10, t12, t13, t15, t16, t17, t18, t20, t21, t24, t25, t26, t27, ...492
Detected timeout of ITS tools.
[2025-06-02 09:37:08] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:37:08] [INFO ] Applying decomposition
[2025-06-02 09:37:08] [INFO ] Flatten gal took : 7 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/graph15976848946856121612.txt' '-o' '/tmp/graph15976848946856121612.bin' '-w' '/tmp/graph15976848946856121612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15976848946856121612.bin' '-l' '-1' '-v' '-w' '/tmp/graph15976848946856121612.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:37:09] [INFO ] Decomposing Gal with order
[2025-06-02 09:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:37:09] [INFO ] Removed a total of 378 redundant transitions.
[2025-06-02 09:37:09] [INFO ] Flatten gal took : 19 ms
[2025-06-02 09:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2025-06-02 09:37:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8184630690948280823.gal : 2 ms
[2025-06-02 09:37:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6726891767918507021.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/CTLFireability8184630690948280823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6726891767918507021.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95977e+06,0.139196,6552,202,109,4712,589,228,10011,123,2345,0
Converting to forward existential form...Done !
original formula: EG((EF((E((((i2.u6.p82==1)&&(i2.u9.p98==1))&&(u10.p103==1)) U ((i2.u9.p66==1)&&(i4.u7.p87==1))) + AF((((i1.u0.p21==1)&&(i1.u5.p61==1))&&(...212
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (E((((i2.u6.p82==1)&&(i2.u9.p98==1))&&(u10.p103==1)) U ((i2.u9.p66==1)&&(i4.u7.p87==1))) + ...267
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t61, t62, t69, t102, t103, t151, t153, u10.t4, u10.t5, u10.t6, u10.t7, u10.t9, u10....529
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
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,6.60256,146456,1,0,215393,3925,1365,696880,578,11652,215058
FORMULA MedleyA-PT-10-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:37:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:37:15] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:37:15] [INFO ] Applying decomposition
[2025-06-02 09:37:15] [INFO ] Flatten gal took : 7 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/graph7683990646792550177.txt' '-o' '/tmp/graph7683990646792550177.bin' '-w' '/tmp/graph7683990646792550177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7683990646792550177.bin' '-l' '-1' '-v' '-w' '/tmp/graph7683990646792550177.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:37:15] [INFO ] Decomposing Gal with order
[2025-06-02 09:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:37:15] [INFO ] Removed a total of 489 redundant transitions.
[2025-06-02 09:37:15] [INFO ] Flatten gal took : 45 ms
[2025-06-02 09:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 5 ms.
[2025-06-02 09:37:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4833440678653418690.gal : 2 ms
[2025-06-02 09:37:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4644691361418837742.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/CTLFireability4833440678653418690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4644691361418837742.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,4.7366e+07,0.881067,25152,982,196,29909,1136,477,131069,122,4439,0
Converting to forward existential form...Done !
original formula: E(E(!(EF((i5.u23.p120==1))) U (EX(EF((i2.u11.p56==1))) * AG((((((i4.u13.p82==1)&&(i5.u22.p122==1))&&((i7.i1.u26.p125==1)&&(i7.i1.u30.p143...886
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,E(!(E(TRUE U (i5.u23.p120==1))) U (EX(E(TRUE U (i2.u11.p56==1))) * !(E(TRUE U !((((((i4.u13....2501
Reverse transition relation is NOT exact ! Due to transitions t115, t122, i0.u1.t111, i0.u3.t106, i1.t100, i1.t96, i1.t95, i1.u2.t107, i1.u2.t108, i1.u2.t1...898
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
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
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,59.8767,1021756,1,0,1.41644e+06,6495,3145,5.04874e+06,661,41664,1225540
FORMULA MedleyA-PT-10-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 983405 ms.
BK_STOP 1748857096063
--------------------
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-10"
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-10, 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-174876524100170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-10.tgz
mv MedleyA-PT-10 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 ;