Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000153.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-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 90K 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-08-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-08-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748849506385

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 07:31:48] [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 07:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:31:49] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-06-02 07:31:49] [INFO ] Transformed 147 places.
[2025-06-02 07:31:49] [INFO ] Transformed 312 transitions.
[2025-06-02 07:31:49] [INFO ] Found NUPN structural information;
[2025-06-02 07:31:49] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Support contains 90 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 293
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 129 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 129 transition count 290
Applied a total of 37 rules in 82 ms. Remains 129 /147 variables (removed 18) and now considering 290/312 (removed 22) transitions.
// Phase 1: matrix 290 rows 129 cols
[2025-06-02 07:31:49] [INFO ] Computed 11 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:31:50] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-02 07:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:31:50] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-02 07:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/129 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:56] [INFO ] Deduced a trap composed of 22 places in 357 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:57] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:57] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:57] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:57] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:58] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:58] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:58] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:59] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:59] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:31:59] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 11/22 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:02] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/23 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/23 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 290/419 variables, 129/152 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:10] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 1/153 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/153 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/419 variables, and 154 constraints, problems are : Problem set: 48 solved, 241 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 3/129 variables, 6/11 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 12/23 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:22] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/24 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:24] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:24] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:24] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/27 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 290/419 variables, 129/156 constraints. Problems are: Problem set: 48 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 241/397 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:30] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/398 constraints. Problems are: Problem set: 48 solved, 241 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:37] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:40] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:40] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:40] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:44] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 5/403 constraints. Problems are: Problem set: 48 solved, 241 unsolved
SMT process timed out in 60751ms, After SMT, problems are : Problem set: 48 solved, 241 unsolved
Search for dead transitions found 48 dead transitions in 60799ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/147 places, 242/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61953 ms. Remains : 129/147 places, 242/312 transitions.
Support contains 90 out of 129 places after structural reductions.
[2025-06-02 07:32:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 07:32:51] [INFO ] Flatten gal took : 114 ms
FORMULA MedleyA-PT-08-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:32:51] [INFO ] Flatten gal took : 55 ms
[2025-06-02 07:32:52] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 84 out of 129 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (1992 resets) in 1996 ms. (20 steps per ms) remains 25/60 properties
BEST_FIRST walk for 4003 steps (48 resets) in 58 ms. (67 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (51 resets) in 61 ms. (64 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (57 resets) in 59 ms. (66 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 81 ms. (48 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 69 ms. (57 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (52 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (55 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (53 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (56 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (49 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (54 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (49 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (55 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (56 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (51 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (53 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (55 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (55 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (55 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
// Phase 1: matrix 242 rows 129 cols
[2025-06-02 07:32:53] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 59/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 22/129 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 242/371 variables, 129/140 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/371 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 140 constraints, problems are : Problem set: 0 solved, 25 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/107 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:54] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 4 (OVERLAPS) 22/129 variables, 5/13 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:54] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:54] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:54] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 6 ms to minimize.
Problem AtomicPropp16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:55] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 5/18 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 242/371 variables, 129/147 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 22/169 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:57] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:57] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:57] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:58] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:58] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 24 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 4/174 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 174 constraints, problems are : Problem set: 3 solved, 22 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 22/25 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5914ms problems are : Problem set: 3 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 122 transition count 219
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 34 place count 112 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 111 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 35 place count 111 transition count 213
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 41 place count 108 transition count 213
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 51 place count 98 transition count 198
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 98 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 61 place count 98 transition count 197
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 97 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 95 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 95 transition count 191
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 81 place count 88 transition count 184
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 86 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 86 transition count 182
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 83 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 3 with 31 rules applied. Total rules applied 122 place count 83 transition count 176
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 83 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 82 transition count 175
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 82 transition count 175
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 82 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 81 transition count 174
Applied a total of 127 rules in 151 ms. Remains 81 /129 variables (removed 48) and now considering 174/242 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 81/129 places, 174/242 transitions.
RANDOM walk for 40000 steps (3421 resets) in 592 ms. (67 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40004 steps (770 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (748 resets) in 153 ms. (259 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (768 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (788 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
// Phase 1: matrix 174 rows 81 cols
[2025-06-02 07:32:59] [INFO ] Computed 10 invariants in 5 ms
[2025-06-02 07:32:59] [INFO ] State equation strengthened by 12 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/70 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:32:59] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 168/238 variables, 70/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/251 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/254 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/255 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/255 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 104 constraints, problems are : Problem set: 0 solved, 3 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/70 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:00] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 168/238 variables, 70/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:00] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/251 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/254 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/254 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/254 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 1/255 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/255 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/255 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 109 constraints, problems are : Problem set: 0 solved, 3 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1319ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 191 ms.
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 174/174 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 81 transition count 164
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 71 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 71 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 70 transition count 162
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 29 place count 64 transition count 153
Iterating global reduction 3 with 6 rules applied. Total rules applied 35 place count 64 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 35 place count 64 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 63 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 62 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 62 transition count 149
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 59 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 54 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 53 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 53 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 52 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 52 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 77 place count 52 transition count 149
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 51 transition count 157
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 81 place count 51 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 51 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 49 transition count 153
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 88 place count 49 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 91 place count 46 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 115 place count 46 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 44 transition count 196
Applied a total of 117 rules in 119 ms. Remains 44 /81 variables (removed 37) and now considering 196/174 (removed -22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 44/81 places, 196/174 transitions.
RANDOM walk for 40000 steps (66 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (43 resets) in 151 ms. (263 steps per ms) remains 1/2 properties
[2025-06-02 07:33:01] [INFO ] Flow matrix only has 184 transitions (discarded 12 similar events)
// Phase 1: matrix 184 rows 44 cols
[2025-06-02 07:33:01] [INFO ] Computed 11 invariants in 3 ms
[2025-06-02 07:33:01] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/30 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/33 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:01] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 178/214 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 14/228 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/228 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 76 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/30 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/33 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 178/214 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 14/228 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 196/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 42 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 41 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 41 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 40 transition count 193
Applied a total of 7 rules in 19 ms. Remains 40 /44 variables (removed 4) and now considering 193/196 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 40/44 places, 193/196 transitions.
RANDOM walk for 40000 steps (46 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (46 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5949 steps, run visited all 1 properties in 54 ms. (steps per millisecond=110 )
Probabilistic random walk after 5949 steps, saw 1859 distinct states, run finished after 61 ms. (steps per millisecond=97 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2025-06-02 07:33:02] [INFO ] Flatten gal took : 34 ms
[2025-06-02 07:33:02] [INFO ] Flatten gal took : 37 ms
[2025-06-02 07:33:02] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 101 transition count 207
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 101 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 101 transition count 204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 95 transition count 187
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 95 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 92 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 92 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 91 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 91 transition count 177
Applied a total of 77 rules in 23 ms. Remains 91 /129 variables (removed 38) and now considering 177/242 (removed 65) transitions.
// Phase 1: matrix 177 rows 91 cols
[2025-06-02 07:33:02] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:33:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-02 07:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:33:02] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-02 07:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:05] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:05] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/268 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:09] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:13] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 105 constraints, problems are : Problem set: 0 solved, 176 unsolved in 16969 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/268 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 176/279 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:22] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:22] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:28] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:33:28] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 285 constraints, problems are : Problem set: 0 solved, 176 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47088ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 47090ms
Starting structural reductions in LTL mode, iteration 1 : 91/129 places, 177/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47400 ms. Remains : 91/129 places, 177/242 transitions.
[2025-06-02 07:33:49] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:33:49] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:33:49] [INFO ] Input system was already deterministic with 177 transitions.
[2025-06-02 07:33:49] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:33:50] [INFO ] Flatten gal took : 19 ms
[2025-06-02 07:33:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6936391516220964223.gal : 8 ms
[2025-06-02 07:33:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality15516631354207214468.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/CTLCardinality6936391516220964223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15516631354207214468.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.73743e+06,1.44214,39652,2,5803,5,111494,6,0,541,167264,0


Converting to forward existential form...Done !
original formula: EX(EG((EF((p49==1)) + (p116==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U (p49==1)) + (p116==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t30, t31, t3...455
Detected timeout of ITS tools.
[2025-06-02 07:34:20] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:34:20] [INFO ] Applying decomposition
[2025-06-02 07:34:20] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4844603091484666517.txt' '-o' '/tmp/graph4844603091484666517.bin' '-w' '/tmp/graph4844603091484666517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4844603091484666517.bin' '-l' '-1' '-v' '-w' '/tmp/graph4844603091484666517.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:34:20] [INFO ] Decomposing Gal with order
[2025-06-02 07:34:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:34:20] [INFO ] Removed a total of 310 redundant transitions.
[2025-06-02 07:34:20] [INFO ] Flatten gal took : 116 ms
[2025-06-02 07:34:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 20 ms.
[2025-06-02 07:34:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality1617047999278187327.gal : 10 ms
[2025-06-02 07:34:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality4754577619645659804.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/CTLCardinality1617047999278187327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4754577619645659804.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.73743e+06,0.610721,14992,452,158,18919,1081,374,48944,90,9475,0


Converting to forward existential form...Done !
original formula: EX(EG((EF((i3.u10.p49==1)) + (i5.u20.p116==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),(E(TRUE U (i3.u10.p49==1)) + (i5.u20.p116==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t58, t87, t91, i1.u4.t83, i2.t76, i2.t73, i2.t72, i2.u5.t56, i2.u5.t81, i2.u5.t82, i2.u6...752
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,12.5743,291068,1,0,491022,4821,2229,1.30652e+06,442,40114,466444
FORMULA MedleyA-PT-08-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 121 transition count 218
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 46 place count 101 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 46 place count 101 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 99 transition count 211
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 68 place count 81 transition count 184
Iterating global reduction 2 with 18 rules applied. Total rules applied 86 place count 81 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 81 transition count 183
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 88 place count 80 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 74 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 74 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 71 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 71 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 70 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 70 transition count 156
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 134 place count 56 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 52 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 52 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 52 transition count 131
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 147 place count 52 transition count 128
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 49 transition count 128
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 2 with 4 rules applied. Total rules applied 157 place count 47 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 46 transition count 125
Applied a total of 158 rules in 47 ms. Remains 46 /129 variables (removed 83) and now considering 125/242 (removed 117) transitions.
// Phase 1: matrix 125 rows 46 cols
[2025-06-02 07:34:33] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:34:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 07:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:34:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:34:33] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:34:33] [INFO ] Redundant transitions in 24 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-02 07:34:33] [INFO ] Invariant cache hit.
[2025-06-02 07:34:33] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:34:34] [INFO ] Deduced a trap composed of 7 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 07:34:34] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 124/169 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 2/171 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/171 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 66 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6304 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/45 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 124/169 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 114/179 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 2/171 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/171 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 183 constraints, problems are : Problem set: 0 solved, 117 unsolved in 10117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16507ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 16508ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/129 places, 125/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16744 ms. Remains : 46/129 places, 125/242 transitions.
[2025-06-02 07:34:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:34:49] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:34:49] [INFO ] Input system was already deterministic with 125 transitions.
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:34:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15619594180693798907.gal : 3 ms
[2025-06-02 07:34:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1935536134114365306.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/CTLCardinality15619594180693798907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1935536134114365306.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,258030,0.212485,7812,2,434,5,15088,6,0,298,18737,0


Converting to forward existential form...Done !
original formula: AF((p79==1))
=> equivalent forward existential formula: [FwdG(Init,!((p79==1)))] = FALSE
Hit Full ! (commute/partial/dont) 123/0/2
(forward)formula 0,0,0.395073,10244,1,0,9,29043,20,4,1980,25150,8
FORMULA MedleyA-PT-08-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 121 transition count 220
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 44 place count 103 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 101 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 101 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 99 transition count 211
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 69 place count 80 transition count 183
Iterating global reduction 3 with 19 rules applied. Total rules applied 88 place count 80 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 88 place count 80 transition count 181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 78 transition count 181
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 73 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 73 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 71 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 71 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 70 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 70 transition count 161
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 129 place count 59 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 55 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 55 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 55 transition count 138
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 142 place count 55 transition count 135
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 52 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 50 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 49 transition count 132
Applied a total of 153 rules in 50 ms. Remains 49 /129 variables (removed 80) and now considering 132/242 (removed 110) transitions.
// Phase 1: matrix 132 rows 49 cols
[2025-06-02 07:34:50] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:34:50] [INFO ] Implicit Places using invariants in 86 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/129 places, 132/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 148 ms. Remains : 48/129 places, 132/242 transitions.
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:34:50] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:34:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:34:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12989989270618697581.gal : 6 ms
[2025-06-02 07:34:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14807930345175879088.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/CTLCardinality12989989270618697581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14807930345175879088.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,285308,0.33113,9540,2,695,5,18956,6,0,314,28968,0


Converting to forward existential form...Done !
original formula: AG(AF((AG(((p52==0)||(p87==1))) + !(E((p38==0) U (p145==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(E(TRUE U !(((p52==0)||(p87==1))))) + !(E((p38==0) U (p145==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t17, t19, t20, t21, t22, t23, t24...333
(forward)formula 0,0,2.72541,71036,1,0,353,353274,297,141,3076,383029,407
FORMULA MedleyA-PT-08-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 103 transition count 211
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 103 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 103 transition count 208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 97 transition count 192
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 97 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 95 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 95 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 94 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 94 transition count 185
Applied a total of 71 rules in 7 ms. Remains 94 /129 variables (removed 35) and now considering 185/242 (removed 57) transitions.
// Phase 1: matrix 185 rows 94 cols
[2025-06-02 07:34:53] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:34:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 07:34:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:34:53] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-02 07:34:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:34:56] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:34:56] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:34:56] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:34:56] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/279 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:35:01] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:35:02] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/279 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 110 constraints, problems are : Problem set: 0 solved, 184 unsolved in 16435 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/279 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 184/292 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 294 constraints, problems are : Problem set: 0 solved, 184 unsolved in 26575 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43094ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 43095ms
Starting structural reductions in LTL mode, iteration 1 : 94/129 places, 185/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43328 ms. Remains : 94/129 places, 185/242 transitions.
[2025-06-02 07:35:36] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:35:36] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:35:36] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-02 07:35:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:35:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:35:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6580787319348286432.gal : 3 ms
[2025-06-02 07:35:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17546493418849220313.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/CTLCardinality6580787319348286432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17546493418849220313.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,6.30136e+06,1.31898,36976,2,4968,5,99050,6,0,561,166412,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((!(E(((p38==0)||(p59==1)) U (p88==1))) * ((p41==0)||((p91==0)&&(p40==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((!(E(((p38==0)||(p59==1)) U (p88==1))) * ((p41==0)||((p91==0)&&(p40==1))))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...484
Detected timeout of ITS tools.
[2025-06-02 07:36:06] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:36:06] [INFO ] Applying decomposition
[2025-06-02 07:36:06] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4767262366196545952.txt' '-o' '/tmp/graph4767262366196545952.bin' '-w' '/tmp/graph4767262366196545952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4767262366196545952.bin' '-l' '-1' '-v' '-w' '/tmp/graph4767262366196545952.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:36:06] [INFO ] Decomposing Gal with order
[2025-06-02 07:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:36:06] [INFO ] Removed a total of 331 redundant transitions.
[2025-06-02 07:36:07] [INFO ] Flatten gal took : 25 ms
[2025-06-02 07:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2025-06-02 07:36:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11998216270226585558.gal : 3 ms
[2025-06-02 07:36:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9168554231001384673.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/CTLCardinality11998216270226585558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9168554231001384673.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.30136e+06,0.38127,15288,431,147,19249,2031,413,45241,102,11912,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((!(E(((i2.u8.p38==0)||(i3.u10.p59==1)) U (i4.u14.p88==1))) * ((i3.u10.p41==0)||((i5.u15.p91==0)&&(i3.u10.p40==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((!(E(((i2.u8.p38==0)||(i3.u10.p59==1)) U (i4.u14.p88==1))) * ((i3.u10.p41==0)||((i5...202
Reverse transition relation is NOT exact ! Due to transitions t26, t91, t95, t179, t180, t181, t182, i1.u4.t87, i2.t80, i2.t77, i2.t76, i2.u5.t53, i2.u5.t8...806
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,26.7102,629204,1,0,993872,8426,2565,2.67808e+06,505,90888,1170231
FORMULA MedleyA-PT-08-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 102 transition count 208
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 102 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 102 transition count 205
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 97 transition count 187
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 97 transition count 187
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 94 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 94 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 92 transition count 174
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 92 transition count 174
Applied a total of 75 rules in 9 ms. Remains 92 /129 variables (removed 37) and now considering 174/242 (removed 68) transitions.
// Phase 1: matrix 174 rows 92 cols
[2025-06-02 07:36:33] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:36:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-02 07:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:36:34] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-02 07:36:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:36] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:36] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:37] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:37] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/266 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:41] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:47] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/266 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 108 constraints, problems are : Problem set: 0 solved, 173 unsolved in 17502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/266 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 173/279 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:55] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:36:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:37:02] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:37:02] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:37:06] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 286 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47615ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 47616ms
Starting structural reductions in LTL mode, iteration 1 : 92/129 places, 174/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47862 ms. Remains : 92/129 places, 174/242 transitions.
[2025-06-02 07:37:21] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:37:21] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:37:21] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-02 07:37:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:37:21] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:37:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7404913274671019053.gal : 6 ms
[2025-06-02 07:37:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13466913550024243442.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/CTLCardinality7404913274671019053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13466913550024243442.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.37801e+06,1.49549,35188,2,5757,5,100669,6,0,542,138958,0


Converting to forward existential form...Done !
original formula: AF(((EG((p27==1)) + EF(AG(((p7==0)||(p89==1))))) + ((EX(TRUE) * (p29==1)) * ((p89==0)&&(p70==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG((p27==1)) + E(TRUE U !(E(TRUE U !(((p7==0)||(p89==1))))))) + ((EX(TRUE) * (p29==1)) * ((p89==0...180
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t31, t32, t34, t3...415
(forward)formula 0,1,23.4269,550716,1,0,714,3.348e+06,383,289,4801,2.43863e+06,826
FORMULA MedleyA-PT-08-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 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 121 transition count 223
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 37 place count 106 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 105 transition count 217
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 38 place count 105 transition count 215
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 103 transition count 215
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 57 place count 88 transition count 193
Iterating global reduction 3 with 15 rules applied. Total rules applied 72 place count 88 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 88 transition count 192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 87 transition count 192
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 84 transition count 186
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 84 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 83 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 83 transition count 183
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 102 place count 73 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 70 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 70 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 70 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 111 place count 70 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 69 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 68 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 67 transition count 162
Applied a total of 116 rules in 38 ms. Remains 67 /129 variables (removed 62) and now considering 162/242 (removed 80) transitions.
// Phase 1: matrix 162 rows 67 cols
[2025-06-02 07:37:45] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:37:45] [INFO ] Implicit Places using invariants in 62 ms returned [6, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 73 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/129 places, 162/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 115 ms. Remains : 65/129 places, 162/242 transitions.
[2025-06-02 07:37:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:37:45] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:37:45] [INFO ] Input system was already deterministic with 162 transitions.
[2025-06-02 07:37:45] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:37:45] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:37:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8473671412342111059.gal : 2 ms
[2025-06-02 07:37:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8968531710950793431.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/CTLCardinality8473671412342111059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8968531710950793431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.70483e+06,0.936636,22012,2,2489,5,51131,6,0,412,101664,0


Converting to forward existential form...Done !
original formula: AG((((!(E((((p127==0)||(p133==1))&&((p29==0)||(p46==1))) U ((p11==1)&&((p99==0)||(p29==1))))) + AF(((p29!=0)&&(p111!=1)))) + ((p22==1)||(...251
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((p93==1)||(((p96==0)&&(p107==0))&&(((p33==0)||(p128==1))&&((p49==0)||(p69==1))))))...312
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t9, t11, t12, t13, t14, t15, t16, t17, t19, t20, t22, t23, t24, t...421
Hit Full ! (commute/partial/dont) 148/0/14
(forward)formula 0,0,15.8066,384240,1,0,558,2.35604e+06,359,230,3862,2.24283e+06,576
FORMULA MedleyA-PT-08-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 103 transition count 212
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 103 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 103 transition count 209
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 98 transition count 193
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 98 transition count 193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 95 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 95 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 93 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 93 transition count 180
Applied a total of 73 rules in 6 ms. Remains 93 /129 variables (removed 36) and now considering 180/242 (removed 62) transitions.
// Phase 1: matrix 180 rows 93 cols
[2025-06-02 07:38:01] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:38:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 07:38:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:38:01] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-06-02 07:38:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:04] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:04] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/273 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:09] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:10] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:12] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 108 constraints, problems are : Problem set: 0 solved, 179 unsolved in 18614 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/273 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 179/285 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:33] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:38:33] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/273 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 289 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 48710ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 48712ms
Starting structural reductions in LTL mode, iteration 1 : 93/129 places, 180/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49010 ms. Remains : 93/129 places, 180/242 transitions.
[2025-06-02 07:38:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:38:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:38:50] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-02 07:38:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:38:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:38:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality17053818949867551307.gal : 1 ms
[2025-06-02 07:38:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14708403053829675837.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/CTLCardinality17053818949867551307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14708403053829675837.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.71004e+06,1.80672,40008,2,6486,5,112251,6,0,552,163954,0


Converting to forward existential form...Done !
original formula: (!(A(E(E(((p69==0)||(p106==1)) U (p98==1)) U (p24!=0)) U ((AG(((p87==0)||(p99==1))) * (p103!=1)) * A(((p64==0)||(p138==1)) U ((p99==0)||(...191
=> equivalent forward existential formula: ([((Init * !(EG(!(((!(E(TRUE U !(((p87==0)||(p99==1))))) * (p103!=1)) * !((E(!(((p99==0)||(p8==1))) U (!(((p64==...701
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t34, t3...473
Detected timeout of ITS tools.
[2025-06-02 07:39:20] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:39:20] [INFO ] Applying decomposition
[2025-06-02 07:39:20] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5263979769430369537.txt' '-o' '/tmp/graph5263979769430369537.bin' '-w' '/tmp/graph5263979769430369537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5263979769430369537.bin' '-l' '-1' '-v' '-w' '/tmp/graph5263979769430369537.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:39:20] [INFO ] Decomposing Gal with order
[2025-06-02 07:39:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:39:20] [INFO ] Removed a total of 320 redundant transitions.
[2025-06-02 07:39:20] [INFO ] Flatten gal took : 30 ms
[2025-06-02 07:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 10 ms.
[2025-06-02 07:39:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14174333761033746583.gal : 4 ms
[2025-06-02 07:39:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18216044782191356219.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/CTLCardinality14174333761033746583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18216044782191356219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71004e+06,0.47255,14516,430,160,18301,1276,380,40027,103,11351,0


Converting to forward existential form...Done !
original formula: (!(A(E(E(((i4.u13.p69==0)||(i6.u19.p106==1)) U (i5.u15.p98==1)) U (i1.u4.p24!=0)) U ((AG(((i4.u14.p87==0)||(i5.u17.p99==1))) * (i6.u19.p1...273
=> equivalent forward existential formula: ([((Init * !(EG(!(((!(E(TRUE U !(((i4.u14.p87==0)||(i5.u17.p99==1))))) * (i6.u19.p103!=1)) * !((E(!(((i5.u17.p99...957
Reverse transition relation is NOT exact ! Due to transitions t26, t58, t85, t90, t156, t157, t158, t159, i1.u4.t79, i1.u4.t80, i2.t73, i2.t69, i2.t68, i2....707
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,13.0124,311532,1,0,466508,11900,2356,1.25166e+06,525,109998,546226
FORMULA MedleyA-PT-08-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 242
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 103 transition count 211
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 103 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 103 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 97 transition count 192
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 97 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 95 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 95 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 93 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 93 transition count 182
Applied a total of 73 rules in 4 ms. Remains 93 /129 variables (removed 36) and now considering 182/242 (removed 60) transitions.
// Phase 1: matrix 182 rows 93 cols
[2025-06-02 07:39:33] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:39:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 07:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:39:34] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-02 07:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:39:35] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:39:36] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:39:40] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:39:41] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 1/275 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 107 constraints, problems are : Problem set: 0 solved, 181 unsolved in 17035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/274 variables, 92/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 179/283 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 1/275 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 288 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47131ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 47132ms
Starting structural reductions in LTL mode, iteration 1 : 93/129 places, 182/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47359 ms. Remains : 93/129 places, 182/242 transitions.
[2025-06-02 07:40:21] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:40:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:40:21] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-02 07:40:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:40:21] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:40:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1793741770991573992.gal : 2 ms
[2025-06-02 07:40:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality17629503865232898936.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/CTLCardinality1793741770991573992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17629503865232898936.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,6.21912e+06,1.48233,39496,2,5914,5,109905,6,0,552,163974,0


Converting to forward existential form...Done !
original formula: (EF((p27==1)) * A(A(((p103==0)||(p16==1)) U ((p98==0)&&(p2==0))) U (AF((p132==1)) * AX(EX(((p53==0)&&((p97==0)||(p26==1))))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U (p27==1))) * !(EG(!((!(EG(!((p132==1)))) * !(EX(!(EX(((p53==0)&&((p97==0)||(p26==1))))))))))...447
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t34, t35, t...494
Detected timeout of ITS tools.
[2025-06-02 07:40:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:40:51] [INFO ] Applying decomposition
[2025-06-02 07:40:51] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17459110993156510444.txt' '-o' '/tmp/graph17459110993156510444.bin' '-w' '/tmp/graph17459110993156510444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17459110993156510444.bin' '-l' '-1' '-v' '-w' '/tmp/graph17459110993156510444.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:40:51] [INFO ] Decomposing Gal with order
[2025-06-02 07:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:40:51] [INFO ] Removed a total of 315 redundant transitions.
[2025-06-02 07:40:51] [INFO ] Flatten gal took : 30 ms
[2025-06-02 07:40:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2025-06-02 07:40:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15966532534232904618.gal : 5 ms
[2025-06-02 07:40:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4630271509980115850.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/CTLCardinality15966532534232904618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4630271509980115850.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.21912e+06,0.39919,14516,406,230,17225,1717,361,42053,100,18309,0


Converting to forward existential form...Done !
original formula: (EF((i1.u2.p27==1)) * A(A(((i6.u18.p103==0)||(i3.u3.p16==1)) U ((i5.u14.p98==0)&&(i0.u1.p2==0))) U (AF((i7.i1.u22.p132==1)) * AX(EX(((i3....206
=> equivalent forward existential formula: [(((Init * E(TRUE U (i1.u2.p27==1))) * !(EG(!((!(EG(!((i7.i1.u22.p132==1)))) * !(EX(!(EX(((i3.u9.p53==0)&&((i5.u...592
Reverse transition relation is NOT exact ! Due to transitions t26, t58, t88, t92, t162, t163, t164, t165, i1.u4.t84, i2.t77, i2.t74, i2.t73, i2.u5.t56, i2....802
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,10.9898,262012,1,0,375899,18427,2329,1.10248e+06,560,210295,428000
FORMULA MedleyA-PT-08-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 103 transition count 209
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 103 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 103 transition count 207
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 97 transition count 190
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 97 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 94 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 94 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 93 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 93 transition count 180
Applied a total of 72 rules in 8 ms. Remains 93 /129 variables (removed 36) and now considering 180/242 (removed 62) transitions.
// Phase 1: matrix 180 rows 93 cols
[2025-06-02 07:41:02] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:41:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 07:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:41:02] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-06-02 07:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:05] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:05] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/273 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:09] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:10] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 107 constraints, problems are : Problem set: 0 solved, 179 unsolved in 13927 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:17] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/273 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 179/285 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:24] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:41:28] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 290 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44021ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 44024ms
Starting structural reductions in LTL mode, iteration 1 : 93/129 places, 180/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44321 ms. Remains : 93/129 places, 180/242 transitions.
[2025-06-02 07:41:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:41:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:41:46] [INFO ] Input system was already deterministic with 180 transitions.
[2025-06-02 07:41:46] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:41:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:41:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10969200818456673775.gal : 2 ms
[2025-06-02 07:41:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality12656284583795095151.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/CTLCardinality10969200818456673775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12656284583795095151.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.54039e+06,1.57179,38664,2,6617,5,110468,6,0,552,171747,0


Converting to forward existential form...Done !
original formula: AF(((AF(AG(((p114==0)&&(p60==1)))) * (p86==0)) * ((p16==1) * (AX(((p35==0)||(p127==1))) + A((p92==0) U ((p82==0)||(p35==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E(TRUE U !(((p114==0)&&(p60==1)))))))) * (p86==0)) * ((p16==1) * (!(EX(!(((p35==0)||(p12...284
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t29, t31, t32, t3...475
Detected timeout of ITS tools.
[2025-06-02 07:42:16] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:42:16] [INFO ] Applying decomposition
[2025-06-02 07:42:16] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5628985687202828885.txt' '-o' '/tmp/graph5628985687202828885.bin' '-w' '/tmp/graph5628985687202828885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5628985687202828885.bin' '-l' '-1' '-v' '-w' '/tmp/graph5628985687202828885.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:42:17] [INFO ] Decomposing Gal with order
[2025-06-02 07:42:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:42:17] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-02 07:42:17] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:42:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2025-06-02 07:42:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality14580098378214381575.gal : 2 ms
[2025-06-02 07:42:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5881840323143565481.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/CTLCardinality14580098378214381575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5881840323143565481.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.54039e+06,0.614511,15288,422,168,17803,1814,353,48707,108,17457,0


Converting to forward existential form...Done !
original formula: AF(((AF(AG(((i6.u18.p114==0)&&(i2.u9.p60==1)))) * (i4.u13.p86==0)) * ((i2.u3.p16==1) * (AX(((i3.u8.p35==0)||(i7.i0.u20.p127==1))) + A((i5...208
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E(TRUE U !(((i6.u18.p114==0)&&(i2.u9.p60==1)))))))) * (i4.u13.p86==0)) * ((i2.u3.p16==1)...372
Reverse transition relation is NOT exact ! Due to transitions t26, t62, t90, t94, i1.u4.t86, i2.u9.t61, i2.u9.t63, i2.u9.t64, i2.u9.t65, i2.u9.t66, i2.u9.t...853
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.53407,177208,1,0,258188,9529,2401,722398,608,98944,309283
FORMULA MedleyA-PT-08-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 121 transition count 222
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 105 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 37 place count 105 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 103 transition count 216
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 59 place count 85 transition count 192
Iterating global reduction 2 with 18 rules applied. Total rules applied 77 place count 85 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 77 place count 85 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 83 transition count 190
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 78 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 78 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 76 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 76 transition count 173
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 117 place count 64 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 62 transition count 161
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 62 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 127 place count 62 transition count 155
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 127 place count 62 transition count 151
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 135 place count 58 transition count 151
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 2 with 4 rules applied. Total rules applied 139 place count 56 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 55 transition count 148
Applied a total of 140 rules in 27 ms. Remains 55 /129 variables (removed 74) and now considering 148/242 (removed 94) transitions.
// Phase 1: matrix 148 rows 55 cols
[2025-06-02 07:42:24] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:42:24] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 07:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:42:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:42:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:42:24] [INFO ] Redundant transitions in 22 ms returned []
Running 140 sub problems to find dead transitions.
[2025-06-02 07:42:24] [INFO ] Invariant cache hit.
[2025-06-02 07:42:24] [INFO ] State equation strengthened by 12 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, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 147/201 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 2/203 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 73 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9378 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 147/201 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 137/209 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 2/203 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 213 constraints, problems are : Problem set: 0 solved, 140 unsolved in 14233 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23653ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 23653ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/129 places, 148/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23906 ms. Remains : 55/129 places, 148/242 transitions.
[2025-06-02 07:42:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:42:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:42:48] [INFO ] Input system was already deterministic with 148 transitions.
[2025-06-02 07:42:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:42:48] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:42:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14591862762483789575.gal : 2 ms
[2025-06-02 07:42:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality2827964493529136396.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/CTLCardinality14591862762483789575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2827964493529136396.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,568940,0.460265,12236,2,1159,5,28715,6,0,356,41782,0


Converting to forward existential form...Done !
original formula: EG(A((((p138==0)||(p37==1)) * (EF(((p49==0)||(p103==1))) + (p144==1))) U (p108==1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((p108==1)) U (!((((p138==0)||(p37==1)) * (E(TRUE U ((p49==0)||(p103==1))) + (p144==1)))) * !((...198
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t20, t22, t23, t26, t...446
(forward)formula 0,0,13.7316,323896,1,0,642,1.97078e+06,331,269,3292,1.85186e+06,742
FORMULA MedleyA-PT-08-CTLCardinality-2025-10 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 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 104 transition count 212
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 104 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 104 transition count 209
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 99 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 99 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 98 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 98 transition count 196
Applied a total of 63 rules in 5 ms. Remains 98 /129 variables (removed 31) and now considering 196/242 (removed 46) transitions.
// Phase 1: matrix 196 rows 98 cols
[2025-06-02 07:43:02] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:43:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 07:43:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:43:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 07:43:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:05] [INFO ] Deduced a trap composed of 21 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 07:43:05] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:05] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:06] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/294 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:11] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:12] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:15] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:15] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 117 constraints, problems are : Problem set: 0 solved, 195 unsolved in 20241 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/294 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 195/310 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:29] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:29] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:30] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:43:43] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 316 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50356ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 50357ms
Starting structural reductions in LTL mode, iteration 1 : 98/129 places, 196/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50575 ms. Remains : 98/129 places, 196/242 transitions.
[2025-06-02 07:43:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:43:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:43:53] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 07:43:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:43:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:43:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16906075137172257516.gal : 2 ms
[2025-06-02 07:43:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality86649157537427498.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/CTLCardinality16906075137172257516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality86649157537427498.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51838e+06,2.62468,50952,2,7450,5,129046,6,0,588,237055,0


Converting to forward existential form...Done !
original formula: EG(E(AG((!(EX((p36==0))) + AF((p24==1)))) U ((EF(((p32==0)||(p141==1))) + AF(((p50==0)||(p124==1)))) + (EF(AX(((p18==0)||(p77==1)))) + (E...212
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((!(EX((p36==0))) + !(EG(!((p24==1)))))))) U ((E(TRUE U ((p32==0)||(p141==1))) + !(EG(!...303
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t20, t21, t26, t27, t28, t29, t30, t31...571
Detected timeout of ITS tools.
[2025-06-02 07:44:23] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:44:23] [INFO ] Applying decomposition
[2025-06-02 07:44:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7753456118222090303.txt' '-o' '/tmp/graph7753456118222090303.bin' '-w' '/tmp/graph7753456118222090303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7753456118222090303.bin' '-l' '-1' '-v' '-w' '/tmp/graph7753456118222090303.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:44:23] [INFO ] Decomposing Gal with order
[2025-06-02 07:44:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:44:23] [INFO ] Removed a total of 330 redundant transitions.
[2025-06-02 07:44:23] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:44:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2025-06-02 07:44:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6805973672779060676.gal : 2 ms
[2025-06-02 07:44:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality18105543194070279197.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/CTLCardinality6805973672779060676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18105543194070279197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51838e+06,0.809033,17552,478,296,21256,3189,362,53686,129,28697,0


Converting to forward existential form...Done !
original formula: EG(E(AG((!(EX((i3.u7.p36==0))) + AF((i1.u4.p24==1)))) U ((EF(((i3.u6.p32==0)||(i7.u25.p141==1))) + AF(((i2.u9.p50==0)||(i7.u22.p124==1)))...290
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((!(EX((i3.u7.p36==0))) + !(EG(!((i1.u4.p24==1)))))))) U ((E(TRUE U ((i3.u6.p32==0)||(i...381
Reverse transition relation is NOT exact ! Due to transitions t28, t63, t96, t102, t172, t173, t174, t175, t182, t183, t184, t185, i1.u4.t90, i1.u4.t91, i2...911
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,12.2455,252372,1,0,346013,29014,2466,1.0651e+06,719,315754,365565
FORMULA MedleyA-PT-08-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 121 transition count 219
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 102 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 44 place count 102 transition count 213
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 46 place count 101 transition count 213
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 65 place count 82 transition count 185
Iterating global reduction 2 with 19 rules applied. Total rules applied 84 place count 82 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 84 place count 82 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 80 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 74 transition count 166
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 74 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 71 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 71 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 70 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 70 transition count 156
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 132 place count 57 transition count 145
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 53 transition count 137
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 53 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 53 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 145 place count 53 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 51 transition count 130
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 2 with 4 rules applied. Total rules applied 153 place count 49 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 48 transition count 127
Applied a total of 154 rules in 52 ms. Remains 48 /129 variables (removed 81) and now considering 127/242 (removed 115) transitions.
// Phase 1: matrix 127 rows 48 cols
[2025-06-02 07:44:35] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:44:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 07:44:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:44:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:44:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:44:35] [INFO ] Redundant transitions in 26 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-02 07:44:35] [INFO ] Invariant cache hit.
[2025-06-02 07:44:35] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 126/173 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 66 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 126/173 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 2/175 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 185 constraints, problems are : Problem set: 0 solved, 119 unsolved in 10404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16479ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 16480ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/129 places, 127/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16773 ms. Remains : 48/129 places, 127/242 transitions.
[2025-06-02 07:44:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:44:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:44:52] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-02 07:44:52] [INFO ] Flatten gal took : 3 ms
[2025-06-02 07:44:52] [INFO ] Flatten gal took : 3 ms
[2025-06-02 07:44:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8115377641825515067.gal : 1 ms
[2025-06-02 07:44:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12029879565541893193.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/CTLCardinality8115377641825515067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12029879565541893193.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,281409,0.137549,7692,2,358,5,14567,6,0,307,18121,0


Converting to forward existential form...Done !
original formula: EG(EF((AF(EG(((p95==0)||(p62==1)))) + (p135==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EG(!(EG(((p95==0)||(p62==1)))))) + (p135==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t10, t11, t20, t24, t25, t115, t117, Intersection with reach...231
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.27887,205668,1,0,665,1.25092e+06,290,302,3071,1.16818e+06,808
FORMULA MedleyA-PT-08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 122 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 121 transition count 220
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 42 place count 103 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 102 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 102 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 100 transition count 213
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 64 place count 83 transition count 187
Iterating global reduction 3 with 17 rules applied. Total rules applied 81 place count 83 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 83 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 82 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 76 transition count 169
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 76 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 75 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 75 transition count 167
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 121 place count 62 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 58 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 58 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 58 transition count 144
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 133 place count 58 transition count 141
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 55 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 54 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 53 transition count 139
Applied a total of 142 rules in 23 ms. Remains 53 /129 variables (removed 76) and now considering 139/242 (removed 103) transitions.
// Phase 1: matrix 139 rows 53 cols
[2025-06-02 07:45:00] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 07:45:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:45:00] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:45:00] [INFO ] Redundant transitions in 40 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-02 07:45:00] [INFO ] Invariant cache hit.
[2025-06-02 07:45:00] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:02] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:02] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 138/190 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 73 constraints, problems are : Problem set: 0 solved, 133 unsolved in 9015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 138/190 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 130/202 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 206 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12139 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21211ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 21212ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/129 places, 139/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21465 ms. Remains : 53/129 places, 139/242 transitions.
[2025-06-02 07:45:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:22] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 07:45:22] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:45:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7538487649254891256.gal : 1 ms
[2025-06-02 07:45:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality18295584428463086152.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/CTLCardinality7538487649254891256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18295584428463086152.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,457672,0.241594,10844,2,1798,5,25483,6,0,339,30265,0


Converting to forward existential form...Done !
original formula: AF(!(A((p43!=1) U AF((((p58==0)||(p18==1))||(((p28==0)||(p50==1))&&(p69==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((((p58==0)||(p18==1))||(((p28==0)||(p50==1))&&(p69==1))))))) U (!((p43!=1)) * !(!(E...311
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t16, t17, t19, t20, t21, t22, t23...394
Using saturation style SCC detection
(forward)formula 0,0,12.9502,304684,1,0,769,1.52885e+06,313,391,3217,1.86068e+06,836
FORMULA MedleyA-PT-08-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Graph (complete) has 443 edges and 129 vertex of which 124 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 123 transition count 221
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 42 place count 105 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 104 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 43 place count 104 transition count 214
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 102 transition count 214
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 64 place count 85 transition count 188
Iterating global reduction 3 with 17 rules applied. Total rules applied 81 place count 85 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 85 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 83 transition count 186
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 78 transition count 170
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 78 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 76 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 76 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 75 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 75 transition count 162
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 122 place count 64 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 61 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 61 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 61 transition count 142
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 133 place count 61 transition count 139
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 58 transition count 139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 56 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 55 transition count 136
Applied a total of 144 rules in 25 ms. Remains 55 /129 variables (removed 74) and now considering 136/242 (removed 106) transitions.
// Phase 1: matrix 136 rows 55 cols
[2025-06-02 07:45:35] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:35] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 07:45:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:45:35] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:45:35] [INFO ] Redundant transitions in 17 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-02 07:45:35] [INFO ] Invariant cache hit.
[2025-06-02 07:45:35] [INFO ] State equation strengthened by 12 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, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:36] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 135/189 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 2/191 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 76 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6142 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 2/54 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 135/189 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 125/200 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 2/191 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 204 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13738 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 55/55 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19919ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 19921ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/129 places, 136/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20128 ms. Remains : 55/129 places, 136/242 transitions.
[2025-06-02 07:45:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:45:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:55] [INFO ] Input system was already deterministic with 136 transitions.
[2025-06-02 07:45:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:45:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality746505916367693539.gal : 1 ms
[2025-06-02 07:45:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12357297281627076858.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/CTLCardinality746505916367693539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12357297281627076858.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,499993,0.268583,11112,2,1205,5,24915,6,0,348,36478,0


Converting to forward existential form...Done !
original formula: EF((AG(((p140==0)||(p30==1))) + ((EF(((p142==0)||(p119==1))) * (p24!=0)) * (p11!=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(((p140==0)||(p30==1))))))] != FALSE + [(FwdU(((FwdU(Init,TRUE) * (p11!=1)) * (...206
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t17, t18, t21, t23, t24, t25...361
(forward)formula 0,1,1.76877,44112,1,0,276,206093,294,98,3164,178772,320
FORMULA MedleyA-PT-08-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 242/242 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 242
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 104 transition count 210
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 104 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 104 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 98 transition count 192
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 98 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 96 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 96 transition count 188
Applied a total of 65 rules in 5 ms. Remains 96 /129 variables (removed 33) and now considering 188/242 (removed 54) transitions.
// Phase 1: matrix 188 rows 96 cols
[2025-06-02 07:45:57] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-02 07:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:45:57] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-06-02 07:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:59] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:45:59] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:04] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:09] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 110 constraints, problems are : Problem set: 0 solved, 187 unsolved in 19820 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 187/295 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:30] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 11 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/284 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:46:35] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 299 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49889ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 49890ms
Starting structural reductions in LTL mode, iteration 1 : 96/129 places, 188/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50107 ms. Remains : 96/129 places, 188/242 transitions.
[2025-06-02 07:46:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:46:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:46:47] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-02 07:46:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:46:47] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:46:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3528017540386827634.gal : 1 ms
[2025-06-02 07:46:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8730666302997081597.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/CTLCardinality3528017540386827634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8730666302997081597.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,7.86986e+06,1.61083,41812,2,7227,5,117701,6,0,572,190957,0


Converting to forward existential form...Done !
original formula: (EX(EF(((p128==1)&&((p27==0)||(p140==1))))) * E(((!((EG(((p27==0)||(p145==1))) + (p59==1))) + (p0==1)) + ((((p3!=1)&&(p55==1))&&(p131==1)...214
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX(E(TRUE U ((p128==1)&&((p27==0)||(p140==1)))))),((!((EG(((p27==0)||(p145==1))) + (p59==1)))...264
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t28, t30, t31, t32, t3...516
Detected timeout of ITS tools.
[2025-06-02 07:47:17] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:47:17] [INFO ] Applying decomposition
[2025-06-02 07:47:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13852865497696299420.txt' '-o' '/tmp/graph13852865497696299420.bin' '-w' '/tmp/graph13852865497696299420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13852865497696299420.bin' '-l' '-1' '-v' '-w' '/tmp/graph13852865497696299420.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:47:17] [INFO ] Decomposing Gal with order
[2025-06-02 07:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:47:17] [INFO ] Removed a total of 335 redundant transitions.
[2025-06-02 07:47:17] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:47:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2025-06-02 07:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7783086363094172202.gal : 3 ms
[2025-06-02 07:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15105778902146263621.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/CTLCardinality7783086363094172202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15105778902146263621.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.86986e+06,0.487153,14428,473,147,18429,880,389,43873,94,7323,0


Converting to forward existential form...Done !
original formula: (EX(EF(((i7.u24.p128==1)&&((i1.u2.p27==0)||(i7.u29.p140==1))))) * E(((!((EG(((i1.u2.p27==0)||(i7.u31.p145==1))) + (i3.u10.p59==1))) + (i0...305
=> equivalent forward existential formula: [FwdG(FwdU((Init * EX(E(TRUE U ((i7.u24.p128==1)&&((i1.u2.p27==0)||(i7.u29.p140==1)))))),((!((EG(((i1.u2.p27==0)...355
Reverse transition relation is NOT exact ! Due to transitions t26, t64, t98, t102, i1.u4.t94, i2.t87, i2.t84, i2.t83, i2.u5.t90, i2.u5.t91, i2.u8.t62, i2.u...844
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,8.75601,240312,1,0,356583,9473,2736,1.1364e+06,453,80566,383023
FORMULA MedleyA-PT-08-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:47:26] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:47:26] [INFO ] Flatten gal took : 6 ms
Total runtime 937384 ms.

BK_STOP 1748850446310

--------------------
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-08"
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-08, 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-174876524000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;