Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 98K 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-07-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-07-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-07-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-07-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-07-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748605625697

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 11:47:06] [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 11:47:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:47:07] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-05-30 11:47:07] [INFO ] Transformed 384 places.
[2025-05-30 11:47:07] [INFO ] Transformed 456 transitions.
[2025-05-30 11:47:07] [INFO ] Found NUPN structural information;
[2025-05-30 11:47:07] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 275 transition count 335
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 51 place count 234 transition count 292
Iterating global reduction 1 with 41 rules applied. Total rules applied 92 place count 234 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 234 transition count 290
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 111 place count 217 transition count 273
Iterating global reduction 2 with 17 rules applied. Total rules applied 128 place count 217 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 217 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 216 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 216 transition count 271
Applied a total of 131 rules in 72 ms. Remains 216 /284 variables (removed 68) and now considering 271/336 (removed 65) transitions.
// Phase 1: matrix 271 rows 216 cols
[2025-05-30 11:47:07] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:07] [INFO ] Implicit Places using invariants in 232 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 215/284 places, 271/336 transitions.
Applied a total of 0 rules in 11 ms. Remains 215 /215 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 215/284 places, 271/336 transitions.
Support contains 67 out of 215 places after structural reductions.
[2025-05-30 11:47:07] [INFO ] Flatten gal took : 37 ms
[2025-05-30 11:47:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 11:47:07] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:47:07] [INFO ] Input system was already deterministic with 271 transitions.
Support contains 57 out of 215 places (down from 67) after GAL structural reductions.
RANDOM walk for 40000 steps (101 resets) in 1323 ms. (30 steps per ms) remains 21/35 properties
BEST_FIRST walk for 4001 steps (37 resets) in 47 ms. (83 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4001 steps (33 resets) in 103 ms. (38 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4002 steps (34 resets) in 58 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (32 resets) in 22 ms. (173 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4000 steps (22 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (22 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (15 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (27 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (32 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (24 resets) in 18 ms. (210 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (25 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (34 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (30 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (29 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
// Phase 1: matrix 271 rows 215 cols
[2025-05-30 11:47:08] [INFO ] Computed 3 invariants in 5 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 14/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 83/133 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 161/294 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 155/449 variables, 88/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 11 (OVERLAPS) 37/486 variables, 26/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/486 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 218 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 14/46 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3/49 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 155/284 variables, 48/100 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 14/114 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 162/446 variables, 89/204 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 13 (OVERLAPS) 40/486 variables, 29/233 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/486 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 233 constraints, problems are : Problem set: 2 solved, 13 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3539ms problems are : Problem set: 2 solved, 13 unsolved
Parikh walk visited 12 properties in 737 ms.
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 271/271 transitions.
Graph (trivial) has 225 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 342 edges and 214 vertex of which 198 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 198 transition count 157
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 188 place count 111 transition count 156
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 188 place count 111 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 210 place count 100 transition count 145
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 91 transition count 135
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 91 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 230 place count 91 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 230 place count 91 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 236 place count 88 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 85 transition count 127
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 85 transition count 127
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 310 place count 51 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 313 place count 51 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 314 place count 50 transition count 79
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 50 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 317 place count 49 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 117 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 6 rules applied. Total rules applied 323 place count 48 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 326 place count 45 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 329 place count 45 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 330 place count 45 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 334 place count 43 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 336 place count 43 transition count 65
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 338 place count 41 transition count 63
Iterating global reduction 7 with 2 rules applied. Total rules applied 340 place count 41 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 341 place count 41 transition count 62
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 342 place count 40 transition count 61
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 40 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 344 place count 40 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 364 place count 30 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 381 place count 30 transition count 44
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 389 place count 22 transition count 36
Iterating global reduction 10 with 8 rules applied. Total rules applied 397 place count 22 transition count 36
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 404 place count 22 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 405 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 406 place count 21 transition count 27
Iterating global reduction 11 with 1 rules applied. Total rules applied 407 place count 21 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 408 place count 21 transition count 26
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 412 place count 21 transition count 22
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 417 place count 17 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 418 place count 17 transition count 21
Graph (complete) has 37 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 419 place count 16 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 420 place count 16 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 421 place count 16 transition count 20
Graph (complete) has 34 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 422 place count 15 transition count 20
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 423 place count 15 transition count 19
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 424 place count 15 transition count 19
Graph (complete) has 31 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 425 place count 14 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 426 place count 14 transition count 18
Applied a total of 426 rules in 56 ms. Remains 14 /215 variables (removed 201) and now considering 18/271 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 14/215 places, 18/271 transitions.
RANDOM walk for 6770 steps (2 resets) in 16 ms. (398 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2025-05-30 11:47:12] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:47:12] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:47:12] [INFO ] Input system was already deterministic with 271 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 344 edges and 215 vertex of which 210 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 188 transition count 244
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 188 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 188 transition count 242
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 67 place count 176 transition count 229
Iterating global reduction 2 with 12 rules applied. Total rules applied 79 place count 176 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 171 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 171 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 169 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 169 transition count 219
Applied a total of 95 rules in 17 ms. Remains 169 /215 variables (removed 46) and now considering 219/271 (removed 52) transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-30 11:47:12] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 11:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:13] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:47:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:17] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:17] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14236 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/388 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 392 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19058 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33352ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 33354ms
Starting structural reductions in LTL mode, iteration 1 : 169/215 places, 219/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33534 ms. Remains : 169/215 places, 219/271 transitions.
[2025-05-30 11:47:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:47:46] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:47:46] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-30 11:47:46] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:47:46] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:47:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3065496154008002108.gal : 4 ms
[2025-05-30 11:47:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5082138499219288846.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3065496154008002108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5082138499219288846.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,220731,0.1104,7940,2,828,5,14169,6,0,893,17302,0


Converting to forward existential form...Done !
original formula: AG(((EX(AX(EF((p348==0)))) + (p85==0)) + (p283==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p283==1))) * !((p85==0))) * !(EX(!(EX(!(E(TRUE U (p348==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
(forward)formula 0,1,0.709862,31032,1,0,279,118567,463,182,5126,103030,452
FORMULA CO4-PT-07-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 188 transition count 244
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 188 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 188 transition count 242
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 68 place count 175 transition count 228
Iterating global reduction 2 with 13 rules applied. Total rules applied 81 place count 175 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 170 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 170 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 170 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 168 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 168 transition count 218
Applied a total of 97 rules in 16 ms. Remains 168 /215 variables (removed 47) and now considering 218/271 (removed 53) transitions.
// Phase 1: matrix 218 rows 168 cols
[2025-05-30 11:47:47] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-05-30 11:47:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:47] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 11:47:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:51] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:47:51] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:06] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 27204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41345ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 41346ms
Starting structural reductions in LTL mode, iteration 1 : 168/215 places, 218/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41512 ms. Remains : 168/215 places, 218/271 transitions.
[2025-05-30 11:48:28] [INFO ] Flatten gal took : 12 ms
[2025-05-30 11:48:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:48:28] [INFO ] Input system was already deterministic with 218 transitions.
[2025-05-30 11:48:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:48:28] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:48:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13699920847052680364.gal : 3 ms
[2025-05-30 11:48:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17782861796183193363.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/CTLCardinality13699920847052680364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17782861796183193363.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,218967,0.09165,7476,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: EF(AX(((p114==0) * AX((p378==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p114==0) * !(EX(!((p378==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
(forward)formula 0,1,0.600594,25760,1,0,283,87914,454,181,4825,92520,448
FORMULA CO4-PT-07-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 192 transition count 248
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 192 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 192 transition count 246
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 182 transition count 235
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 182 transition count 235
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 177 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 177 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 177 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 175 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 175 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 175 transition count 225
Applied a total of 83 rules in 10 ms. Remains 175 /215 variables (removed 40) and now considering 225/271 (removed 46) transitions.
// Phase 1: matrix 225 rows 175 cols
[2025-05-30 11:48:29] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-30 11:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:29] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-30 11:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 225/400 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 180 constraints, problems are : Problem set: 0 solved, 224 unsolved in 15647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/400 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 224/404 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:48:53] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 405 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45695ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 45698ms
Starting structural reductions in LTL mode, iteration 1 : 175/215 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45874 ms. Remains : 175/215 places, 225/271 transitions.
[2025-05-30 11:49:15] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:49:15] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:49:15] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-30 11:49:15] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:49:15] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:49:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality13323823187372822220.gal : 2 ms
[2025-05-30 11:49:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17692109362602806551.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/CTLCardinality13323823187372822220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17692109362602806551.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,277871,0.120571,8900,2,1119,5,17447,6,0,923,22508,0


Converting to forward existential form...Done !
original formula: EG(((p231==1) + EX((((EG(((p298==0)&&(p105==1))) + EF(((p102==0)&&(p191==1)))) * (p249==0)) * ((p152==0)&&(p259==0))))))
=> equivalent forward existential formula: [FwdG(Init,((p231==1) + EX((((EG(((p298==0)&&(p105==1))) + E(TRUE U ((p102==0)&&(p191==1)))) * (p249==0)) * ((p1...187
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t11, t17, t26, t31, t32, t34, t35, t39, t40, t43, t46, t56, t67, t77,...344
(forward)formula 0,1,5.26297,187616,1,0,670,896307,485,382,5457,1.23101e+06,773
FORMULA CO4-PT-07-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 196 transition count 252
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 196 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 196 transition count 250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 48 place count 187 transition count 241
Iterating global reduction 2 with 9 rules applied. Total rules applied 57 place count 187 transition count 241
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 184 transition count 237
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 184 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 184 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 183 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 183 transition count 235
Applied a total of 66 rules in 11 ms. Remains 183 /215 variables (removed 32) and now considering 235/271 (removed 36) transitions.
// Phase 1: matrix 235 rows 183 cols
[2025-05-30 11:49:20] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 11:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-05-30 11:49:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/418 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:25] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:25] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/418 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 188 constraints, problems are : Problem set: 0 solved, 234 unsolved in 16355 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/418 variables, 183/188 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 234/422 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:45] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 423 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46393ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 46394ms
Starting structural reductions in LTL mode, iteration 1 : 183/215 places, 235/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46559 ms. Remains : 183/215 places, 235/271 transitions.
[2025-05-30 11:50:07] [INFO ] Flatten gal took : 9 ms
[2025-05-30 11:50:07] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:50:07] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-30 11:50:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:50:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:50:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8992683446707886671.gal : 2 ms
[2025-05-30 11:50:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17871858556469617601.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/CTLCardinality8992683446707886671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17871858556469617601.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,282567,0.068135,6716,2,1085,5,9535,6,0,965,9022,0


Converting to forward existential form...Done !
original formula: (A(EX(((p146==0)||(p155==1))) U ((((p371==0) * EX(TRUE)) * (!(A((p137!=1) U EG((p268==1)))) * (p279==0))) * (p327==1))) * E(AF((((((p304=...283
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(((((p371==0) * EX(TRUE)) * (!(!((E(!(EG((p268==1))) U (!((p137!=1)) * !(EG((p268==1))))) +...707
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t18, t27, t33, t47, t49, t51, t68, t158, t165, t181, t184, t188,...268
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,10.7623,328124,1,0,1534,1.69659e+06,523,935,5719,2.06547e+06,1832
FORMULA CO4-PT-07-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Graph (trivial) has 225 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 343 edges and 214 vertex of which 213 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 212 transition count 180
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 124 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 179 place count 124 transition count 168
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 201 place count 113 transition count 168
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 209 place count 105 transition count 159
Iterating global reduction 2 with 8 rules applied. Total rules applied 217 place count 105 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 105 transition count 158
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 218 place count 105 transition count 155
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 224 place count 102 transition count 155
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 227 place count 99 transition count 152
Iterating global reduction 3 with 3 rules applied. Total rules applied 230 place count 99 transition count 152
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 254 place count 87 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 260 place count 87 transition count 134
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 rules applied. Total rules applied 267 place count 84 transition count 130
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 270 place count 83 transition count 128
Reduce places removed 1 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 6 with 3 rules applied. Total rules applied 273 place count 82 transition count 126
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 275 place count 81 transition count 125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 276 place count 80 transition count 124
Iterating global reduction 8 with 1 rules applied. Total rules applied 277 place count 80 transition count 124
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 279 place count 79 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 283 place count 79 transition count 119
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 8 with 1 rules applied. Total rules applied 284 place count 79 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 285 place count 78 transition count 118
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 10 with 2 rules applied. Total rules applied 287 place count 77 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 289 place count 75 transition count 115
Applied a total of 289 rules in 45 ms. Remains 75 /215 variables (removed 140) and now considering 115/271 (removed 156) transitions.
// Phase 1: matrix 115 rows 75 cols
[2025-05-30 11:50:18] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:18] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-30 11:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:50:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:50:18] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 11:50:18] [INFO ] Invariant cache hit.
[2025-05-30 11:50:18] [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/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/190 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 79 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 104/181 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/190 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 184 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4812 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9030ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 9031ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/215 places, 115/271 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9192 ms. Remains : 75/215 places, 115/271 transitions.
[2025-05-30 11:50:27] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:50:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:50:27] [INFO ] Input system was already deterministic with 115 transitions.
[2025-05-30 11:50:27] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:50:27] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:50:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality17586662782242665175.gal : 0 ms
[2025-05-30 11:50:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10442482324985033428.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/CTLCardinality17586662782242665175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10442482324985033428.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,11329,0.018698,4324,2,218,5,1754,6,0,405,1514,0


Converting to forward existential form...Done !
original formula: EG(AF(((p141==0)||(p182==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p141==0)||(p182==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t36, t38, t48, t55, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.118566,9444,1,0,229,24166,256,144,2299,30444,371
FORMULA CO4-PT-07-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 191 transition count 248
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 191 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 191 transition count 246
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 59 place count 181 transition count 235
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 181 transition count 235
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 178 transition count 231
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 178 transition count 231
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 176 transition count 229
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 176 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 176 transition count 228
Applied a total of 80 rules in 9 ms. Remains 176 /215 variables (removed 39) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 176 cols
[2025-05-30 11:50:27] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 11:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:27] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-05-30 11:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 228/404 variables, 176/179 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:32] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:32] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 181 constraints, problems are : Problem set: 0 solved, 227 unsolved in 15185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/404 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 227/408 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:48] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 409 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45231ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 45231ms
Starting structural reductions in LTL mode, iteration 1 : 176/215 places, 228/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45392 ms. Remains : 176/215 places, 228/271 transitions.
[2025-05-30 11:51:12] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:51:12] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:51:12] [INFO ] Input system was already deterministic with 228 transitions.
[2025-05-30 11:51:12] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:51:12] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:51:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14853862596933773358.gal : 1 ms
[2025-05-30 11:51:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15225360627589593890.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/CTLCardinality14853862596933773358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15225360627589593890.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,254103,0.0918,7740,2,827,5,13419,6,0,930,15983,0


Converting to forward existential form...Done !
original formula: A((p196==0) U !(EF((AX(((p84==0)||(p317==1))) + EG((p174==0))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (!(EX(!(((p84==0)||(p317==1))))) + EG((p174==0))))))))) * !(E(!(!(E(TRUE U (!(EX(!((...296
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t44, t45, t48, t158, t182, t2...259
(forward)formula 0,0,7.8721,275964,1,0,776,1.95349e+06,488,422,5493,1.58282e+06,1043
FORMULA CO4-PT-07-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Graph (trivial) has 226 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 343 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 208 transition count 177
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 121 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 177 place count 121 transition count 165
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 199 place count 110 transition count 165
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 207 place count 102 transition count 156
Iterating global reduction 2 with 8 rules applied. Total rules applied 215 place count 102 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 102 transition count 155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 216 place count 102 transition count 152
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 99 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 225 place count 96 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 228 place count 96 transition count 149
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 252 place count 84 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 258 place count 84 transition count 131
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 rules applied. Total rules applied 265 place count 81 transition count 127
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 268 place count 80 transition count 125
Reduce places removed 1 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 6 with 3 rules applied. Total rules applied 271 place count 79 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 273 place count 78 transition count 122
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 274 place count 77 transition count 121
Iterating global reduction 8 with 1 rules applied. Total rules applied 275 place count 77 transition count 121
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 277 place count 76 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 281 place count 76 transition count 116
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 8 with 1 rules applied. Total rules applied 282 place count 76 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 283 place count 75 transition count 115
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 10 with 2 rules applied. Total rules applied 285 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 287 place count 72 transition count 112
Applied a total of 287 rules in 47 ms. Remains 72 /215 variables (removed 143) and now considering 112/271 (removed 159) transitions.
// Phase 1: matrix 112 rows 72 cols
[2025-05-30 11:51:20] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 11:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:51:21] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:51:21] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-05-30 11:51:21] [INFO ] Invariant cache hit.
[2025-05-30 11:51:21] [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/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 102/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 178 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6489ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6489ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/215 places, 112/271 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6666 ms. Remains : 72/215 places, 112/271 transitions.
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:51:27] [INFO ] Input system was already deterministic with 112 transitions.
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:51:27] [INFO ] Flatten gal took : 3 ms
[2025-05-30 11:51:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8420362128416722708.gal : 1 ms
[2025-05-30 11:51:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4381465779396038967.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/CTLCardinality8420362128416722708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4381465779396038967.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,10753,0.021621,4292,2,212,5,1677,6,0,393,1421,0


Converting to forward existential form...Done !
original formula: AF((p257==1))
=> equivalent forward existential formula: [FwdG(Init,!((p257==1)))] = FALSE
Hit Full ! (commute/partial/dont) 110/0/2
(forward)formula 0,0,0.054561,5828,1,0,10,10103,20,4,1817,5411,8
FORMULA CO4-PT-07-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 189 transition count 245
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 189 transition count 245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 189 transition count 243
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 176 transition count 229
Iterating global reduction 2 with 13 rules applied. Total rules applied 79 place count 176 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 84 place count 171 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 89 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 171 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 169 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 169 transition count 219
Applied a total of 95 rules in 14 ms. Remains 169 /215 variables (removed 46) and now considering 219/271 (removed 52) transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-30 11:51:27] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 11:51:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:51:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:32] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14505 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:49] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44533ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 44533ms
Starting structural reductions in LTL mode, iteration 1 : 169/215 places, 219/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44687 ms. Remains : 169/215 places, 219/271 transitions.
[2025-05-30 11:52:12] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:52:12] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:52:12] [INFO ] Input system was already deterministic with 219 transitions.
[2025-05-30 11:52:12] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:52:12] [INFO ] Flatten gal took : 8 ms
[2025-05-30 11:52:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11148185826669425150.gal : 1 ms
[2025-05-30 11:52:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality3144545851357999405.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/CTLCardinality11148185826669425150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3144545851357999405.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,223927,0.102828,7476,2,780,5,12373,6,0,893,15195,0


Converting to forward existential form...Done !
original formula: AX(EX(AF(!(E(((p228==0)||(p334==1)) U (p359==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(!(E(((p228==0)||(p334==1)) U (p359==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, t2...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.82085,139332,1,0,693,876119,466,427,5291,856135,858
FORMULA CO4-PT-07-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 190 transition count 246
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 190 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 190 transition count 244
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 178 transition count 231
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 178 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 173 transition count 225
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 173 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 173 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 171 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 171 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 171 transition count 221
Applied a total of 91 rules in 17 ms. Remains 171 /215 variables (removed 44) and now considering 221/271 (removed 50) transitions.
// Phase 1: matrix 221 rows 171 cols
[2025-05-30 11:52:16] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 11:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-05-30 11:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/392 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:20] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:20] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 176 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/392 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 220/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:36] [INFO ] Deduced a trap along path composed of 2 places in 13 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/392 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 397 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44518ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 44519ms
Starting structural reductions in LTL mode, iteration 1 : 171/215 places, 221/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44675 ms. Remains : 171/215 places, 221/271 transitions.
[2025-05-30 11:53:00] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:53:00] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:53:00] [INFO ] Input system was already deterministic with 221 transitions.
[2025-05-30 11:53:00] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:53:00] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:53:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2829782223217889916.gal : 1 ms
[2025-05-30 11:53:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17073268484375694957.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/CTLCardinality2829782223217889916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17073268484375694957.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,224259,0.107034,7988,2,791,5,14023,6,0,903,17233,0


Converting to forward existential form...Done !
original formula: (EG(EF((p84==1))) + (E(!(AF((p251!=1))) U ((p354!=0) + EF((p236!=0)))) * AX(A(((p85==0)||(p287==1)) U AG((p232==0))))))
=> equivalent forward existential formula: ([((Init * !(EG(E(TRUE U (p84==1))))) * !(E(!(!(EG(!((p251!=1))))) U ((p354!=0) + E(TRUE U (p236!=0))))))] = FAL...389
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t176, t203, Inter...249
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.08575,120256,1,0,701,809550,494,411,5650,565800,969
FORMULA CO4-PT-07-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 193 transition count 249
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 193 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 193 transition count 247
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 56 place count 182 transition count 235
Iterating global reduction 2 with 11 rules applied. Total rules applied 67 place count 182 transition count 235
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 177 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 177 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 177 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 175 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 175 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 175 transition count 225
Applied a total of 83 rules in 7 ms. Remains 175 /215 variables (removed 40) and now considering 225/271 (removed 46) transitions.
// Phase 1: matrix 225 rows 175 cols
[2025-05-30 11:53:04] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 11:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-30 11:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 225/400 variables, 175/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:08] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:08] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/400 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 180 constraints, problems are : Problem set: 0 solved, 224 unsolved in 15061 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/400 variables, 175/180 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 224/404 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:26] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 405 constraints, problems are : Problem set: 0 solved, 224 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45086ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 45086ms
Starting structural reductions in LTL mode, iteration 1 : 175/215 places, 225/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45226 ms. Remains : 175/215 places, 225/271 transitions.
[2025-05-30 11:53:49] [INFO ] Flatten gal took : 11 ms
[2025-05-30 11:53:49] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:53:49] [INFO ] Input system was already deterministic with 225 transitions.
[2025-05-30 11:53:49] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:53:49] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:53:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17738279199202189260.gal : 1 ms
[2025-05-30 11:53:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14094547820375677648.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/CTLCardinality17738279199202189260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14094547820375677648.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,231315,0.107891,8124,2,810,5,14580,6,0,923,18431,0


Converting to forward existential form...Done !
original formula: ((A(AX(AX((p237!=1))) U (p103==0)) * EG(AG((((p93==0)||(p3==1))||(p113==1))))) * A(!(EG((((p233==0)&&(!((p157==0)||(p272==1))))||(p191==0...204
=> equivalent forward existential formula: [(((Init * (!((E(!((p103==0)) U (!(!(EX(!(!(EX(!((p237!=1)))))))) * !((p103==0)))) + EG(!((p103==0))))) * EG(!(E...468
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t154, t179, t207, Inter...249
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.2058,383648,1,0,1248,2.59478e+06,501,705,5772,2.5252e+06,1536
FORMULA CO4-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 214 transition count 271
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 188 transition count 244
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 188 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 188 transition count 242
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 68 place count 175 transition count 228
Iterating global reduction 2 with 13 rules applied. Total rules applied 81 place count 175 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 170 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 170 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 170 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 168 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 168 transition count 218
Applied a total of 97 rules in 18 ms. Remains 168 /215 variables (removed 47) and now considering 218/271 (removed 53) transitions.
// Phase 1: matrix 218 rows 168 cols
[2025-05-30 11:54:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:00] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 11:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:05] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:05] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14233 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:19] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 27149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41396ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 41396ms
Starting structural reductions in LTL mode, iteration 1 : 168/215 places, 218/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41556 ms. Remains : 168/215 places, 218/271 transitions.
[2025-05-30 11:54:42] [INFO ] Flatten gal took : 6 ms
[2025-05-30 11:54:42] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:54:42] [INFO ] Input system was already deterministic with 218 transitions.
[2025-05-30 11:54:42] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:54:42] [INFO ] Flatten gal took : 4 ms
[2025-05-30 11:54:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13976286130505159215.gal : 1 ms
[2025-05-30 11:54:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality76544648608803405.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/CTLCardinality13976286130505159215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality76544648608803405.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,218967,0.086441,7476,2,769,5,12746,6,0,888,15298,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t17, t26, t31, t32, t34, t35, t39, t40, t43, t152, t175, t202, Inter...249
(forward)formula 0,1,1.1318,51632,1,0,464,173862,457,306,4970,300735,593
FORMULA CO4-PT-07-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 11:54:43] [INFO ] Flatten gal took : 10 ms
[2025-05-30 11:54:43] [INFO ] Flatten gal took : 5 ms
Total runtime 456424 ms.

BK_STOP 1748606083438

--------------------
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-07"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-07, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028400425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-07.tgz
mv CO4-PT-07 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;