Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 82K 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-07-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748847987669

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 07:06:30] [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:06:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:06:30] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-02 07:06:30] [INFO ] Transformed 145 places.
[2025-06-02 07:06:30] [INFO ] Transformed 287 transitions.
[2025-06-02 07:06:30] [INFO ] Found NUPN structural information;
[2025-06-02 07:06:30] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-07-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 142 transition count 285
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 130 transition count 272
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 130 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 129 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 129 transition count 270
Applied a total of 27 rules in 67 ms. Remains 129 /143 variables (removed 14) and now considering 270/285 (removed 15) transitions.
// Phase 1: matrix 270 rows 129 cols
[2025-06-02 07:06:31] [INFO ] Computed 10 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:31] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-02 07:06:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:06:31] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 07:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:38] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:39] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:40] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 10/20 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:42] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:42] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:42] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/23 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:43] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:43] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/25 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:45] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/26 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/26 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 270/398 variables, 128/154 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:51] [INFO ] Deduced a trap along path composed of 2 places in 51 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 1/155 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:58] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:06:59] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 7/162 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/399 variables, and 162 constraints, problems are : Problem set: 48 solved, 221 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/129 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 23/33 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:04] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/34 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/34 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 270/398 variables, 128/162 constraints. Problems are: Problem set: 48 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 220/382 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:10] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:10] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:11] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:11] [INFO ] Deduced a trap composed of 38 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:07:12] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:13] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:14] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 7/389 constraints. Problems are: Problem set: 48 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:25] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 1/390 constraints. Problems are: Problem set: 48 solved, 221 unsolved
SMT process timed out in 60782ms, After SMT, problems are : Problem set: 48 solved, 221 unsolved
Search for dead transitions found 48 dead transitions in 60810ms
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/143 places, 222/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61899 ms. Remains : 129/143 places, 222/285 transitions.
Support contains 69 out of 129 places after structural reductions.
[2025-06-02 07:07:33] [INFO ] Flatten gal took : 68 ms
[2025-06-02 07:07:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-07-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:07:33] [INFO ] Flatten gal took : 35 ms
[2025-06-02 07:07:33] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 61 out of 129 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (1403 resets) in 2993 ms. (13 steps per ms) remains 18/41 properties
BEST_FIRST walk for 4003 steps (30 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (30 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (36 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (32 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
// Phase 1: matrix 222 rows 129 cols
[2025-06-02 07:07:34] [INFO ] Computed 10 invariants in 9 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 42/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 210/326 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 19/345 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/347 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 4/351 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/351 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 139 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 46/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 42/116 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:36] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 23 ms to minimize.
Problem AtomicPropp13 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 210/326 variables, 116/131 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 9/140 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 4/144 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:37] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:38] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:38] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:38] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 3/148 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:38] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:39] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 19/345 variables, 8/158 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 8/166 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/351 variables, and 166 constraints, problems are : Problem set: 1 solved, 17 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 124/129 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6314ms problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 222/222 transitions.
Graph (complete) has 398 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 123 transition count 203
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 115 transition count 203
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 25 place count 115 transition count 199
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 33 place count 111 transition count 199
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 48 place count 96 transition count 180
Iterating global reduction 2 with 15 rules applied. Total rules applied 63 place count 96 transition count 180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 96 transition count 179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 95 transition count 179
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 101 place count 77 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 77 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 76 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 76 transition count 156
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 117 place count 70 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 141 place count 70 transition count 173
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 70 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 67 transition count 170
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 67 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 151 place count 65 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 65 transition count 168
Applied a total of 152 rules in 172 ms. Remains 65 /129 variables (removed 64) and now considering 168/222 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 65/129 places, 168/222 transitions.
RANDOM walk for 40000 steps (3103 resets) in 743 ms. (53 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40001 steps (887 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (923 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
// Phase 1: matrix 168 rows 65 cols
[2025-06-02 07:07:41] [INFO ] Computed 9 invariants in 3 ms
[2025-06-02 07:07:41] [INFO ] State equation strengthened by 70 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/28 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/54 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 161/215 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 70/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/227 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/231 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/233 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/233 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/28 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/54 variables, 4/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:07:41] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 161/215 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 70/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/227 variables, 8/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/231 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/231 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/233 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/233 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 6 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 168/168 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 160
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 59 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 58 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 58 transition count 157
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 20 place count 56 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 53 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 53 transition count 154
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 42 transition count 145
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 48 place count 41 transition count 153
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 50 place count 41 transition count 151
Applied a total of 50 rules in 47 ms. Remains 41 /65 variables (removed 24) and now considering 151/168 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 41/65 places, 151/168 transitions.
RANDOM walk for 40000 steps (5270 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37297 steps (1385 resets) in 88 ms. (419 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2025-06-02 07:07:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 07:07:42] [INFO ] Flatten gal took : 35 ms
FORMULA MedleyA-PT-07-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:07:42] [INFO ] Flatten gal took : 36 ms
[2025-06-02 07:07:42] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 14 stabilizing places and 15 stable transitions
Graph (complete) has 398 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 105 transition count 196
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 104 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 104 transition count 194
Applied a total of 49 rules in 21 ms. Remains 104 /129 variables (removed 25) and now considering 194/222 (removed 28) transitions.
// Phase 1: matrix 194 rows 104 cols
[2025-06-02 07:07:42] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:42] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 07:07:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:42] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:07:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:45] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:45] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:45] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:45] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:46] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:46] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:52] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:56] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24115 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:10] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:19] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54262ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 54264ms
Starting structural reductions in LTL mode, iteration 1 : 104/129 places, 194/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54610 ms. Remains : 104/129 places, 194/222 transitions.
[2025-06-02 07:08:37] [INFO ] Flatten gal took : 36 ms
[2025-06-02 07:08:37] [INFO ] Flatten gal took : 28 ms
[2025-06-02 07:08:37] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:08:37] [INFO ] Flatten gal took : 27 ms
[2025-06-02 07:08:37] [INFO ] Flatten gal took : 25 ms
[2025-06-02 07:08:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13920492337749307942.gal : 15 ms
[2025-06-02 07:08:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1476139757559616460.ctl : 8 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/CTLCardinality13920492337749307942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1476139757559616460.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55422e+07,1.55924,39796,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
(forward)formula 0,1,5.30458,106840,1,0,393,441550,409,144,4952,455916,437
FORMULA MedleyA-PT-07-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 105 transition count 196
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 104 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 104 transition count 194
Applied a total of 49 rules in 13 ms. Remains 104 /129 variables (removed 25) and now considering 194/222 (removed 28) transitions.
[2025-06-02 07:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 07:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:42] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:45] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:46] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:52] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:56] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 23505 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:10] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:20] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53608ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 53610ms
Starting structural reductions in LTL mode, iteration 1 : 104/129 places, 194/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53884 ms. Remains : 104/129 places, 194/222 transitions.
[2025-06-02 07:09:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:09:36] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:09:36] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:09:36] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:09:36] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:09:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11946392194410147073.gal : 7 ms
[2025-06-02 07:09:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality25529120910297910.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/CTLCardinality11946392194410147073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality25529120910297910.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55422e+07,1.67217,39884,2,3338,5,120055,6,0,610,169928,0


Converting to forward existential form...Done !
original formula: AX(AX(EF((p88==1))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (p88==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
(forward)formula 0,1,11.4558,249412,1,0,405,1.57491e+06,409,167,5136,958299,463
FORMULA MedleyA-PT-07-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 222/222 transitions.
Graph (complete) has 398 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test 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 11 place count 122 transition count 208
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 113 transition count 205
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 110 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 27 place count 110 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 35 place count 106 transition count 200
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 50 place count 91 transition count 181
Iterating global reduction 3 with 15 rules applied. Total rules applied 65 place count 91 transition count 181
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 93 place count 76 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 75 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 75 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 104 place count 75 transition count 157
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 108 place count 75 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 71 transition count 153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 112 place count 71 transition count 150
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 118 place count 68 transition count 150
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 5 with 2 rules applied. Total rules applied 120 place count 67 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 65 transition count 147
Applied a total of 122 rules in 45 ms. Remains 65 /129 variables (removed 64) and now considering 147/222 (removed 75) transitions.
// Phase 1: matrix 147 rows 65 cols
[2025-06-02 07:09:48] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:48] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 07:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 07:09:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:09:48] [INFO ] Redundant transitions in 23 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-02 07:09:48] [INFO ] Invariant cache hit.
[2025-06-02 07:09:48] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 2/65 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 147/212 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 112 constraints, problems are : Problem set: 0 solved, 143 unsolved in 12159 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 147/212 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 36/112 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 143/255 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:05] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:10:06] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 143 unsolved in 24684 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36892ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 36893ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/129 places, 147/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37146 ms. Remains : 65/129 places, 147/222 transitions.
[2025-06-02 07:10:25] [INFO ] Flatten gal took : 11 ms
[2025-06-02 07:10:25] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:10:25] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-02 07:10:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:10:25] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:10:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12622739958002473162.gal : 3 ms
[2025-06-02 07:10:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1915583861833986084.ctl : 2 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/CTLCardinality12622739958002473162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1915583861833986084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.70898e+06,0.858086,24100,2,1465,5,53808,6,0,394,108617,0


Converting to forward existential form...Done !
original formula: AG(((AG(AF((p31==0))) + EG(((((p133==0)&&(p87==1))&&((p41==0)&&(p56==1)))||((p31==1)&&(p37==1))))) + (AG(((((p75==0)||(p14==1))||(p30==0)...243
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((!(E(TRUE U !(!(EG(!((p31==0))))))) + EG(((((p133==0)&&(p87==1))&&((p41==0)&&(p56==...401
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t17, t18, t21, t23, t24, t26, t27, t28, ...399
Detected timeout of ITS tools.
[2025-06-02 07:10:55] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:10:55] [INFO ] Applying decomposition
[2025-06-02 07:10:55] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17297413774547444675.txt' '-o' '/tmp/graph17297413774547444675.bin' '-w' '/tmp/graph17297413774547444675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17297413774547444675.bin' '-l' '-1' '-v' '-w' '/tmp/graph17297413774547444675.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:10:55] [INFO ] Decomposing Gal with order
[2025-06-02 07:10:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:10:55] [INFO ] Removed a total of 316 redundant transitions.
[2025-06-02 07:10:55] [INFO ] Flatten gal took : 129 ms
[2025-06-02 07:10:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 35 ms.
[2025-06-02 07:10:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality12958511557891730279.gal : 7 ms
[2025-06-02 07:10:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14678236077711158556.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/CTLCardinality12958511557891730279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14678236077711158556.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.70898e+06,0.391079,12544,415,51,14338,256,361,48600,66,1159,0


Converting to forward existential form...Done !
original formula: AG(((AG(AF((i0.i1.u3.p31==0))) + EG(((((i4.u17.p133==0)&&(i2.u10.p87==1))&&((i1.u6.p41==0)&&(i1.u8.p56==1)))||((i0.i1.u3.p31==1)&&(i0.i1....366
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((!(E(TRUE U !(!(EG(!((i0.i1.u3.p31==0))))))) + EG(((((i4.u17.p133==0)&&(i2.u10.p87=...554
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t46, i0.i0.u0.t47, i0.i0.u1.t44, i0.i0.u1.t45, i0.i1.t72, i0.i1.t138, i0.i1.u2.t28, ...661
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
(forward)formula 0,0,4.74683,125440,1,0,175856,588,2229,575348,314,2088,182298
FORMULA MedleyA-PT-07-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 111 transition count 203
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 111 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 201
Applied a total of 37 rules in 6 ms. Remains 110 /129 variables (removed 19) and now considering 201/222 (removed 21) transitions.
// Phase 1: matrix 201 rows 110 cols
[2025-06-02 07:11:00] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 07:11:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:01] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-02 07:11: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/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:04] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:05] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/311 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:09] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:13] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:15] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 131 constraints, problems are : Problem set: 0 solved, 200 unsolved in 25055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/311 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 200/329 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:30] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:31] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:35] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:43] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:48] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 337 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55168ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 55170ms
Starting structural reductions in LTL mode, iteration 1 : 110/129 places, 201/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55507 ms. Remains : 110/129 places, 201/222 transitions.
[2025-06-02 07:11:56] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:11:56] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:11:56] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-02 07:11:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:11:56] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:11:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2844060700934613835.gal : 3 ms
[2025-06-02 07:11:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10133089284476738400.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/CTLCardinality2844060700934613835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10133089284476738400.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.14324e+07,3.67144,77048,2,8338,5,212308,6,0,641,359023,0


Converting to forward existential form...Done !
original formula: EX(EG((EG(!(E(((p70==0)||(p8==1)) U ((p23==0)||(p25==1))))) + (EX(TRUE) * ((((p138==0)&&(p84==1))&&(p48==0)) + ((AF((p77==1)) * (p52==0))...184
=> equivalent forward existential formula: [FwdG(EY(Init),(EG(!(E(((p70==0)||(p8==1)) U ((p23==0)||(p25==1))))) + (EX(TRUE) * ((((p138==0)&&(p84==1))&&(p48...233
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...544
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 07:12:26] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:12:26] [INFO ] Applying decomposition
[2025-06-02 07:12:26] [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/graph5520709146693901786.txt' '-o' '/tmp/graph5520709146693901786.bin' '-w' '/tmp/graph5520709146693901786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5520709146693901786.bin' '-l' '-1' '-v' '-w' '/tmp/graph5520709146693901786.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:12:26] [INFO ] Decomposing Gal with order
[2025-06-02 07:12:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:12:26] [INFO ] Removed a total of 291 redundant transitions.
[2025-06-02 07:12:26] [INFO ] Flatten gal took : 40 ms
[2025-06-02 07:12:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 11 ms.
[2025-06-02 07:12:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality590212517868299914.gal : 7 ms
[2025-06-02 07:12:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6938453878209123820.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/CTLCardinality590212517868299914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6938453878209123820.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.14324e+07,1.01572,22916,694,127,32008,1413,400,96491,81,10693,0


Converting to forward existential form...Done !
original formula: EX(EG((EG(!(E(((i4.u17.p70==0)||(i1.u2.p8==1)) U ((i1.u5.p23==0)||(i1.u5.p25==1))))) + (EX(TRUE) * ((((i7.i0.u33.p138==0)&&(i4.u19.p84==1...261
=> equivalent forward existential formula: [FwdG(EY(Init),(EG(!(E(((i4.u17.p70==0)||(i1.u2.p8==1)) U ((i1.u5.p23==0)||(i1.u5.p25==1))))) + (EX(TRUE) * ((((...310
Reverse transition relation is NOT exact ! Due to transitions t34, t75, t111, i1.u2.t110, i1.u3.t109, i1.u5.t105, i1.u5.t106, i2.t98, i2.t97, i2.t96, i2.t9...950
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
(forward)formula 0,0,19.5744,428332,1,0,634752,2636,2545,2.40785e+06,395,21287,460499
FORMULA MedleyA-PT-07-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 111 transition count 202
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 111 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 200
Applied a total of 37 rules in 4 ms. Remains 110 /129 variables (removed 19) and now considering 200/222 (removed 22) transitions.
// Phase 1: matrix 200 rows 110 cols
[2025-06-02 07:12:46] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 07:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:46] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2025-06-02 07:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:49] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:50] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/310 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:57] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:06] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/310 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 131 constraints, problems are : Problem set: 0 solved, 199 unsolved in 26045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/310 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 199/328 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:16] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:16] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:23] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:23] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 334 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56116ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 56117ms
Starting structural reductions in LTL mode, iteration 1 : 110/129 places, 200/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56367 ms. Remains : 110/129 places, 200/222 transitions.
[2025-06-02 07:13:42] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:13:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:13:42] [INFO ] Input system was already deterministic with 200 transitions.
[2025-06-02 07:13:42] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:13:42] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:13:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality810614731977044437.gal : 4 ms
[2025-06-02 07:13:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16607131188795489944.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/CTLCardinality810614731977044437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16607131188795489944.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27848e+07,2.3303,56760,2,7425,5,153879,6,0,640,265874,0


Converting to forward existential form...Done !
original formula: A(!(((!(AG((p13==0))) + AF(E((p80==1) U ((p2==0)||(p105==1))))) + AG((AX(((p124==0)||(p87==1))) * !((((p94==0)||(p4==1))&&(p5==0))))))) U...253
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EG(!((p64==1)))) * (!((E(!(((p66==0)||(p137==1))) U (!(((p20==0)||(p15==1))) * !(((...948
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...534
Detected timeout of ITS tools.
[2025-06-02 07:14:12] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:14:12] [INFO ] Applying decomposition
[2025-06-02 07:14:12] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9243680945746761583.txt' '-o' '/tmp/graph9243680945746761583.bin' '-w' '/tmp/graph9243680945746761583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9243680945746761583.bin' '-l' '-1' '-v' '-w' '/tmp/graph9243680945746761583.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:14:12] [INFO ] Decomposing Gal with order
[2025-06-02 07:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:14:12] [INFO ] Removed a total of 331 redundant transitions.
[2025-06-02 07:14:12] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 16 ms.
[2025-06-02 07:14:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8443341971964156753.gal : 3 ms
[2025-06-02 07:14:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7694584807600130552.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/CTLCardinality8443341971964156753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7694584807600130552.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27848e+07,0.369341,14644,577,109,18124,797,429,52666,74,5010,0


Converting to forward existential form...Done !
original formula: A(!(((!(AG((i3.u3.p13==0))) + AF(E((i6.i0.u16.p80==1) U ((i0.u1.p2==0)||(i6.i1.u26.p105==1))))) + AG((AX(((i7.i0.u31.p124==0)||(i5.u21.p8...383
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EG(!((i6.i0.u17.p64==1)))) * (!((E(!(((i6.i0.u17.p66==0)||(i7.i0.u35.p137==1))) U (...1382
Reverse transition relation is NOT exact ! Due to transitions t34, t76, i1.u2.t108, i1.u5.t104, i2.t97, i2.t96, i2.t95, i2.t92, i2.t91, i2.u6.t99, i2.u6.t1...997
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 222/222 transitions.
Graph (complete) has 398 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 122 transition count 204
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 109 transition count 202
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 108 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 32 place count 108 transition count 199
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 36 place count 106 transition count 199
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 56 place count 86 transition count 175
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 86 transition count 175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 86 transition count 174
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 78 place count 85 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 84 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 84 transition count 172
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 107 place count 70 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 69 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 69 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 69 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 69 transition count 147
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 122 place count 67 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 66 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 123 place count 66 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 127 place count 64 transition count 144
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 6 with 4 rules applied. Total rules applied 131 place count 62 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 133 place count 60 transition count 140
Applied a total of 133 rules in 50 ms. Remains 60 /129 variables (removed 69) and now considering 140/222 (removed 82) transitions.
// Phase 1: matrix 140 rows 60 cols
[2025-06-02 07:14:43] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:43] [INFO ] Implicit Places using invariants in 71 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/129 places, 140/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 130 ms. Remains : 59/129 places, 140/222 transitions.
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:14:43] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:14:43] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:14:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality18044425106390933798.gal : 1 ms
[2025-06-02 07:14:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14801817042909455703.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/CTLCardinality18044425106390933798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14801817042909455703.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,629532,0.33273,12376,2,814,5,29976,6,0,365,44220,0


Converting to forward existential form...Done !
original formula: AG((AG(((((p29==0)&&(p58==1))||(p94==0))||(p80==1))) + AG(((p119==1)&&((p83==0)||(p26==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !(((((p29==0)&&(p58==1))||(p94==0))||(p80==1))))))),TRUE) * !(((p119==1)&...188
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t14, t16, t17, t20, t22, t25, t27, t29, t31, t32, t...347
(forward)formula 0,0,2.58184,66356,1,0,277,332872,305,104,3305,264316,326
FORMULA MedleyA-PT-07-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 198
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 198
Applied a total of 43 rules in 3 ms. Remains 107 /129 variables (removed 22) and now considering 198/222 (removed 24) transitions.
// Phase 1: matrix 198 rows 107 cols
[2025-06-02 07:14:45] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 07:14:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 07:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:50] [INFO ] Deduced a trap composed of 14 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:14:50] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:55] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:55] [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/305 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 125 constraints, problems are : Problem set: 0 solved, 197 unsolved in 20338 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 197/320 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:10] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:11] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:16] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:21] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:21] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:22] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:22] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 329 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50419ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 50420ms
Starting structural reductions in LTL mode, iteration 1 : 107/129 places, 198/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50664 ms. Remains : 107/129 places, 198/222 transitions.
[2025-06-02 07:15:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:15:36] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:15:36] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 07:15:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:15:36] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15330887161280705018.gal : 3 ms
[2025-06-02 07:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6766098684856976954.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/CTLCardinality15330887161280705018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6766098684856976954.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66824e+07,1.43488,37212,2,3307,5,111727,6,0,626,159041,0


Converting to forward existential form...Done !
original formula: EG(AX(A(((p86!=1)||(((p12==0)||(p88==1))&&((p110==0)||(p59==1)))) U A((p130==0) U ((p39==0)||(p126==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(!((E(!(((p39==0)||(p126==1))) U (!((p130==0)) * !(((p39==0)||(p126==1))))) + EG(!(((p39...488
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t41, t42, t43...465
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 07:16:06] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:16:06] [INFO ] Applying decomposition
[2025-06-02 07:16:06] [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/graph15503767083212266763.txt' '-o' '/tmp/graph15503767083212266763.bin' '-w' '/tmp/graph15503767083212266763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15503767083212266763.bin' '-l' '-1' '-v' '-w' '/tmp/graph15503767083212266763.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:16:06] [INFO ] Decomposing Gal with order
[2025-06-02 07:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:16:06] [INFO ] Removed a total of 275 redundant transitions.
[2025-06-02 07:16:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 07:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2025-06-02 07:16:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16548175882626067742.gal : 9 ms
[2025-06-02 07:16:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10391087399102737874.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/CTLCardinality16548175882626067742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10391087399102737874.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66824e+07,0.280909,9872,388,71,11107,671,342,24994,74,3146,0


Converting to forward existential form...Done !
original formula: EG(AX(A(((i5.u21.p86!=1)||(((i1.u2.p12==0)||(i5.u18.p88==1))&&((i6.u24.p110==0)||(i3.u13.p59==1)))) U A((i7.i1.u29.p130==0) U ((i2.u8.p39...185
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((E(!(!((E(!(((i2.u8.p39==0)||(i7.i0.u28.p126==1))) U (!((i7.i1.u29.p130==0)) * !(((i2.u8.p39...696
Reverse transition relation is NOT exact ! Due to transitions t34, i1.u2.t107, i1.u4.t104, i2.t95, i2.t91, i2.u5.t71, i2.u5.t102, i2.u5.t103, i2.u6.t99, i2...757
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,12.3756,320484,1,0,536487,3562,2083,1.75358e+06,373,28726,489741
FORMULA MedleyA-PT-07-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 106 transition count 197
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 105 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 5 ms. Remains 105 /129 variables (removed 24) and now considering 195/222 (removed 27) transitions.
// Phase 1: matrix 195 rows 105 cols
[2025-06-02 07:16:19] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:19] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 07:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:19] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 07:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:22] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:22] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:22] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:22] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:25] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 122 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12763 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:35] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:48] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:53] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 321 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42865ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 42866ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 195/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43153 ms. Remains : 105/129 places, 195/222 transitions.
[2025-06-02 07:17:02] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:17:02] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:17:02] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 07:17:02] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:17:02] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:17:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13822273184112717487.gal : 2 ms
[2025-06-02 07:17:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality15730572813126552183.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/CTLCardinality13822273184112717487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15730572813126552183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55425e+07,1.46833,38292,2,3372,5,114374,6,0,615,165495,0


Converting to forward existential form...Done !
original formula: EX(AX(E((p122!=0) U AF(EX((p130==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((p122!=0) U !(EG(!(EX((p130==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t14, t15, t16, t18, t24, t25, t26, t28, t33, t34, t35, t36, t38, t39, t41, t42,...456
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 07:17:32] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:17:32] [INFO ] Applying decomposition
[2025-06-02 07:17:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8948609504882647405.txt' '-o' '/tmp/graph8948609504882647405.bin' '-w' '/tmp/graph8948609504882647405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8948609504882647405.bin' '-l' '-1' '-v' '-w' '/tmp/graph8948609504882647405.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:17:32] [INFO ] Decomposing Gal with order
[2025-06-02 07:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:17:32] [INFO ] Removed a total of 260 redundant transitions.
[2025-06-02 07:17:32] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 4 ms.
[2025-06-02 07:17:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality16874415152251434349.gal : 2 ms
[2025-06-02 07:17:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17148956934659928903.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/CTLCardinality16874415152251434349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17148956934659928903.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55425e+07,0.179374,9696,369,78,10448,711,323,24203,86,3221,0


Converting to forward existential form...Done !
original formula: EX(AX(E((i7.i1.u27.p122!=0) U AF(EX((i7.i1.u26.p130==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((i7.i1.u27.p122!=0) U !(EG(!(EX((i7.i1.u26.p130==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t73, i1.u2.t104, i1.u4.t101, i2.t88, i2.u5.t92, i2.u5.t93, i2.u5.t94, i2.u5.t96, i2.u5.t...785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,13.5297,347940,1,0,506752,3929,1961,1.85375e+06,460,35222,358731
FORMULA MedleyA-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 106 transition count 197
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 105 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 4 ms. Remains 105 /129 variables (removed 24) and now considering 195/222 (removed 27) transitions.
// Phase 1: matrix 195 rows 105 cols
[2025-06-02 07:17:46] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:17:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 07:17:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:17:46] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 07:17:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:48] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:48] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:52] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 122 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:04] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:04] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:20] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 320 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43225ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 43226ms
Starting structural reductions in LTL mode, iteration 1 : 105/129 places, 195/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43439 ms. Remains : 105/129 places, 195/222 transitions.
[2025-06-02 07:18:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:18:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:18:29] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 07:18:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:18:29] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:18:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality6620531323518839362.gal : 2 ms
[2025-06-02 07:18:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality12048589874382773198.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/CTLCardinality6620531323518839362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12048589874382773198.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55808e+07,1.49789,38396,2,3656,5,114030,6,0,615,166355,0


Converting to forward existential form...Done !
original formula: (AG((A(((p29==0)||(p37==1)) U (p56==0)) + AG((p70==0)))) + AX(((AX((p70==1)) * AF((p88==0))) * ((p54==0)&&(p97==1)))))
=> equivalent forward existential formula: (([(EY(EY((Init * !(!(E(TRUE U !((!((E(!((p56==0)) U (!(((p29==0)||(p37==1))) * !((p56==0)))) + EG(!((p56==0))))...569
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...482
Detected timeout of ITS tools.
[2025-06-02 07:18:59] [INFO ] Flatten gal took : 4 ms
[2025-06-02 07:18:59] [INFO ] Applying decomposition
[2025-06-02 07:18:59] [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/graph15114310759393950747.txt' '-o' '/tmp/graph15114310759393950747.bin' '-w' '/tmp/graph15114310759393950747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15114310759393950747.bin' '-l' '-1' '-v' '-w' '/tmp/graph15114310759393950747.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:18:59] [INFO ] Decomposing Gal with order
[2025-06-02 07:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:18:59] [INFO ] Removed a total of 272 redundant transitions.
[2025-06-02 07:18:59] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2025-06-02 07:18:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5337476948395367031.gal : 2 ms
[2025-06-02 07:18:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality16637617434804472934.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/CTLCardinality5337476948395367031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16637617434804472934.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55808e+07,0.192437,10316,425,71,11712,723,315,28225,78,3261,0


Converting to forward existential form...Done !
original formula: (AG((A(((i2.u6.p29==0)||(i2.u8.p37==1)) U (i3.u11.p56==0)) + AG((i4.u14.p70==0)))) + AX(((AX((i4.u14.p70==1)) * AF((i5.u17.p88==0))) * ((...190
=> equivalent forward existential formula: (([(EY(EY((Init * !(!(E(TRUE U !((!((E(!((i3.u11.p56==0)) U (!(((i2.u6.p29==0)||(i2.u8.p37==1))) * !((i3.u11.p56...717
Reverse transition relation is NOT exact ! Due to transitions t34, t73, i1.u2.t104, i1.u4.t101, i2.t92, i2.t89, i2.t88, i2.u5.t71, i2.u5.t99, i2.u5.t100, i...779
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,1.68739,62412,1,0,102462,1899,1862,307076,386,11063,141372
FORMULA MedleyA-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 222/222 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 222
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 198
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 198
Applied a total of 43 rules in 2 ms. Remains 107 /129 variables (removed 22) and now considering 198/222 (removed 24) transitions.
// Phase 1: matrix 198 rows 107 cols
[2025-06-02 07:19:01] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 07:19:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:01] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 07:19: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/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:04] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:04] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:04] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:04] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:05] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:10] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:14] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:14] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 0/305 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 126 constraints, problems are : Problem set: 0 solved, 197 unsolved in 21915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/125 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 197/322 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:27] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:28] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:29] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:33] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:38] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:43] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:43] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 330 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51982ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 51982ms
Starting structural reductions in LTL mode, iteration 1 : 107/129 places, 198/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52198 ms. Remains : 107/129 places, 198/222 transitions.
[2025-06-02 07:19:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:19:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:19:53] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 07:19:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:19:53] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:19:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15569090649309180306.gal : 1 ms
[2025-06-02 07:19:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1638892934040824015.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/CTLCardinality15569090649309180306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1638892934040824015.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12021e+07,2.58482,68040,2,6797,5,204362,6,0,626,320336,0


Converting to forward existential form...Done !
original formula: (AG(!(A(!(((EX(TRUE) * (p93==0)) * (p125==1))) U EF(EG(((p144==0)||(p52==1))))))) * A(AF(!(((p41==0)||(p129==1)))) U ((p20==1)&&((p19==0)...169
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E(TRUE U EG(((p144==0)||(p52==1)))))))) * !(E(!(E(TRUE U EG(((p144==0)||(p52==1))))...450
Hit Full ! (commute/partial/dont) 137/0/61
Hit Full ! (commute/partial/dont) 137/0/61
Hit Full ! (commute/partial/dont) 193/0/5
(forward)formula 0,0,11.741,248236,1,0,50,983016,33,8,3905,1.07149e+06,52
FORMULA MedleyA-PT-07-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 07:20:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:20:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:20:05] [INFO ] Applying decomposition
[2025-06-02 07:20:05] [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/graph4999148679888276750.txt' '-o' '/tmp/graph4999148679888276750.bin' '-w' '/tmp/graph4999148679888276750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4999148679888276750.bin' '-l' '-1' '-v' '-w' '/tmp/graph4999148679888276750.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:20:05] [INFO ] Decomposing Gal with order
[2025-06-02 07:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:20:05] [INFO ] Removed a total of 388 redundant transitions.
[2025-06-02 07:20:05] [INFO ] Flatten gal took : 34 ms
[2025-06-02 07:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 6 ms.
[2025-06-02 07:20:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8132608385590688047.gal : 3 ms
[2025-06-02 07:20:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1272721757123704155.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/CTLCardinality8132608385590688047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1272721757123704155.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.43474e+07,0.981272,24512,666,79,30165,389,460,104434,80,1825,0


Converting to forward existential form...Done !
original formula: A(!(((!(AG((i1.u3.p13==0))) + AF(E((i5.u20.p80==1) U ((i0.u1.p2==0)||(i8.u27.p105==1))))) + AG((AX(((i9.i0.u31.p124==0)||(i7.u22.p87==1))...368
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EG(!((i5.u17.p64==1)))) * (!((E(!(((i5.u17.p66==0)||(i9.i0.u36.p137==1))) U (!(((i1...1331
Reverse transition relation is NOT exact ! Due to transitions t35, i1.u3.t127, i1.u3.t129, i1.u3.t130, i1.u3.t131, i1.u3.t132, i1.u4.t121, i1.u4.t122, i1.u...1181
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,26.019,619768,1,0,982035,1136,3054,2.48279e+06,396,4755,860052
FORMULA MedleyA-PT-07-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 841538 ms.

BK_STOP 1748848831902

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-07.tgz
mv MedleyA-PT-07 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 ;