Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 23K 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 Parking-PT-104-CTLCardinality-2023-12
FORMULA_NAME Parking-PT-104-CTLCardinality-2023-13
FORMULA_NAME Parking-PT-104-CTLCardinality-2023-14
FORMULA_NAME Parking-PT-104-CTLCardinality-2023-15
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-00
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-01
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-02
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-03
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-04
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-05
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-06
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-07
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-08
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-09
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-10
FORMULA_NAME Parking-PT-104-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748881234910

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 16:20:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 16:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 16:20:36] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2025-06-02 16:20:36] [INFO ] Transformed 65 places.
[2025-06-02 16:20:36] [INFO ] Transformed 97 transitions.
[2025-06-02 16:20:36] [INFO ] Found NUPN structural information;
[2025-06-02 16:20:36] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Support contains 58 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2025-06-02 16:20:36] [INFO ] Computed 16 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-02 16:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:36] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2025-06-02 16:20:36] [INFO ] Invariant cache hit.
[2025-06-02 16:20:36] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:37] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:37] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 56/121 variables, 65/148 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 12/160 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 160 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2546 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 56/121 variables, 65/148 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 12/160 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 55/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 215 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2054 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4650ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4665ms
Finished structural reductions in LTL mode , in 1 iterations and 5012 ms. Remains : 65/65 places, 56/56 transitions.
Support contains 58 out of 65 places after structural reductions.
[2025-06-02 16:20:41] [INFO ] Flatten gal took : 20 ms
[2025-06-02 16:20:41] [INFO ] Flatten gal took : 25 ms
[2025-06-02 16:20:41] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 56 out of 65 places (down from 58) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 81 to 79
RANDOM walk for 40000 steps (2391 resets) in 1589 ms. (25 steps per ms) remains 14/79 properties
BEST_FIRST walk for 40003 steps (413 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (484 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (414 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (408 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (413 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (416 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (407 resets) in 136 ms. (292 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (408 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (409 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (423 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (483 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (407 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (418 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (401 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
[2025-06-02 16:20:42] [INFO ] Invariant cache hit.
[2025-06-02 16:20:42] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 31/54 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 31/65 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/61 variables, 4/69 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 7/76 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem AtomicPropp72 is UNSAT
At refinement iteration 8 (OVERLAPS) 4/65 variables, 1/77 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 4/81 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 56/121 variables, 65/146 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 12/158 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/158 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/121 variables, 0/158 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 158 constraints, problems are : Problem set: 4 solved, 10 unsolved in 365 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 37/52 variables, 11/26 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 37/63 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 7/59 variables, 4/67 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 7/74 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/74 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 6/65 variables, 1/75 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 6/81 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/81 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 56/121 variables, 65/146 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 12/158 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 10/168 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 16:20:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 1/169 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 0/169 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/121 variables, 0/169 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 169 constraints, problems are : Problem set: 4 solved, 10 unsolved in 601 ms.
Refiners :[Domain max(s): 65/65 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 987ms problems are : Problem set: 4 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 262 ms.
Support contains 9 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 57 transition count 48
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 57 transition count 42
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 51 transition count 42
Applied a total of 28 rules in 24 ms. Remains 51 /65 variables (removed 14) and now considering 42/56 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 51/65 places, 42/56 transitions.
RANDOM walk for 33744 steps (2217 resets) in 344 ms. (97 steps per ms) remains 0/8 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 4 ms
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 5 ms
[2025-06-02 16:20:44] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 16:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants in 55 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 58 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 56/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 52
Applied a total of 8 rules in 2 ms. Remains 55 /59 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 55 cols
[2025-06-02 16:20:44] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-02 16:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 55/65 places, 52/56 transitions.
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 16 ms
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 4 ms
[2025-06-02 16:20:44] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10714346722664194546.gal : 5 ms
[2025-06-02 16:20:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15647051863261927032.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/CTLCardinality10714346722664194546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15647051863261927032.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,28673,0.025009,4148,2,309,5,2152,6,0,274,2652,0


Converting to forward existential form...Done !
original formula: (EF(AG((p5==1))) + ((EX(EF((p29==1))) + EG((((p27==0)&&(p63==1))&&((p52==0)&&(p7==1))))) * ((EF(((p21==0)&&(p27==1))) + EG((p14==1))) + (...186
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p5==1)))))] != FALSE + (([(FwdU((Init * (EX(E(TRUE U (p29==1))) + EG((((p27==...479
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t29, t32, t35, t36, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.105118,8244,1,0,116,28085,126,54,1619,19531,122
FORMULA Parking-PT-104-CTLCardinality-2025-00 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 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2025-06-02 16:20:44] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants in 104 ms returned [24, 32, 40, 58, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 55
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 59 cols
[2025-06-02 16:20:44] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 16:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:44] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/65 places, 55/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 59/65 places, 55/56 transitions.
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 4 ms
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 4 ms
[2025-06-02 16:20:44] [INFO ] Input system was already deterministic with 55 transitions.
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:44] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality8150187570017424393.gal : 1 ms
[2025-06-02 16:20:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12134240165089102075.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/CTLCardinality8150187570017424393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12134240165089102075.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,30977,0.016623,4472,2,400,5,2532,6,0,293,2882,0


Converting to forward existential form...Done !
original formula: !(A(!(((!((EF(((p63==0)||(p45==1))) * ((p62==0)||(p1==1)))) + AX(((p46==1)&&((p1==0)||(p33==1))))) + ((p52==0)||(p47==1)))) U (((((EX((p2...336
=> equivalent forward existential formula: ((([(((((FwdU(Init,!((((((EX((p29==1)) + (p0==1)) * !(((p30==0)||(p53==1)))) + !(!(EG(!((p36==0)))))) + (!((((p1...1731
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t32, t51, t53, t54, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,0,1.16962,54580,1,0,593,334974,172,287,1822,275058,713
FORMULA Parking-PT-104-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:46] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 52 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 53 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 52
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 55 cols
[2025-06-02 16:20:46] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 16:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 55/65 places, 52/56 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5812773099853398207.gal : 1 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10229663028474236447.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/CTLCardinality5812773099853398207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10229663028474236447.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,24833,0.014353,4320,2,245,5,2129,6,0,274,2407,0


Converting to forward existential form...Done !
original formula: AF(EX(EX((p41==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX((p41==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.109269,9312,1,0,188,26615,124,117,1588,35399,182
FORMULA Parking-PT-104-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:46] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 43 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 44 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 52
Applied a total of 6 rules in 1 ms. Remains 55 /58 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 55 cols
[2025-06-02 16:20:46] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 16:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 55/65 places, 52/56 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 4 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3233943535279429225.gal : 1 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11018117603591200679.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/CTLCardinality3233943535279429225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11018117603591200679.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,24833,0.013899,4324,2,246,5,1997,6,0,274,2353,0


Converting to forward existential form...Done !
original formula: AG(A(A(!(((EG((p27==1)) * (p8==1)) * (p49==1))) U !(AG(((p29==0)||(p9==1))))) U ((p6==1) * !(EX(((p46==0)||(p6==1)))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(((p6==1) * !(EX(((p46==0)||(p6==1))))))) * !(!((E(!(!(!(E(TRUE U !(((p29==0)||(p9==1...709
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.044294,5732,1,0,107,9615,125,58,1592,7076,119
FORMULA Parking-PT-104-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:46] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 40 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 52
Applied a total of 6 rules in 2 ms. Remains 55 /58 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 55 cols
[2025-06-02 16:20:46] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 16:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 55/65 places, 52/56 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:46] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality7853681151097923145.gal : 1 ms
[2025-06-02 16:20:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality15427517644286900916.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/CTLCardinality7853681151097923145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15427517644286900916.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,24833,0.014899,4320,2,249,5,2129,6,0,274,2242,0


Converting to forward existential form...Done !
original formula: EX((EG(AF(((p22==1)||((p25==0)&&(p13==1))))) + (p37==1)))
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EG(!(((p22==1)||((p25==0)&&(p13==1)))))))] != FALSE + [(EY(Init) * (p37==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.169288,12640,1,0,200,61699,130,91,1597,32431,250
FORMULA Parking-PT-104-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2025-06-02 16:20:46] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:47] [INFO ] Implicit Places using invariants in 51 ms returned [24, 32, 48, 58]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 55
Applied a total of 2 rules in 1 ms. Remains 60 /61 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 60 cols
[2025-06-02 16:20:47] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-02 16:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 60/65 places, 55/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 60/65 places, 55/56 transitions.
[2025-06-02 16:20:47] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:47] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:47] [INFO ] Input system was already deterministic with 55 transitions.
[2025-06-02 16:20:47] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:47] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16333874807458533754.gal : 1 ms
[2025-06-02 16:20:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality14519099414917577899.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/CTLCardinality16333874807458533754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14519099414917577899.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,30977,0.016496,4492,2,403,5,2612,6,0,297,2846,0


Converting to forward existential form...Done !
original formula: (AF(((((p55==0)||(p36==1)) * E((EF(((p49==0)||(p31==1))) * A((p40==1) U (p22==0))) U A(((p54==0)||(p62==1)) U ((p63==0)||(p29==1))))) * E...324
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((((p27!=0)&&(p5!=1)) + E(TRUE U ((p19==0)||(p44==1)))) * !(E(((p16==0)||(p31==1)) U !...534
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t51, t52, t53, Intersection with reachable at each step enabled. (destroyed/reverse/...182
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.01071,47304,1,0,681,302335,160,341,1923,221958,793
FORMULA Parking-PT-104-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 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:48] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants in 42 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 43 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 2 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2025-06-02 16:20:48] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 16:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/65 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 54/65 places, 51/56 transitions.
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality16545662672544440248.gal : 0 ms
[2025-06-02 16:20:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality15330876613843337991.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/CTLCardinality16545662672544440248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15330876613843337991.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,24065,0.017976,4312,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: EX(EG(EF(((p22==0)&&(p16==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U ((p22==0)&&(p16==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.149579,11736,1,0,167,39159,127,109,1634,51321,179
FORMULA Parking-PT-104-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:48] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants in 41 ms returned [24, 32, 40, 48, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 42 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 52
Applied a total of 6 rules in 1 ms. Remains 56 /59 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 56 cols
[2025-06-02 16:20:48] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 16:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 56/65 places, 52/56 transitions.
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:48] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality3633843114660553603.gal : 1 ms
[2025-06-02 16:20:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1458818142104015008.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/CTLCardinality3633843114660553603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1458818142104015008.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,24833,0.014261,4332,2,317,5,2031,6,0,278,2173,0


Converting to forward existential form...Done !
original formula: AG(((AF(AG((p52!=1))) + !(E(!(((p22==0)||(p27==1))) U E((p57==1) U (p58==0))))) + ((((p6==0)||(p55==0))&&(((p12==1)||(p26==0))||(p45==1))...188
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((!(EG(!(!(E(TRUE U !((p52!=1))))))) + !(E(!(((p22==0)||(p27==1))) U E((p57==1) U (p5...463
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.681296,34460,1,0,566,197052,149,371,1806,156525,682
FORMULA Parking-PT-104-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:49] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants in 44 ms returned [32, 40, 48, 58, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 45 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 55/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 54
Applied a total of 2 rules in 1 ms. Remains 58 /59 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 58 cols
[2025-06-02 16:20:49] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 16:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 58/65 places, 54/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 58/65 places, 54/56 transitions.
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:49] [INFO ] Input system was already deterministic with 54 transitions.
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7139015581031506741.gal : 1 ms
[2025-06-02 16:20:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1590868920918906569.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/CTLCardinality7139015581031506741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1590868920918906569.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,26369,0.017549,4340,2,345,5,2232,6,0,288,2025,0


Converting to forward existential form...Done !
original formula: (AG(EF(((p53==0)||(p2==1)))) * ((EG(((p49==0)&&(p13==1))) + EG((p46==1))) + (EF(((p8==0)||(p29==1))) + (AX((((A((p34==1) U ((p33==0)||(p2...283
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((p53==0)||(p2==1)))))] = FALSE * ((((([(FwdU(EY(((Init * !((EG(((p49==0)&&(p13=...1002
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.368923,21320,1,0,322,118644,160,159,1785,80869,381
FORMULA Parking-PT-104-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 3 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:49] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants in 41 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 41 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 55 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 55 transition count 52
Applied a total of 6 rules in 1 ms. Remains 55 /58 variables (removed 3) and now considering 52/55 (removed 3) transitions.
// Phase 1: matrix 52 rows 55 cols
[2025-06-02 16:20:49] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 16:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/65 places, 52/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 55/65 places, 52/56 transitions.
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:49] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:49] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 7 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15671109606228840474.gal : 1 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1548877591641202785.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/CTLCardinality15671109606228840474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1548877591641202785.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,24833,0.017475,4324,2,245,5,2129,6,0,274,2407,0


Converting to forward existential form...Done !
original formula: EF((AG(E(((p4==0)||(p51==1)) U ((p47==0)||(p50==1)))) * EF(EX((((p41==0)&&(p34==1))&&((p0==0)||(p36==1)))))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * !(E(TRUE U !(E(((p4==0)||(p51==1)) U ((p47==0)||(p50==1))))))),TRUE)) * (((p41==0)&...198
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.105236,8932,1,0,128,30756,129,65,1753,20912,146
FORMULA Parking-PT-104-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 1 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:50] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 50 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 51 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 1 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2025-06-02 16:20:50] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-02 16:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/65 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 54/65 places, 51/56 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2548635920848024854.gal : 0 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1791263598528361310.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/CTLCardinality2548635920848024854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1791263598528361310.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,24065,0.015235,4320,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: (EG(EX(TRUE)) * AG(EF(AX((p56==0)))))
=> equivalent forward existential formula: ([(Init * !(EG(EX(TRUE))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p56==0)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.259607,16908,1,0,185,89270,130,115,1712,55237,226
FORMULA Parking-PT-104-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 59 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 59 transition count 50
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 2 with 2 rules applied. Total rules applied 12 place count 58 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 58 transition count 49
Applied a total of 13 rules in 15 ms. Remains 58 /65 variables (removed 7) and now considering 49/56 (removed 7) transitions.
// Phase 1: matrix 49 rows 58 cols
[2025-06-02 16:20:50] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 39 ms returned [23, 31, 37, 43, 53, 55]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 52 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/65 places, 49/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 45
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 0 with 2 rules applied. Total rules applied 10 place count 47 transition count 44
Applied a total of 10 rules in 4 ms. Remains 47 /52 variables (removed 5) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 47 cols
[2025-06-02 16:20:50] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 16:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/65 places, 44/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 158 ms. Remains : 47/65 places, 44/56 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 1 ms
[2025-06-02 16:20:50] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7098664038104086818.gal : 0 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8521020460886823753.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/CTLCardinality7098664038104086818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8521020460886823753.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,14848,0.011504,4080,2,140,5,1251,6,0,235,1219,0


Converting to forward existential form...Done !
original formula: EG((p19!=1))
=> equivalent forward existential formula: [FwdG(Init,(p19!=1))] != FALSE
Hit Full ! (commute/partial/dont) 42/0/2
(forward)formula 0,1,0.025973,4848,1,0,9,4943,19,4,1132,3482,8
FORMULA Parking-PT-104-CTLCardinality-2025-11 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 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 2 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:50] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 40 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 54 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 1 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2025-06-02 16:20:50] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-02 16:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/65 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 54/65 places, 51/56 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 6 ms
[2025-06-02 16:20:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2481716933302026994.gal : 0 ms
[2025-06-02 16:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3637875578666797550.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/CTLCardinality2481716933302026994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3637875578666797550.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,24065,0.019266,4320,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: AF(((p50==1) + AG(EX(((p37!=0)&&(p16!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p50==1) + !(E(TRUE U !(EX(((p37!=0)&&(p16!=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.11735,9440,1,0,179,28428,128,114,1642,34533,181
FORMULA Parking-PT-104-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 1 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:51] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants in 41 ms returned [24, 32, 40, 48, 58, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 42 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/65 places, 55/56 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 54 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 54 transition count 51
Applied a total of 8 rules in 1 ms. Remains 54 /58 variables (removed 4) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 54 cols
[2025-06-02 16:20:51] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-02 16:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/65 places, 51/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 54/65 places, 51/56 transitions.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11442292400268003915.gal : 1 ms
[2025-06-02 16:20:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12223347094650121534.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/CTLCardinality11442292400268003915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12223347094650121534.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,24065,0.016612,4320,2,232,5,1973,6,0,269,2137,0


Converting to forward existential form...Done !
original formula: EG(EX((p8==1)))
=> equivalent forward existential formula: [FwdG(Init,EX((p8==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.119625,9312,1,0,186,27587,122,111,1563,35575,174
FORMULA Parking-PT-104-CTLCardinality-2023-13 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 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 7 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 64 cols
[2025-06-02 16:20:51] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants in 37 ms returned [32, 40, 48, 58, 60]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 55/56 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 57 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 53
Applied a total of 4 rules in 5 ms. Remains 57 /59 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 57 cols
[2025-06-02 16:20:51] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-02 16:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 16:20:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 57/65 places, 53/56 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 57/65 places, 53/56 transitions.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Input system was already deterministic with 53 transitions.
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality364848520921095276.gal : 0 ms
[2025-06-02 16:20:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14679797498674680304.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/CTLCardinality364848520921095276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14679797498674680304.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,25601,0.015003,4336,2,354,5,2275,6,0,283,2332,0


Converting to forward existential form...Done !
original formula: E(AX((EG(((p29==0)||(p46==1))) * ((p16==0)||(p10==1)))) U !((!(EF((p4==1))) + !((E(AG(((p11==0)||(p41==1))) U (p13!=1)) + !(((AF((p24==1)...185
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(EX(!((EG(((p29==0)||(p46==1))) * ((p16==0)||(p10==1))))))) * !(!((E(!(E(TRUE U !(((p11==0)||...259
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.493043,27164,1,0,500,158184,152,250,1830,104883,614
FORMULA Parking-PT-104-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 64 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 62 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 62 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 61 transition count 52
Applied a total of 8 rules in 6 ms. Remains 61 /65 variables (removed 4) and now considering 52/56 (removed 4) transitions.
// Phase 1: matrix 52 rows 61 cols
[2025-06-02 16:20:52] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:52] [INFO ] Implicit Places using invariants in 41 ms returned [24, 32, 40, 46]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/65 places, 52/56 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 49
Applied a total of 6 rules in 2 ms. Remains 54 /57 variables (removed 3) and now considering 49/52 (removed 3) transitions.
// Phase 1: matrix 49 rows 54 cols
[2025-06-02 16:20:52] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 16:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 16:20:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 16:20:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/65 places, 49/56 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 144 ms. Remains : 54/65 places, 49/56 transitions.
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 3 ms
[2025-06-02 16:20:52] [INFO ] Input system was already deterministic with 49 transitions.
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 2 ms
[2025-06-02 16:20:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14433296822377977979.gal : 0 ms
[2025-06-02 16:20:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12194133884104161427.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/CTLCardinality14433296822377977979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12194133884104161427.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,16897,0.012021,4188,2,332,5,1841,6,0,267,1681,0


Converting to forward existential form...Done !
original formula: EG(((p36==0) * (((p5==0) + ((p49==1) * AG(((p49==0)||(p58==1))))) + ((p60==0)&&(p56==1)))))
=> equivalent forward existential formula: [FwdG(Init,((p36==0) * (((p5==0) + ((p49==1) * !(E(TRUE U !(((p49==0)||(p58==1))))))) + ((p60==0)&&(p56==1)))))]...164
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.108059,9308,1,0,62,33471,25,41,1345,24100,48
FORMULA Parking-PT-104-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 5 ms
[2025-06-02 16:20:52] [INFO ] Flatten gal took : 3 ms
Total runtime 16212 ms.

BK_STOP 1748881252392

--------------------
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="Parking-PT-104"
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 Parking-PT-104, 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 r142-tall-174876812500401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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