Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500457.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 CO4-PT-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 132K 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 CO4-PT-11-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-11-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748606746911

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:05:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:05:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:05:48] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-05-30 12:05:48] [INFO ] Transformed 545 places.
[2025-05-30 12:05:48] [INFO ] Transformed 617 transitions.
[2025-05-30 12:05:48] [INFO ] Found NUPN structural information;
[2025-05-30 12:05:48] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 157 places in 9 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-11-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 62 place count 329 transition count 388
Iterating global reduction 1 with 47 rules applied. Total rules applied 109 place count 329 transition count 388
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 143 place count 295 transition count 354
Iterating global reduction 1 with 34 rules applied. Total rules applied 177 place count 295 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 179 place count 295 transition count 352
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 192 place count 282 transition count 339
Iterating global reduction 2 with 13 rules applied. Total rules applied 205 place count 282 transition count 339
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 214 place count 273 transition count 330
Iterating global reduction 2 with 9 rules applied. Total rules applied 223 place count 273 transition count 330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 225 place count 273 transition count 328
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 226 place count 272 transition count 327
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 272 transition count 327
Applied a total of 227 rules in 107 ms. Remains 272 /388 variables (removed 116) and now considering 327/440 (removed 113) transitions.
// Phase 1: matrix 327 rows 272 cols
[2025-05-30 12:05:48] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:48] [INFO ] Implicit Places using invariants in 233 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 271/388 places, 327/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 402 ms. Remains : 271/388 places, 327/440 transitions.
Support contains 52 out of 271 places after structural reductions.
[2025-05-30 12:05:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-30 12:05:48] [INFO ] Flatten gal took : 51 ms
FORMULA CO4-PT-11-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:05:48] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:05:49] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 39 out of 271 places (down from 52) after GAL structural reductions.
RANDOM walk for 40000 steps (41 resets) in 1687 ms. (23 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4000 steps (26 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (40 resets) in 35 ms. (111 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (29 resets) in 44 ms. (88 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (27 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (30 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (31 resets) in 13 ms. (285 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (29 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (23 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (25 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (26 resets) in 19 ms. (200 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4000 steps (15 resets) in 18 ms. (210 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4000 steps (30 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (14 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (17 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (31 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (29 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
// Phase 1: matrix 327 rows 271 cols
[2025-05-30 12:05:49] [INFO ] Computed 3 invariants in 10 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 9/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 14/46 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 79/125 variables, 46/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 151/276 variables, 53/102 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 169/445 variables, 86/188 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 98/543 variables, 54/242 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 36/579 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 15 (OVERLAPS) 14/593 variables, 10/272 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 3/596 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/596 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 2/598 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/598 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 0/598 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 598/598 variables, and 274 constraints, problems are : Problem set: 1 solved, 16 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 9/30 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/44 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 76/120 variables, 44/47 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 145/265 variables, 51/99 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 15/114 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 167/432 variables, 84/198 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/432 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 99/531 variables, 54/252 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:52] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 1/253 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/253 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 41/572 variables, 22/275 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/572 variables, 0/275 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 18/590 variables, 12/287 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/590 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 6/596 variables, 3/290 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/596 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 2/598 variables, 1/291 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/598 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 0/598 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 598/598 variables, and 291 constraints, problems are : Problem set: 1 solved, 16 unsolved in 3739 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5428ms problems are : Problem set: 1 solved, 16 unsolved
Finished Parikh walk after 838 steps, including 21 resets, run visited all 1 properties in 2 ms. (steps per millisecond=419 )
Parikh walk visited 16 properties in 903 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2025-05-30 12:05:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:05:56] [INFO ] Flatten gal took : 13 ms
FORMULA CO4-PT-11-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:05:56] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:05:56] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 32 out of 271 places (down from 37) after GAL structural reductions.
Computed a total of 20 stabilizing places and 23 stable transitions
Graph (complete) has 404 edges and 271 vertex of which 265 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 249 transition count 305
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 249 transition count 305
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 232 transition count 288
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 232 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 232 transition count 287
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 88 place count 223 transition count 278
Iterating global reduction 1 with 9 rules applied. Total rules applied 97 place count 223 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 217 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 217 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 217 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 214 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 214 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 213 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 213 transition count 267
Applied a total of 118 rules in 33 ms. Remains 213 /271 variables (removed 58) and now considering 267/327 (removed 60) transitions.
// Phase 1: matrix 267 rows 213 cols
[2025-05-30 12:05:56] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:56] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 12:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-05-30 12:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/480 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:02] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:02] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 218 constraints, problems are : Problem set: 0 solved, 266 unsolved in 16741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/480 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 266/484 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:20] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 485 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46826ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 46827ms
Starting structural reductions in LTL mode, iteration 1 : 213/271 places, 267/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47164 ms. Remains : 213/271 places, 267/327 transitions.
[2025-05-30 12:06:43] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:06:43] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:06:43] [INFO ] Input system was already deterministic with 267 transitions.
[2025-05-30 12:06:43] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:06:43] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:06:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality180662381053385847.gal : 5 ms
[2025-05-30 12:06:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11955985934052035343.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality180662381053385847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11955985934052035343.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,505464,0.106408,8120,2,1564,5,14527,6,0,1117,17628,0


Converting to forward existential form...Done !
original formula: (AX(((EG((p530==0)) + EX(AX((p429==1)))) + (EX((AG(((p405==0)||(p302==1))) * (p164==1))) * (EF((((p379==0)||(p336==1))||(p340==1))) + (p4...182
=> equivalent forward existential formula: ([(((EY(Init) * !((EX((!(E(TRUE U !(((p405==0)||(p302==1))))) * (p164==1))) * (E(TRUE U (((p379==0)||(p336==1))|...281
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t18, t22, t30, t39, t41, t43, t44, t45, t46, t48, t51, t59...316
(forward)formula 0,1,7.15121,251316,1,0,1156,1.18266e+06,573,593,6280,1.57508e+06,1483
FORMULA CO4-PT-11-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 247 transition count 303
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 247 transition count 303
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 62 place count 233 transition count 289
Iterating global reduction 0 with 14 rules applied. Total rules applied 76 place count 233 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 233 transition count 287
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 225 transition count 279
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 225 transition count 279
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 220 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 220 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 220 transition count 273
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 218 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 218 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 217 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 217 transition count 270
Applied a total of 111 rules in 31 ms. Remains 217 /271 variables (removed 54) and now considering 270/327 (removed 57) transitions.
// Phase 1: matrix 270 rows 217 cols
[2025-05-30 12:06:50] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:50] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-30 12:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:51] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-05-30 12:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/487 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:57] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 222 constraints, problems are : Problem set: 0 solved, 269 unsolved in 17037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/487 variables, 217/222 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 269/491 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:20] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 492 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47095ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 47096ms
Starting structural reductions in LTL mode, iteration 1 : 217/271 places, 270/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47548 ms. Remains : 217/271 places, 270/327 transitions.
[2025-05-30 12:07:38] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:07:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:38] [INFO ] Input system was already deterministic with 270 transitions.
[2025-05-30 12:07:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:07:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13093689139838754491.gal : 2 ms
[2025-05-30 12:07:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality14325536984494997680.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/CTLCardinality13093689139838754491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14325536984494997680.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,494740,0.109036,8632,2,1384,5,15940,6,0,1136,19483,0


Converting to forward existential form...Done !
original formula: A(((A(EX(TRUE) U !(AG((p305==0)))) + (p320==0)) + ((p191==1)||(p371==1))) U AF((p116==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((p116==1)))))))) * !(E(!(!(EG(!((p116==1))))) U (!(((!((E(!(!(!(E(TRUE U !((p305==0)))))...326
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t97, t15...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.8307,513376,1,0,1697,2.50108e+06,581,1058,6669,3.72452e+06,1967
FORMULA CO4-PT-11-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 244 transition count 300
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 244 transition count 300
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 225 transition count 281
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 225 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 104 place count 215 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 114 place count 215 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 209 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 205 transition count 258
Applied a total of 135 rules in 31 ms. Remains 205 /271 variables (removed 66) and now considering 258/327 (removed 69) transitions.
// Phase 1: matrix 258 rows 205 cols
[2025-05-30 12:07:54] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 12:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:54] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:59] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15260 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:22] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45297ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45298ms
Starting structural reductions in LTL mode, iteration 1 : 205/271 places, 258/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45526 ms. Remains : 205/271 places, 258/327 transitions.
[2025-05-30 12:08:39] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:08:39] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:08:39] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-30 12:08:39] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:08:39] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:08:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality15496106751155185681.gal : 2 ms
[2025-05-30 12:08:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality8865379004879366134.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/CTLCardinality15496106751155185681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8865379004879366134.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,459604,0.090355,7736,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AX((p417==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EX(!((p417==0)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.95432,40652,1,0,349,129981,538,228,5885,136920,545
FORMULA CO4-PT-11-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 246 transition count 302
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 246 transition count 302
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 228 transition count 284
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 228 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 228 transition count 282
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 97 place count 219 transition count 273
Iterating global reduction 1 with 9 rules applied. Total rules applied 106 place count 219 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 213 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 119 place count 213 transition count 266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 210 transition count 263
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 210 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 209 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 209 transition count 262
Applied a total of 127 rules in 22 ms. Remains 209 /271 variables (removed 62) and now considering 262/327 (removed 65) transitions.
// Phase 1: matrix 262 rows 209 cols
[2025-05-30 12:08:40] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 12:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:40] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-05-30 12:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/471 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:46] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 214 constraints, problems are : Problem set: 0 solved, 261 unsolved in 15995 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/471 variables, 209/214 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 261/475 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:14] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 16 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/471 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 476 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46025ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 46025ms
Starting structural reductions in LTL mode, iteration 1 : 209/271 places, 262/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46222 ms. Remains : 209/271 places, 262/327 transitions.
[2025-05-30 12:09:26] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:09:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:09:26] [INFO ] Input system was already deterministic with 262 transitions.
[2025-05-30 12:09:27] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:09:27] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:09:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3090038845523297503.gal : 1 ms
[2025-05-30 12:09:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7431135491033208635.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/CTLCardinality3090038845523297503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7431135491033208635.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,475954,0.109138,8572,2,1347,5,15273,6,0,1096,19921,0


Converting to forward existential form...Done !
original formula: AX(EX((((p282==1) + EG((p526==0))) + !(A((p315==1) U (p127!=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((((p282==1) + EG((p526==0))) + !(!((E(!((p127!=1)) U (!((p315==1)) * !((p127!=1)))) + EG(!((p1...179
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t21, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t95...305
(forward)formula 0,1,4.87234,169444,1,0,924,822147,557,480,5867,1.00118e+06,1246
FORMULA CO4-PT-11-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 246 transition count 302
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 246 transition count 302
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 229 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 229 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 229 transition count 284
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 93 place count 221 transition count 276
Iterating global reduction 1 with 8 rules applied. Total rules applied 101 place count 221 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 216 transition count 271
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 216 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 213 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 213 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 212 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 212 transition count 267
Applied a total of 119 rules in 20 ms. Remains 212 /271 variables (removed 59) and now considering 267/327 (removed 60) transitions.
// Phase 1: matrix 267 rows 212 cols
[2025-05-30 12:09:31] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 12:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:32] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-05-30 12:09: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/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/479 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:37] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:38] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 217 constraints, problems are : Problem set: 0 solved, 266 unsolved in 16425 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/479 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 266/483 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:13] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 484 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46452ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 46453ms
Starting structural reductions in LTL mode, iteration 1 : 212/271 places, 267/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46638 ms. Remains : 212/271 places, 267/327 transitions.
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:10:18] [INFO ] Input system was already deterministic with 267 transitions.
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:10:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:10:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4001318845003961759.gal : 2 ms
[2025-05-30 12:10:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12849133642669460522.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/CTLCardinality4001318845003961759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12849133642669460522.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,533668,0.097524,7844,2,1349,5,14228,6,0,1113,15279,0


Converting to forward existential form...Done !
original formula: EF(EX(((p386==0)&&(p454==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((p386==0)&&(p454==1)))] != FALSE
(forward)formula 0,1,0.124134,8100,1,0,8,14228,8,1,1764,15279,2
FORMULA CO4-PT-11-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 244 transition count 300
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 244 transition count 300
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 225 transition count 281
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 225 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 104 place count 215 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 114 place count 215 transition count 269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 209 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 205 transition count 258
Applied a total of 135 rules in 16 ms. Remains 205 /271 variables (removed 66) and now considering 258/327 (removed 69) transitions.
// Phase 1: matrix 258 rows 205 cols
[2025-05-30 12:10:18] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-05-30 12:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:24] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15883 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:47] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)timeout

(s156 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45927ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45927ms
Starting structural reductions in LTL mode, iteration 1 : 205/271 places, 258/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46158 ms. Remains : 205/271 places, 258/327 transitions.
[2025-05-30 12:11:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:11:04] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:11:04] [INFO ] Input system was already deterministic with 258 transitions.
[2025-05-30 12:11:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:11:04] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:11:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality18080455239962687849.gal : 1 ms
[2025-05-30 12:11:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9815814226836380026.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/CTLCardinality18080455239962687849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9815814226836380026.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,459604,0.092698,7740,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EF((EX(((p535==0)&&(p485==1))) * EF((p422==0))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(((p535==0)&&(p485==1)))),TRUE) * (p422==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.742754,33200,1,0,337,83772,534,219,5904,94219,526
FORMULA CO4-PT-11-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Graph (trivial) has 277 edges and 271 vertex of which 3 / 271 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 402 edges and 269 vertex of which 263 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 262 transition count 188
Reduce places removed 129 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 131 rules applied. Total rules applied 262 place count 133 transition count 186
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 264 place count 132 transition count 185
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 264 place count 132 transition count 171
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 292 place count 118 transition count 171
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 300 place count 110 transition count 163
Iterating global reduction 3 with 8 rules applied. Total rules applied 308 place count 110 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 308 place count 110 transition count 161
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 312 place count 108 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 316 place count 104 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 320 place count 104 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 104 transition count 156
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 357 place count 86 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 360 place count 86 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 361 place count 85 transition count 135
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 363 place count 83 transition count 133
Iterating global reduction 6 with 2 rules applied. Total rules applied 365 place count 83 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 374 place count 83 transition count 124
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 6 with 4 rules applied. Total rules applied 378 place count 83 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 382 place count 79 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 382 place count 79 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 78 transition count 119
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 8 with 2 rules applied. Total rules applied 386 place count 77 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 388 place count 75 transition count 116
Applied a total of 388 rules in 49 ms. Remains 75 /271 variables (removed 196) and now considering 116/327 (removed 211) transitions.
// Phase 1: matrix 116 rows 75 cols
[2025-05-30 12:11:05] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 12:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:11:05] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:11:05] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2025-05-30 12:11:05] [INFO ] Invariant cache hit.
[2025-05-30 12:11:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 115/190 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 79 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 115/190 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 106/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 185 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8010ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 8010ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/271 places, 116/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8158 ms. Remains : 75/271 places, 116/327 transitions.
[2025-05-30 12:11:13] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:11:13] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:11:13] [INFO ] Input system was already deterministic with 116 transitions.
[2025-05-30 12:11:13] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:11:13] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:11:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10782021215926876034.gal : 0 ms
[2025-05-30 12:11:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2520146246846337134.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/CTLCardinality10782021215926876034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2520146246846337134.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,12529,0.019188,4492,2,225,5,2137,6,0,408,1984,0


Converting to forward existential form...Done !
original formula: AF(E((p213==0) U (p202!=0)))
=> equivalent forward existential formula: [FwdG(Init,!(E((p213==0) U (p202!=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t22, t44, t49, t78, t113, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,0.14988,10892,1,0,217,32221,257,145,2454,42072,321
FORMULA CO4-PT-11-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 244 transition count 300
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 244 transition count 300
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 226 transition count 282
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 226 transition count 280
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 216 transition count 270
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 216 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 210 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 210 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 210 transition count 263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 207 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 207 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 206 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 206 transition count 259
Applied a total of 133 rules in 12 ms. Remains 206 /271 variables (removed 65) and now considering 259/327 (removed 68) transitions.
// Phase 1: matrix 259 rows 206 cols
[2025-05-30 12:11:14] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 12:11:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-05-30 12:11:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/465 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:19] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 211 constraints, problems are : Problem set: 0 solved, 258 unsolved in 16016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/465 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 258/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:45] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/465 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 470 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46048ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 46049ms
Starting structural reductions in LTL mode, iteration 1 : 206/271 places, 259/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46228 ms. Remains : 206/271 places, 259/327 transitions.
[2025-05-30 12:12:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:12:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:12:00] [INFO ] Input system was already deterministic with 259 transitions.
[2025-05-30 12:12:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:12:00] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:12:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality18067453706951033502.gal : 1 ms
[2025-05-30 12:12:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality18119781742305901643.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/CTLCardinality18067453706951033502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18119781742305901643.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,462532,0.121068,7748,2,1315,5,13602,6,0,1081,14545,0


Converting to forward existential form...Done !
original formula: AF(EX(AX((p223==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!((p223==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,0,2.80679,110160,1,0,608,352741,541,404,5777,766297,730
FORMULA CO4-PT-11-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 271/271 places, 327/327 transitions.
Graph (complete) has 404 edges and 271 vertex of which 265 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 264 transition count 193
Reduce places removed 126 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 128 rules applied. Total rules applied 255 place count 138 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 259 place count 137 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 135 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 261 place count 135 transition count 173
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 291 place count 120 transition count 173
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 299 place count 112 transition count 165
Iterating global reduction 4 with 8 rules applied. Total rules applied 307 place count 112 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 307 place count 112 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 311 place count 110 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 315 place count 106 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 319 place count 106 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 320 place count 106 transition count 158
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 356 place count 88 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 359 place count 88 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 360 place count 87 transition count 137
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 362 place count 85 transition count 135
Iterating global reduction 7 with 2 rules applied. Total rules applied 364 place count 85 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 372 place count 85 transition count 127
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 7 with 4 rules applied. Total rules applied 376 place count 85 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 380 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 380 place count 81 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 382 place count 80 transition count 122
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 9 with 2 rules applied. Total rules applied 384 place count 79 transition count 121
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 389 place count 79 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 391 place count 77 transition count 119
Applied a total of 391 rules in 50 ms. Remains 77 /271 variables (removed 194) and now considering 119/327 (removed 208) transitions.
// Phase 1: matrix 119 rows 77 cols
[2025-05-30 12:12:03] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-30 12:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:03] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:12:03] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 12:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 0/196 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 80 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 109/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:06] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 190 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7384ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7384ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/271 places, 119/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7531 ms. Remains : 77/271 places, 119/327 transitions.
[2025-05-30 12:12:10] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:12:10] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:12:10] [INFO ] Input system was already deterministic with 119 transitions.
[2025-05-30 12:12:10] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:12:10] [INFO ] Flatten gal took : 2 ms
[2025-05-30 12:12:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality9933718422345596278.gal : 0 ms
[2025-05-30 12:12:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5232477199355558417.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/CTLCardinality9933718422345596278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5232477199355558417.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,12746,0.037499,4720,2,312,5,2982,6,0,422,2682,0


Converting to forward existential form...Done !
original formula: A(((p1==0)||(p309==1)) U AF(!(((p399==0)||(p286==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(((p399==0)||(p286==1)))))))))) * !(E(!(!(EG(!(!(((p399==0)||(p286==1))))))) U (!(((p1=...226
Reverse transition relation is NOT exact ! Due to transitions t9, t20, t38, t43, t74, t111, Intersection with reachable at each step enabled. (destroyed/r...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.29612,17612,1,0,356,85210,268,246,2688,72797,559
FORMULA CO4-PT-11-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-30 12:12:11] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:12:11] [INFO ] Flatten gal took : 6 ms
Total runtime 382945 ms.

BK_STOP 1748607131116

--------------------
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="CO4-PT-11"
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 CO4-PT-11, 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 r044-tall-174854028500457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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