About the Execution of ITS-Tools for MedleyA-PT-16
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 902463.00 | 0.00 | 0.00 | TTFFFTFTTFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100217.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-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 89K 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-16-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748869267116
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 13:01:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:01:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:01:10] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2025-06-02 13:01:10] [INFO ] Transformed 196 places.
[2025-06-02 13:01:10] [INFO ] Transformed 392 transitions.
[2025-06-02 13:01:10] [INFO ] Found NUPN structural information;
[2025-06-02 13:01:10] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 183 transition count 370
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 183 transition count 370
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 183 transition count 364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 182 transition count 363
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 182 transition count 363
Applied a total of 34 rules in 95 ms. Remains 182 /196 variables (removed 14) and now considering 363/390 (removed 27) transitions.
// Phase 1: matrix 363 rows 182 cols
[2025-06-02 13:01:10] [INFO ] Computed 7 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:01:11] [INFO ] Implicit Places using invariants in 561 ms returned []
[2025-06-02 13:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:01:11] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2025-06-02 13:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:19] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:20] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:21] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:21] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:21] [INFO ] Deduced a trap composed of 95 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 13:01:21] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:21] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:22] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:22] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:22] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:22] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:22] [INFO ] Deduced a trap composed of 95 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 13:01:23] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:23] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:23] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:24] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:24] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:25] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:25] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 120 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:26] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:27] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:27] [INFO ] Deduced a trap composed of 121 places in 191 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:27] [INFO ] Deduced a trap composed of 122 places in 218 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:32] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:32] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:32] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:33] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:33] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:33] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:36] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:36] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 182/545 variables, and 49 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/182 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:47] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:49] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:01:50] [INFO ] Deduced a trap composed of 128 places in 218 ms of which 38 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 363/545 variables, 182/234 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 362/596 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:04] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 597 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 182/196 places, 363/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61793 ms. Remains : 182/196 places, 363/390 transitions.
Support contains 70 out of 182 places after structural reductions.
[2025-06-02 13:02:12] [INFO ] Flatten gal took : 105 ms
[2025-06-02 13:02:12] [INFO ] Flatten gal took : 49 ms
[2025-06-02 13:02:12] [INFO ] Input system was already deterministic with 363 transitions.
Support contains 61 out of 182 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2451 ms. (16 steps per ms) remains 29/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
[2025-06-02 13:02:14] [INFO ] Invariant cache hit.
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/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 132/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 5/182 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 363/545 variables, 182/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 189 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 132/177 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:16] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:16] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 19 ms to minimize.
Problem AtomicPropp7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:16] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:16] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 5/182 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 363/545 variables, 182/193 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 26/219 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:18] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:18] [INFO ] Deduced a trap composed of 40 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 13:02:18] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 4/223 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:20] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:20] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
SMT process timed out in 6663ms, After SMT, problems are : Problem set: 1 solved, 26 unsolved
Fused 26 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 941 ms.
Support contains 39 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 363/363 transitions.
Graph (trivial) has 134 edges and 182 vertex of which 9 / 182 are part of one of the 2 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 175 transition count 339
Reduce places removed 15 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 21 rules applied. Total rules applied 37 place count 160 transition count 333
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 43 place count 154 transition count 333
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 43 place count 154 transition count 329
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 51 place count 150 transition count 329
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 61 place count 140 transition count 312
Iterating global reduction 3 with 10 rules applied. Total rules applied 71 place count 140 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 78 place count 140 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 78 place count 140 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 138 transition count 303
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 118 place count 120 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 120 transition count 283
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 119 transition count 279
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 119 transition count 279
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 154 place count 103 transition count 367
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 182 place count 103 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 102 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 205 place count 102 transition count 332
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 6 with 2 rules applied. Total rules applied 207 place count 101 transition count 331
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 219 place count 101 transition count 319
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 237 place count 89 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 245 place count 89 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 89 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 89 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 88 transition count 302
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 13 edges and 87 vertex of which 2 / 87 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 251 place count 86 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 257 place count 86 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 284 place count 86 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 286 place count 85 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 287 place count 85 transition count 279
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 288 place count 85 transition count 279
Applied a total of 288 rules in 190 ms. Remains 85 /182 variables (removed 97) and now considering 279/363 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 85/182 places, 279/363 transitions.
RANDOM walk for 40000 steps (8 resets) in 424 ms. (94 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 78 ms. (50 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 10/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 10/10 properties
[2025-06-02 13:02:22] [INFO ] Flow matrix only has 255 transitions (discarded 24 similar events)
// Phase 1: matrix 255 rows 85 cols
[2025-06-02 13:02:22] [INFO ] Computed 6 invariants in 3 ms
[2025-06-02 13:02:22] [INFO ] State equation strengthened by 44 read => feed constraints.
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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 65/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 255/340 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 135 constraints, problems are : Problem set: 0 solved, 10 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 65/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:22] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:23] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:23] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/85 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 255/340 variables, 85/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:23] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:23] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:24] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 9 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/340 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 152 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3150 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3661ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 940 steps, including 73 resets, run visited all 1 properties in 4 ms. (steps per millisecond=235 )
Parikh walk visited 10 properties in 549 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-06-02 13:02:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 13:02:26] [INFO ] Flatten gal took : 42 ms
FORMULA MedleyA-PT-16-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 13:02:26] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:02:26] [INFO ] Input system was already deterministic with 363 transitions.
Support contains 53 out of 182 places (down from 55) after GAL structural reductions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 153 transition count 317
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 153 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 153 transition count 308
Applied a total of 67 rules in 13 ms. Remains 153 /182 variables (removed 29) and now considering 308/363 (removed 55) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:02:26] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:02:26] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 13:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:02:26] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:31] [INFO ] Deduced a trap composed of 21 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 13:02:31] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:32] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:32] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:32] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:32] [INFO ] Deduced a trap composed of 24 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 13:02:32] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:33] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:33] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:33] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:34] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:34] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:34] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:34] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:35] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:36] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:36] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:36] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:40] [INFO ] Deduced a trap composed of 31 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 13:02:40] [INFO ] Deduced a trap composed of 31 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 13:02:41] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:44] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:53] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:02:53] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:00] [INFO ] Deduced a trap composed of 93 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:00] [INFO ] Deduced a trap composed of 106 places in 167 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap along path composed of 2 places in 125 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap along path composed of 2 places in 138 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:15] [INFO ] Deduced a trap along path composed of 17 places in 125 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:19] [INFO ] Deduced a trap along path composed of 16 places in 45 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 308/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 153/182 places, 308/363 transitions.
[2025-06-02 13:03:27] [INFO ] Flatten gal took : 33 ms
[2025-06-02 13:03:27] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:03:27] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:03:27] [INFO ] Flatten gal took : 23 ms
[2025-06-02 13:03:27] [INFO ] Flatten gal took : 24 ms
[2025-06-02 13:03:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2821409472807811210.gal : 23 ms
[2025-06-02 13:03:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1979775185759395055.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/CTLCardinality2821409472807811210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1979775185759395055.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.44045e+06,1.24306,32996,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: EF(AX(AX((p81==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!((p81==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,5.24006,125176,1,0,567,611284,633,285,6715,475800,627
FORMULA MedleyA-PT-16-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Graph (trivial) has 199 edges and 182 vertex of which 13 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 171 transition count 322
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 141 transition count 320
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 140 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 139 transition count 319
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 66 place count 139 transition count 316
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 72 place count 136 transition count 316
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 99 place count 109 transition count 272
Iterating global reduction 4 with 27 rules applied. Total rules applied 126 place count 109 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 10 rules applied. Total rules applied 136 place count 109 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 108 transition count 262
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 137 place count 108 transition count 256
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 149 place count 102 transition count 256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 101 transition count 254
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 101 transition count 254
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 179 place count 87 transition count 240
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 183 place count 83 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 187 place count 83 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 201 place count 83 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 201 place count 83 transition count 214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 82 transition count 214
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 77 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 76 transition count 208
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 87 edges and 74 vertex of which 24 / 74 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 217 place count 59 transition count 208
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 248 place count 59 transition count 177
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 249 place count 58 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 250 place count 58 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 8 with 51 rules applied. Total rules applied 301 place count 58 transition count 115
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 8 with 5 rules applied. Total rules applied 306 place count 58 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 311 place count 53 transition count 110
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 312 place count 52 transition count 105
Iterating global reduction 10 with 1 rules applied. Total rules applied 313 place count 52 transition count 105
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 10 with 4 rules applied. Total rules applied 317 place count 50 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 318 place count 50 transition count 102
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 10 with 1 rules applied. Total rules applied 319 place count 50 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 320 place count 49 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 321 place count 49 transition count 100
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 12 with 2 rules applied. Total rules applied 323 place count 48 transition count 99
Applied a total of 323 rules in 79 ms. Remains 48 /182 variables (removed 134) and now considering 99/363 (removed 264) transitions.
// Phase 1: matrix 99 rows 48 cols
[2025-06-02 13:03:32] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 13:03:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:03:32] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:03:32] [INFO ] Redundant transitions in 31 ms returned [90, 92, 94]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 48 cols
[2025-06-02 13:03:32] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:03:32] [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/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:33] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 95/143 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/144 variables, and 76 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3885 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 95/143 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 92/168 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/144 variables, and 168 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4589 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8497ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 8498ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/182 places, 96/363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 94
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 46 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 45 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 45 transition count 91
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 45 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10 place count 44 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 10 place count 44 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 12 place count 43 transition count 89
Applied a total of 12 rules in 14 ms. Remains 43 /48 variables (removed 5) and now considering 89/96 (removed 7) transitions.
// Phase 1: matrix 89 rows 43 cols
[2025-06-02 13:03:41] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 13:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:03:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/182 places, 89/363 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 9009 ms. Remains : 43/182 places, 89/363 transitions.
[2025-06-02 13:03:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:03:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:03:41] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-02 13:03:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:03:41] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:03:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality2832609689948615368.gal : 3 ms
[2025-06-02 13:03:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16096857494445486366.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/CTLCardinality2832609689948615368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16096857494445486366.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,5149,0.105986,5780,2,930,5,6833,5,0,262,6778,0
Converting to forward existential form...Done !
original formula: E(((p9==0)||(p95==1)) U (p147!=0))
=> equivalent forward existential formula: [(FwdU(Init,((p9==0)||(p95==1))) * (p147!=0))] != FALSE
Hit Full ! (commute/partial/dont) 79/0/10
(forward)formula 0,1,0.201234,6804,1,0,10,9318,14,1,539,10908,4
FORMULA MedleyA-PT-16-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 155 transition count 321
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 155 transition count 321
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 155 transition count 312
Applied a total of 63 rules in 9 ms. Remains 155 /182 variables (removed 27) and now considering 312/363 (removed 51) transitions.
// Phase 1: matrix 312 rows 155 cols
[2025-06-02 13:03:41] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:42] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 13:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:03:42] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:03: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/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:47] [INFO ] Deduced a trap composed of 19 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 13:03:48] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:48] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:48] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:48] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:48] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:49] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:49] [INFO ] Deduced a trap composed of 101 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 13:03:50] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:50] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:50] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:50] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:52] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:53] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:56] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:57] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:57] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:03:58] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:00] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 312/467 variables, 155/183 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:07] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 184 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:15] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/185 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 311/496 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:36] [INFO ] Deduced a trap along path composed of 2 places in 130 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:36] [INFO ] Deduced a trap along path composed of 2 places in 130 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:04:36] [INFO ] Deduced a trap along path composed of 17 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 499 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 155/182 places, 312/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60609 ms. Remains : 155/182 places, 312/363 transitions.
[2025-06-02 13:04:42] [INFO ] Flatten gal took : 23 ms
[2025-06-02 13:04:42] [INFO ] Flatten gal took : 23 ms
[2025-06-02 13:04:42] [INFO ] Input system was already deterministic with 312 transitions.
[2025-06-02 13:04:42] [INFO ] Flatten gal took : 30 ms
[2025-06-02 13:04:42] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:04:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3702378477677484960.gal : 6 ms
[2025-06-02 13:04:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17835693300742622718.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/CTLCardinality3702378477677484960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17835693300742622718.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,5.72744e+06,1.45238,34020,2,8234,5,99966,6,0,934,128185,0
Converting to forward existential form...Done !
original formula: EG((AX(EF(((p11==0)&&(p116==1)))) * AG(((AG(((p25==0)&&(p155==1))) + (p96==0)) + (p79==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(E(TRUE U ((p11==0)&&(p116==1)))))) * !(E(TRUE U !(((!(E(TRUE U !(((p25==0)&&(p155==1))))) + (...190
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t24, t27, t28, t29, t31, t32, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...551
(forward)formula 0,0,25.1283,546116,1,0,714,3.51444e+06,655,355,7163,2.36443e+06,806
FORMULA MedleyA-PT-16-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 153 transition count 317
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 153 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 153 transition count 308
Applied a total of 67 rules in 8 ms. Remains 153 /182 variables (removed 29) and now considering 308/363 (removed 55) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:05:07] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:05:08] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 13:05:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:05:08] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:05: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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:13] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:13] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:14] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:14] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:14] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:14] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:14] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:15] [INFO ] Deduced a trap composed of 24 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 13:05:15] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:16] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:18] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:18] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:18] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:19] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:23] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:23] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:24] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:26] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:35] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:35] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:40] [INFO ] Deduced a trap composed of 93 places in 212 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:41] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:55] [INFO ] Deduced a trap along path composed of 2 places in 104 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:56] [INFO ] Deduced a trap along path composed of 2 places in 93 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:56] [INFO ] Deduced a trap along path composed of 17 places in 100 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:05:59] [INFO ] Deduced a trap along path composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:07] [INFO ] Deduced a trap along path composed of 28 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 498 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 308/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60440 ms. Remains : 153/182 places, 308/363 transitions.
[2025-06-02 13:06:08] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:06:08] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:06:08] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:06:08] [INFO ] Flatten gal took : 19 ms
[2025-06-02 13:06:08] [INFO ] Flatten gal took : 26 ms
[2025-06-02 13:06:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6554574509858497826.gal : 5 ms
[2025-06-02 13:06:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12233674758442145549.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/CTLCardinality6554574509858497826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12233674758442145549.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,5.44045e+06,1.33776,33136,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,1,5.45749,122264,1,0,563,591187,631,283,6730,461765,622
FORMULA MedleyA-PT-16-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 153 transition count 317
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 153 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 153 transition count 308
Applied a total of 67 rules in 5 ms. Remains 153 /182 variables (removed 29) and now considering 308/363 (removed 55) transitions.
[2025-06-02 13:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:06:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 13:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:06:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:19] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:20] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:21] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:21] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:22] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:24] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:24] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:24] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:25] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:29] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:29] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:30] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:33] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:42] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:42] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:47] [INFO ] Deduced a trap composed of 93 places in 177 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:06:47] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:02] [INFO ] Deduced a trap along path composed of 2 places in 108 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:02] [INFO ] Deduced a trap along path composed of 2 places in 123 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:02] [INFO ] Deduced a trap along path composed of 17 places in 119 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:06] [INFO ] Deduced a trap along path composed of 16 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 308/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60415 ms. Remains : 153/182 places, 308/363 transitions.
[2025-06-02 13:07:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:07:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:07:14] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:07:14] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:07:14] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:07:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1892410323065259978.gal : 3 ms
[2025-06-02 13:07:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10402789759419401428.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/CTLCardinality1892410323065259978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10402789759419401428.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,5.44045e+06,1.54299,33072,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: EX((AG(((p176==0)||(p120==1))) * (p17==1)))
=> equivalent forward existential formula: [((EY(Init) * (p17==1)) * !(E(TRUE U !(((p176==0)||(p120==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,16.5282,330180,1,0,616,2.06796e+06,639,311,6965,1.34668e+06,691
FORMULA MedleyA-PT-16-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 160 transition count 329
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 160 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 160 transition count 325
Applied a total of 48 rules in 5 ms. Remains 160 /182 variables (removed 22) and now considering 325/363 (removed 38) transitions.
// Phase 1: matrix 325 rows 160 cols
[2025-06-02 13:07:31] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:07:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 13:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:07:31] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2025-06-02 13:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:37] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:37] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:38] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:38] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:38] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:38] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:38] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:39] [INFO ] Deduced a trap composed of 86 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:39] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:40] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:40] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:40] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:40] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:40] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:41] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:41] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:43] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:44] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:44] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:44] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:44] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:45] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:48] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:49] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:51] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:54] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:07:55] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 160/485 variables, and 34 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/160 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:05] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/485 variables, 160/195 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 324/519 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:16] [INFO ] Deduced a trap composed of 97 places in 209 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:16] [INFO ] Deduced a trap composed of 101 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:08:16] [INFO ] Deduced a trap composed of 111 places in 182 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 522 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 160/182 places, 325/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 160/182 places, 325/363 transitions.
[2025-06-02 13:08:31] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:08:31] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:08:31] [INFO ] Input system was already deterministic with 325 transitions.
[2025-06-02 13:08:31] [INFO ] Flatten gal took : 13 ms
[2025-06-02 13:08:31] [INFO ] Flatten gal took : 15 ms
[2025-06-02 13:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4285670605359356691.gal : 5 ms
[2025-06-02 13:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3961147616746696701.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/CTLCardinality4285670605359356691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3961147616746696701.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,8.66288e+06,2.53243,62140,2,15136,5,184136,6,0,967,238873,0
Converting to forward existential form...Done !
original formula: A(!(((((AG(((p178==0)||(p72==1))) * EG(((p59==0)||(p185==1)))) + !(((p152==1)&&((p112==0)||(p23==1))))) * AG(((p132==1)&&(p48==0)))) * A(...265
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(EG(!(!(E((p41==1) U ((p54==0)||(p5==1))))))) U (p38==1)))))) * !(E(!(E(!(EG(!(!(E((p41==1) ...569
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t15, t19, t26, t27, t28, t30, t34, t35, t40, t44, t47, t51, t54, t56, t58, t59, t65,...611
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,24.5006,580252,1,0,1108,3.62793e+06,702,599,7605,2.87019e+06,1159
FORMULA MedleyA-PT-16-CTLCardinality-2025-06 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 : 182/182 places, 363/363 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 155 transition count 319
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 155 transition count 319
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 155 transition count 310
Applied a total of 63 rules in 4 ms. Remains 155 /182 variables (removed 27) and now considering 310/363 (removed 53) transitions.
// Phase 1: matrix 310 rows 155 cols
[2025-06-02 13:08:56] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:08:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 13:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:08:56] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:01] [INFO ] Deduced a trap composed of 21 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 13:09:02] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:02] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:02] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:02] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:02] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:03] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:03] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:03] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:03] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:04] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:04] [INFO ] Deduced a trap composed of 23 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 13:09:04] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:05] [INFO ] Deduced a trap composed of 35 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 13:09:05] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:05] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:05] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:05] [INFO ] Deduced a trap composed of 35 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:06] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:06] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:08] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/465 variables, 155/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:15] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:24] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 185 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:39] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:39] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:09:51] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 24 ms to minimize.
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 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 155/182 places, 310/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 155/182 places, 310/363 transitions.
[2025-06-02 13:09:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:09:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:09:57] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:09:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:09:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 13:09:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7063385522214404487.gal : 2 ms
[2025-06-02 13:09:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3802422465528739393.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/CTLCardinality7063385522214404487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3802422465528739393.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.69279e+06,1.28878,36052,2,8656,5,103532,6,0,932,147755,0
Converting to forward existential form...Done !
original formula: E(((p161==0)||(p28==1)) U !(AG(E(E(((p159==0)||(p180==1)) U ((p62==0)||(p118==1))) U EX(TRUE)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((p161==0)||(p28==1))),TRUE) * !(E(E(((p159==0)||(p180==1)) U ((p62==0)||(p118==1))) U EX(TRUE)...168
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t15, t19, t26, t27, t28, t30, t34, t35, t40, t44, t47, t51, t54, t56, t58, t59, t63,...562
(forward)formula 0,0,5.94226,134724,1,0,582,674922,643,293,6780,535851,641
FORMULA MedleyA-PT-16-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 153 transition count 317
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 153 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 153 transition count 308
Applied a total of 67 rules in 3 ms. Remains 153 /182 variables (removed 29) and now considering 308/363 (removed 55) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:10:03] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 13:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:10:03] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:08] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:09] [INFO ] Deduced a trap composed of 24 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 13:10:10] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:10] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:11] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:11] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:11] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:11] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:12] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:13] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:13] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:13] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:14] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:17] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:17] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:19] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:21] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:30] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:31] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 93 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:36] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:52] [INFO ] Deduced a trap along path composed of 2 places in 109 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:52] [INFO ] Deduced a trap along path composed of 2 places in 126 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:52] [INFO ] Deduced a trap along path composed of 17 places in 118 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:10:55] [INFO ] Deduced a trap along path composed of 16 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 47)
(t2 46)
(t3 86)
(t4 84)
(t5 85)
(t6 132)
(t7 85)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 47)
(t13 7)
(t14 6)
(t15 1)
(t16 0)
(t17 0)
(t18 0)
(t19 1)
(t20 1)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 1)
(t28 0)
(t29 0)
(t30 0)
(t31 1)
(t32 1)
(t33 0)
(t34 1)
(t35 1)
(t36 0)
(t37 0)
(t38 1)
(t39 1)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 1)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 54)
(t63 42)
(t64 1)
(t65 0)
(t66 0)
(t67 1)
(t68 1)
(t69 0)
(t70 4)
(t71 4)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 1)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 308/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 153/182 places, 308/363 transitions.
[2025-06-02 13:11:03] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:11:03] [INFO ] Flatten gal took : 8 ms
[2025-06-02 13:11:03] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:11:03] [INFO ] Flatten gal took : 17 ms
[2025-06-02 13:11:03] [INFO ] Flatten gal took : 14 ms
[2025-06-02 13:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5680248773354066248.gal : 3 ms
[2025-06-02 13:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality7804493788770086184.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/CTLCardinality5680248773354066248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7804493788770086184.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.44045e+06,1.24486,33108,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.2609,33108,1,0,6,98462,7,1,1244,124395,1
FORMULA MedleyA-PT-16-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Graph (trivial) has 189 edges and 182 vertex of which 13 / 182 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 171 transition count 324
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 143 transition count 320
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 141 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 140 transition count 319
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 65 place count 140 transition count 316
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 71 place count 137 transition count 316
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 96 place count 112 transition count 274
Iterating global reduction 4 with 25 rules applied. Total rules applied 121 place count 112 transition count 274
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 132 place count 112 transition count 263
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 110 transition count 263
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 134 place count 110 transition count 257
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 146 place count 104 transition count 257
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 148 place count 102 transition count 253
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 102 transition count 253
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 174 place count 90 transition count 241
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 176 place count 88 transition count 235
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 88 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 189 place count 88 transition count 224
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 189 place count 88 transition count 222
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 193 place count 86 transition count 222
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 199 place count 83 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 82 transition count 218
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 83 edges and 80 vertex of which 26 / 80 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 203 place count 64 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 245 place count 64 transition count 176
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 247 place count 62 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 249 place count 62 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 8 with 43 rules applied. Total rules applied 292 place count 62 transition count 116
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 8 with 4 rules applied. Total rules applied 296 place count 62 transition count 112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 300 place count 58 transition count 112
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 301 place count 57 transition count 109
Iterating global reduction 10 with 1 rules applied. Total rules applied 302 place count 57 transition count 109
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 10 with 4 rules applied. Total rules applied 306 place count 55 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 307 place count 55 transition count 106
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 10 with 1 rules applied. Total rules applied 308 place count 55 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 309 place count 54 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 310 place count 54 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 311 place count 54 transition count 104
Applied a total of 311 rules in 65 ms. Remains 54 /182 variables (removed 128) and now considering 104/363 (removed 259) transitions.
// Phase 1: matrix 104 rows 54 cols
[2025-06-02 13:11:04] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 13:11:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-02 13:11:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:11:05] [INFO ] Redundant transitions in 25 ms returned [98, 103]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 54 cols
[2025-06-02 13:11:05] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 13:11:05] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:05] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:06] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:06] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:06] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:07] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:07] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:07] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:07] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 101/155 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 22/91 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:09] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/156 variables, and 92 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7980 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 101/155 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 22/92 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 98/190 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:15] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:15] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:16] [INFO ] Deduced a trap along path composed of 11 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 13:11:17] [INFO ] Deduced a trap along path composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 155/156 variables, and 194 constraints, problems are : Problem set: 0 solved, 98 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38030ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 38031ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/182 places, 102/363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 52 transition count 100
Applied a total of 4 rules in 5 ms. Remains 52 /54 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 52 cols
[2025-06-02 13:11:43] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 13:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-02 13:11:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 52/182 places, 100/363 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 38449 ms. Remains : 52/182 places, 100/363 transitions.
[2025-06-02 13:11:43] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:11:43] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:11:43] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-02 13:11:43] [INFO ] Flatten gal took : 3 ms
[2025-06-02 13:11:43] [INFO ] Flatten gal took : 3 ms
[2025-06-02 13:11:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14599094155119040779.gal : 1 ms
[2025-06-02 13:11:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1330541076276350760.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/CTLCardinality14599094155119040779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1330541076276350760.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,10434,0.219174,10572,2,2385,5,22159,5,0,307,22581,0
Converting to forward existential form...Done !
original formula: EG((AF((p133==1)) + E((!(((p32==1) + A((p139==1) U (p52==1)))) + !(((p36==0)||(p194==1)))) U !(((p99==0)||(p183==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((p133==1)))) + E((!(((p32==1) + !((E(!((p52==1)) U (!((p139==1)) * !((p52==1)))) + EG(!((p52=...232
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t7, t11, t13, t15, t16, t18, t20, t21, t22, t24, t27, t28, t30, t32, t34, t37, t38, t...338
(forward)formula 0,0,2.55844,71616,1,0,364,411427,244,201,2395,331159,337
FORMULA MedleyA-PT-16-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 154 transition count 319
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 154 transition count 319
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 154 transition count 310
Applied a total of 65 rules in 4 ms. Remains 154 /182 variables (removed 28) and now considering 310/363 (removed 53) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:11:45] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 13:11:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:11:46] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:51] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:51] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:51] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:51] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:52] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:52] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:52] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:52] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:53] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:53] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:53] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:54] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:54] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:54] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:54] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:54] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:11:57] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:05] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:06] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:06] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:07] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:19] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:19] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:42] [INFO ] Deduced a trap along path composed of 2 places in 69 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:42] [INFO ] Deduced a trap along path composed of 17 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:42] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 154/182 places, 310/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60369 ms. Remains : 154/182 places, 310/363 transitions.
[2025-06-02 13:12:46] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:12:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 13:12:46] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:12:46] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:12:46] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:12:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11986759202908437376.gal : 5 ms
[2025-06-02 13:12:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18404579476553941125.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/CTLCardinality11986759202908437376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18404579476553941125.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,5.53244e+06,1.29479,32520,2,8251,5,96746,6,0,928,121571,0
Converting to forward existential form...Done !
original formula: AG((AX(EX(((p20==0)||(p111==1)))) * (p90==0)))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(EX(((p20==0)||(p111==1)))))] = FALSE * [(FwdU(Init,TRUE) * !((p90==0)))] = FALSE)
(forward)formula 0,0,1.29659,32520,1,0,8,96746,9,2,933,121571,1
FORMULA MedleyA-PT-16-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 155 transition count 320
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 155 transition count 320
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 155 transition count 311
Applied a total of 63 rules in 4 ms. Remains 155 /182 variables (removed 27) and now considering 311/363 (removed 52) transitions.
// Phase 1: matrix 311 rows 155 cols
[2025-06-02 13:12:47] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 13:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:12:47] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-02 13:12: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/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:53] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:53] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:53] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:53] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:54] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:54] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:54] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:54] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:55] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:55] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:55] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:55] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:56] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:56] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:56] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:56] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:57] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:58] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:58] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:59] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:59] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:12:59] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:00] [INFO ] Deduced a trap composed of 107 places in 181 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:04] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 311/466 variables, 155/186 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:13] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 187 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 311/466 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 310/497 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:27] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 498 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 155/182 places, 311/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60385 ms. Remains : 155/182 places, 311/363 transitions.
[2025-06-02 13:13:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:13:47] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:13:48] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-02 13:13:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 13:13:48] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:13:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12052565167686985431.gal : 3 ms
[2025-06-02 13:13:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12093476490354200681.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/CTLCardinality12052565167686985431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12093476490354200681.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,5.53244e+06,1.2596,32728,2,8103,5,97940,6,0,933,122435,0
Converting to forward existential form...Done !
original formula: EF((AX(AG((p22!=0))) + ((p92!=0)&&(p52!=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((p22!=0))))))))] != FALSE + [(FwdU(Init,TRUE) * ((p92!=0)&&(p52!=1)))] ...164
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...551
(forward)formula 0,1,5.77684,138860,1,0,580,691806,645,288,6996,513771,635
FORMULA MedleyA-PT-16-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 154 transition count 319
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 154 transition count 319
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 154 transition count 310
Applied a total of 65 rules in 3 ms. Remains 154 /182 variables (removed 28) and now considering 310/363 (removed 53) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:13:53] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 13:13:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:13:54] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:13: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/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:59] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:13:59] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:00] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:01] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:01] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:02] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:02] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:04] [INFO ] Deduced a trap composed of 35 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 13:14:04] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:05] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:05] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:05] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:08] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:09] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:09] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:10] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:12] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:12] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:14] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 310/464 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 185 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/185 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/494 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:36] [INFO ] Deduced a trap along path composed of 2 places in 127 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:36] [INFO ] Deduced a trap along path composed of 18 places in 119 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:14:36] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 154/182 places, 310/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 154/182 places, 310/363 transitions.
[2025-06-02 13:14:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:14:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:14:54] [INFO ] Input system was already deterministic with 310 transitions.
[2025-06-02 13:14:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:14:54] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality10033476031729422420.gal : 1 ms
[2025-06-02 13:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15762173312228644638.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/CTLCardinality10033476031729422420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15762173312228644638.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,6.01248e+06,1.11933,32428,2,8174,5,95459,6,0,928,120308,0
Converting to forward existential form...Done !
original formula: EF(EX(EF((EF(((p30==0)&&(p154==1))) + EX(((p160==0)&&(p20==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(FwdU(Init,TRUE)),TRUE),TRUE) * ((p30==0)&&(p154==1)))] != FALSE + [(EY(FwdU(EY(FwdU(Init,TRUE)),...197
(forward)formula 0,1,1.36943,32428,1,0,7,95459,9,1,1882,120308,4
FORMULA MedleyA-PT-16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 153 transition count 317
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 153 transition count 317
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 67 place count 153 transition count 308
Applied a total of 67 rules in 2 ms. Remains 153 /182 variables (removed 29) and now considering 308/363 (removed 55) transitions.
// Phase 1: matrix 308 rows 153 cols
[2025-06-02 13:14:55] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 13:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:14:55] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2025-06-02 13:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:01] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:02] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:02] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:02] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:02] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:03] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:04] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:04] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:04] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:04] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:06] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:06] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:06] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:10] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:10] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:12] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:14] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 308/461 variables, 153/182 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:23] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:23] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 184 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:28] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:29] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 308/461 variables, 153/186 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 307/493 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:45] [INFO ] Deduced a trap along path composed of 2 places in 110 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:45] [INFO ] Deduced a trap along path composed of 2 places in 119 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:45] [INFO ] Deduced a trap along path composed of 17 places in 129 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:48] [INFO ] Deduced a trap along path composed of 16 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 308/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60384 ms. Remains : 153/182 places, 308/363 transitions.
[2025-06-02 13:15:56] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:15:56] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:15:56] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 13:15:56] [INFO ] Flatten gal took : 6 ms
[2025-06-02 13:15:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 13:15:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10400094734940141078.gal : 2 ms
[2025-06-02 13:15:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3651917399724193726.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/CTLCardinality10400094734940141078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3651917399724193726.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,5.44045e+06,1.18185,33168,2,8255,5,98462,6,0,922,124395,0
Converting to forward existential form...Done !
original formula: EF(((p178==1) + EX((p63==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p178==1))] != FALSE + [(EY(FwdU(Init,TRUE)) * (p63==1))] != FALSE)
(forward)formula 0,1,1.18402,33168,1,0,7,98462,8,1,925,124395,1
FORMULA MedleyA-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 182/182 places, 363/363 transitions.
Graph (trivial) has 198 edges and 182 vertex of which 13 / 182 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 171 transition count 323
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 142 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 140 transition count 319
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 140 transition count 315
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 136 transition count 315
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 100 place count 109 transition count 270
Iterating global reduction 3 with 27 rules applied. Total rules applied 127 place count 109 transition count 270
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 138 place count 109 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 107 transition count 259
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 140 place count 107 transition count 254
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 150 place count 102 transition count 254
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 100 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 100 transition count 250
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 182 place count 86 transition count 236
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 186 place count 82 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 82 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 203 place count 82 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 203 place count 82 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 81 transition count 211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 215 place count 76 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 216 place count 75 transition count 205
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 219 place count 57 transition count 205
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 261 place count 57 transition count 163
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 263 place count 55 transition count 146
Iterating global reduction 7 with 2 rules applied. Total rules applied 265 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 306 place count 55 transition count 105
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 7 with 5 rules applied. Total rules applied 311 place count 55 transition count 100
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 317 place count 50 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 318 place count 49 transition count 99
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 320 place count 47 transition count 94
Iterating global reduction 10 with 2 rules applied. Total rules applied 322 place count 47 transition count 94
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 10 with 4 rules applied. Total rules applied 326 place count 45 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 330 place count 45 transition count 88
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 10 with 1 rules applied. Total rules applied 331 place count 45 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 333 place count 44 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 334 place count 43 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 334 place count 43 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 336 place count 42 transition count 85
Applied a total of 336 rules in 44 ms. Remains 42 /182 variables (removed 140) and now considering 85/363 (removed 278) transitions.
// Phase 1: matrix 85 rows 42 cols
[2025-06-02 13:15:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 13:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:15:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:15:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:15:57] [INFO ] Redundant transitions in 16 ms returned [84]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 79 sub problems to find dead transitions.
// Phase 1: matrix 84 rows 42 cols
[2025-06-02 13:15:57] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:15:57] [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/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:57] [INFO ] Deduced a trap composed of 9 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 13:15:57] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:58] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:15:59] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 83/125 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:01] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/125 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 71 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 83/125 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 79/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:04] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 151 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5781 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11192ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/182 places, 84/363 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 82
Applied a total of 4 rules in 3 ms. Remains 40 /42 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 40 cols
[2025-06-02 13:16:08] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 13:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 13:16:08] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/182 places, 82/363 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 11660 ms. Remains : 40/182 places, 82/363 transitions.
[2025-06-02 13:16:08] [INFO ] Flatten gal took : 3 ms
[2025-06-02 13:16:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:16:08] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-02 13:16:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:16:08] [INFO ] Flatten gal took : 4 ms
[2025-06-02 13:16:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality15462389402448730480.gal : 0 ms
[2025-06-02 13:16:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality14409419765370816815.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/CTLCardinality15462389402448730480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14409419765370816815.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,3567,0.080811,5240,2,691,5,5156,5,0,242,4225,0
Converting to forward existential form...Done !
original formula: E((p42==0) U AG(EF(AG(!(((p117==0)||(p174==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,(p42==0)) * !(E(TRUE U !(E(TRUE U !(E(TRUE U !(!(((p117==0)||(p174==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t9, t11, t14, t15, t17, t19, t21, t56, t58, t59, t61, t67, t71, t80, t81, In...250
(forward)formula 0,0,0.463538,13176,1,0,180,41720,182,84,1976,30319,176
FORMULA MedleyA-PT-16-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 13:16:09] [INFO ] Flatten gal took : 11 ms
[2025-06-02 13:16:09] [INFO ] Flatten gal took : 11 ms
Total runtime 899901 ms.
BK_STOP 1748870169579
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-16"
export BK_EXAMINATION="CTLCardinality"
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-16, examination is CTLCardinality"
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-174876524100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;