Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000249.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is BART-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 46M
-rw-r--r-- 1 mcc users 1.3M Mar 5 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.5M Mar 5 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Mar 5 09:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 562K Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 680K Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3M Mar 5 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.1M Mar 5 09:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Mar 5 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5M Mar 5 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 242K Mar 15 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 3 18:30 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 BART-PT-020-CTLCardinality-2024-00
FORMULA_NAME BART-PT-020-CTLCardinality-2024-01
FORMULA_NAME BART-PT-020-CTLCardinality-2024-02
FORMULA_NAME BART-PT-020-CTLCardinality-2024-03
FORMULA_NAME BART-PT-020-CTLCardinality-2024-04
FORMULA_NAME BART-PT-020-CTLCardinality-2024-05
FORMULA_NAME BART-PT-020-CTLCardinality-2024-06
FORMULA_NAME BART-PT-020-CTLCardinality-2024-07
FORMULA_NAME BART-PT-020-CTLCardinality-2024-08
FORMULA_NAME BART-PT-020-CTLCardinality-2024-09
FORMULA_NAME BART-PT-020-CTLCardinality-2024-10
FORMULA_NAME BART-PT-020-CTLCardinality-2024-11
FORMULA_NAME BART-PT-020-CTLCardinality-2024-12
FORMULA_NAME BART-PT-020-CTLCardinality-2024-13
FORMULA_NAME BART-PT-020-CTLCardinality-2024-14
FORMULA_NAME BART-PT-020-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779551629179

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 15:53:51] [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]
[2026-05-23 15:53:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:53:52] [INFO ] Load time of PNML (sax parser for PT used): 854 ms
[2026-05-23 15:53:52] [INFO ] Transformed 2850 places.
[2026-05-23 15:53:52] [INFO ] Transformed 4040 transitions.
[2026-05-23 15:53:52] [INFO ] Found NUPN structural information;
[2026-05-23 15:53:52] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 1141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 192 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BART-PT-020-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 617 places :
Symmetric choice reduction at 0 with 617 rule applications. Total rules 617 place count 2023 transition count 3423
Iterating global reduction 0 with 617 rules applied. Total rules applied 1234 place count 2023 transition count 3423
Discarding 506 places :
Symmetric choice reduction at 0 with 506 rule applications. Total rules 1740 place count 1517 transition count 2917
Iterating global reduction 0 with 506 rules applied. Total rules applied 2246 place count 1517 transition count 2917
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 2322 place count 1441 transition count 2841
Iterating global reduction 0 with 76 rules applied. Total rules applied 2398 place count 1441 transition count 2841
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2457 place count 1382 transition count 2782
Iterating global reduction 0 with 59 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2575 place count 1323 transition count 2723
Iterating global reduction 0 with 59 rules applied. Total rules applied 2634 place count 1323 transition count 2723
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2693 place count 1264 transition count 2664
Iterating global reduction 0 with 59 rules applied. Total rules applied 2752 place count 1264 transition count 2664
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 2804 place count 1212 transition count 2612
Iterating global reduction 0 with 52 rules applied. Total rules applied 2856 place count 1212 transition count 2612
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 2905 place count 1163 transition count 2563
Iterating global reduction 0 with 49 rules applied. Total rules applied 2954 place count 1163 transition count 2563
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 2987 place count 1130 transition count 2530
Iterating global reduction 0 with 33 rules applied. Total rules applied 3020 place count 1130 transition count 2530
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 3049 place count 1101 transition count 2501
Iterating global reduction 0 with 29 rules applied. Total rules applied 3078 place count 1101 transition count 2501
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 3093 place count 1086 transition count 2486
Iterating global reduction 0 with 15 rules applied. Total rules applied 3108 place count 1086 transition count 2486
Applied a total of 3108 rules in 1830 ms. Remains 1086 /2640 variables (removed 1554) and now considering 2486/4040 (removed 1554) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16699986349148654135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8194579991593434089.kers'
[2026-05-23 15:53:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16699986349148654135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8194579991593434089.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2486 rows 1086 cols 4972 entries
Finished phase 1 with 1066 SingleSign rule and 0 generalized
[2026-05-23 15:53:55] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8194579991593434089.kers
Total runtime 15 ms.
[2026-05-23 15:53:56] [INFO ] Implicit Places using invariants in 758 ms returned []
[2026-05-23 15:53:56] [INFO ] Invariant cache hit.
[2026-05-23 15:53:57] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2026-05-23 15:53:57] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1066/3572 variables, and 0 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1766 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1066/3572 variables, and 0 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 0/1766 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61171ms problems are : Problem set: 0 solved, 1766 unsolved
Search for dead transitions found 0 dead transitions in 61211ms
Starting structural reductions in LTL mode, iteration 1 : 1086/2640 places, 2486/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65461 ms. Remains : 1086/2640 places, 2486/4040 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Applied a total of 0 rules in 69 ms. Remains 1086 /1086 variables (removed 0) and now considering 2486/2486 (removed 0) transitions.
[2026-05-23 15:54:58] [INFO ] Invariant cache hit.
[2026-05-23 15:54:59] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-23 15:54:59] [INFO ] Invariant cache hit.
[2026-05-23 15:55:00] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1950 ms. Remains : 1086/1086 places, 2486/2486 transitions.
Support contains 49 out of 1086 places after structural reductions.
[2026-05-23 15:55:01] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 15:55:01] [INFO ] Flatten gal took : 343 ms
[2026-05-23 15:55:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BART-PT-020-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 15:55:01] [INFO ] Flatten gal took : 149 ms
[2026-05-23 15:55:01] [INFO ] Input system was already deterministic with 2486 transitions.
Support contains 31 out of 1086 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2253 ms. (17 steps per ms) remains 0/18 properties
[2026-05-23 15:55:02] [INFO ] Flatten gal took : 67 ms
[2026-05-23 15:55:02] [INFO ] Flatten gal took : 60 ms
[2026-05-23 15:55:02] [INFO ] Input system was already deterministic with 2486 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1049 transition count 2449
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1049 transition count 2449
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 99 place count 1024 transition count 2424
Iterating global reduction 0 with 25 rules applied. Total rules applied 124 place count 1024 transition count 2424
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 1014 transition count 2414
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 1014 transition count 2414
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 1005 transition count 2405
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 1005 transition count 2405
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 997 transition count 2397
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 997 transition count 2397
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 184 place count 991 transition count 2391
Iterating global reduction 0 with 6 rules applied. Total rules applied 190 place count 991 transition count 2391
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 194 place count 987 transition count 2387
Iterating global reduction 0 with 4 rules applied. Total rules applied 198 place count 987 transition count 2387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 202 place count 983 transition count 2383
Iterating global reduction 0 with 4 rules applied. Total rules applied 206 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 982 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 981 transition count 2381
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 981 transition count 2381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 980 transition count 2380
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 980 transition count 2380
Applied a total of 212 rules in 669 ms. Remains 980 /1086 variables (removed 106) and now considering 2380/2486 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16824689656585371538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7268270626676313330.kers'
[2026-05-23 15:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16824689656585371538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7268270626676313330.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2380 rows 980 cols 4760 entries
Finished phase 1 with 960 SingleSign rule and 0 generalized
[2026-05-23 15:55:03] [INFO ] Computed 20 invariants in 20 ms
Computed 20 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-7268270626676313330.kers
Total runtime 23 ms.
[2026-05-23 15:55:03] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-23 15:55:03] [INFO ] Invariant cache hit.
[2026-05-23 15:55:05] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:55:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60992ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61005ms
Starting structural reductions in LTL mode, iteration 1 : 980/1086 places, 2380/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63310 ms. Remains : 980/1086 places, 2380/2486 transitions.
[2026-05-23 15:56:06] [INFO ] Flatten gal took : 81 ms
[2026-05-23 15:56:06] [INFO ] Flatten gal took : 77 ms
[2026-05-23 15:56:06] [INFO ] Input system was already deterministic with 2380 transitions.
[2026-05-23 15:56:06] [INFO ] Flatten gal took : 75 ms
[2026-05-23 15:56:06] [INFO ] Flatten gal took : 45 ms
[2026-05-23 15:56:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5079175181507281084.gal : 49 ms
[2026-05-23 15:56:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9814433295656315276.ctl : 5 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5079175181507281084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9814433295656315276.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,6.36681e+33,2.21308,22304,2,1946,5,15308,6,0,6303,8251,0


Converting to forward existential form...Done !
original formula: AG(EF(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX(TRUE))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,10.5963,154212,1,0,5,959953,13,0,25208,13613,4
FORMULA BART-PT-020-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1049 transition count 2449
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1049 transition count 2449
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 99 place count 1024 transition count 2424
Iterating global reduction 0 with 25 rules applied. Total rules applied 124 place count 1024 transition count 2424
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 1014 transition count 2414
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 1014 transition count 2414
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 153 place count 1005 transition count 2405
Iterating global reduction 0 with 9 rules applied. Total rules applied 162 place count 1005 transition count 2405
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 997 transition count 2397
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 997 transition count 2397
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 184 place count 991 transition count 2391
Iterating global reduction 0 with 6 rules applied. Total rules applied 190 place count 991 transition count 2391
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 194 place count 987 transition count 2387
Iterating global reduction 0 with 4 rules applied. Total rules applied 198 place count 987 transition count 2387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 202 place count 983 transition count 2383
Iterating global reduction 0 with 4 rules applied. Total rules applied 206 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 982 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 981 transition count 2381
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 981 transition count 2381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 980 transition count 2380
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 980 transition count 2380
Applied a total of 212 rules in 430 ms. Remains 980 /1086 variables (removed 106) and now considering 2380/2486 (removed 106) transitions.
[2026-05-23 15:56:18] [INFO ] Invariant cache hit.
[2026-05-23 15:56:18] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-23 15:56:18] [INFO ] Invariant cache hit.
[2026-05-23 15:56:19] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 980/1086 places, 2380/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2120 ms. Remains : 980/1086 places, 2380/2486 transitions.
[2026-05-23 15:56:19] [INFO ] Flatten gal took : 35 ms
[2026-05-23 15:56:19] [INFO ] Flatten gal took : 35 ms
[2026-05-23 15:56:19] [INFO ] Input system was already deterministic with 2380 transitions.
[2026-05-23 15:56:19] [INFO ] Flatten gal took : 62 ms
[2026-05-23 15:56:20] [INFO ] Flatten gal took : 35 ms
[2026-05-23 15:56:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10941032433651035947.gal : 24 ms
[2026-05-23 15:56:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10991298588561177843.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10941032433651035947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10991298588561177843.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36681e+33,2.13716,22388,2,1946,5,15308,6,0,6303,8251,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,7.88361,145956,1,0,5,959953,9,0,23290,13539,2
FORMULA BART-PT-020-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Graph (trivial) has 2437 edges and 1086 vertex of which 961 / 1086 are part of one of the 18 SCC in 7 ms
Free SCC test removed 943 places
Ensure Unique test removed 2193 transitions
Reduce isomorphic transitions removed 2193 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 128 transition count 266
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 17 rules applied. Total rules applied 45 place count 115 transition count 262
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 6 rules applied. Total rules applied 51 place count 113 transition count 258
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 55 place count 111 transition count 256
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 110 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 58 place count 109 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 58 place count 109 transition count 253
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 62 place count 107 transition count 253
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 106 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 106 transition count 252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 65 place count 105 transition count 251
Iterating global reduction 6 with 1 rules applied. Total rules applied 66 place count 105 transition count 251
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 67 place count 104 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 104 transition count 250
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 104 place count 86 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 106 place count 86 transition count 230
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 110 place count 84 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 114 place count 84 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 118 place count 82 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 122 place count 82 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 126 place count 80 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 130 place count 80 transition count 212
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 134 place count 78 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 138 place count 78 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 142 place count 76 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 146 place count 76 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 150 place count 74 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 154 place count 74 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 158 place count 72 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 162 place count 72 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 166 place count 70 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 170 place count 70 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 174 place count 68 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 178 place count 68 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 182 place count 66 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 186 place count 66 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 190 place count 64 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 194 place count 64 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 198 place count 62 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 202 place count 62 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 206 place count 60 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 210 place count 60 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 214 place count 58 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 218 place count 58 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 222 place count 56 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 226 place count 56 transition count 140
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 230 place count 54 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 234 place count 54 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 238 place count 52 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 242 place count 52 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 246 place count 50 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 250 place count 50 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 254 place count 48 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 258 place count 48 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 262 place count 46 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 266 place count 46 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 270 place count 44 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 274 place count 44 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 278 place count 42 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 282 place count 42 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 29 with 4 rules applied. Total rules applied 286 place count 40 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 290 place count 40 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 4 rules applied. Total rules applied 294 place count 38 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 298 place count 38 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 302 place count 36 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 306 place count 36 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 310 place count 34 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 314 place count 34 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 318 place count 32 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 322 place count 32 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 4 rules applied. Total rules applied 326 place count 30 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 330 place count 30 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 4 rules applied. Total rules applied 334 place count 28 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 338 place count 28 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 4 rules applied. Total rules applied 342 place count 26 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 346 place count 26 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 350 place count 24 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 354 place count 24 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 4 rules applied. Total rules applied 358 place count 22 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 362 place count 22 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 4 rules applied. Total rules applied 366 place count 20 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 370 place count 20 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 4 rules applied. Total rules applied 374 place count 18 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 40 with 5 rules applied. Total rules applied 379 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 41 with 3 rules applied. Total rules applied 382 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 42 with 2 rules applied. Total rules applied 384 place count 16 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 43 with 1 Pre rules applied. Total rules applied 384 place count 16 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 386 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 43 with 3 rules applied. Total rules applied 389 place count 15 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 43 with 1 Pre rules applied. Total rules applied 389 place count 15 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 391 place count 14 transition count 17
Applied a total of 391 rules in 162 ms. Remains 14 /1086 variables (removed 1072) and now considering 17/2486 (removed 2469) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8431301532579986128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-482419619947558114.kers'
[2026-05-23 15:56:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8431301532579986128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-482419619947558114.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 16 rows 10 cols 24 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-23 15:56:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-482419619947558114.kers
Total runtime 1 ms.
[2026-05-23 15:56:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 15:56:28] [INFO ] Invariant cache hit.
[2026-05-23 15:56:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2026-05-23 15:56:28] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-23 15:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/30 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 344ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/1086 places, 17/2486 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 577 ms. Remains : 14/1086 places, 17/2486 transitions.
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 2 ms
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:56:28] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:56:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10744477385717589192.gal : 0 ms
[2026-05-23 15:56:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7973288671124498217.ctl : 5 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10744477385717589192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7973288671124498217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,96,0.006296,3816,2,27,5,117,5,0,74,73,0


Converting to forward existential form...Done !
original formula: E(A((TrainState_5_2_29==1) U EF(((TrainState_12_3_31==1)||(TrainState_14_2_36==1)))) U !(EG((((TrainState_14_4_26==0)||(TrainState_14_4_2...219
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(E(TRUE U ((TrainState_12_3_31==1)||(TrainState_14_2_36==1)))) U (!((TrainState_5_2_29==1)) * ...426
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.013108,4116,1,0,7,386,15,1,294,151,9
FORMULA BART-PT-020-CTLCardinality-2024-08 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 : 1086/1086 places, 2486/2486 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1051 transition count 2451
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1051 transition count 2451
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 94 place count 1027 transition count 2427
Iterating global reduction 0 with 24 rules applied. Total rules applied 118 place count 1027 transition count 2427
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 1018 transition count 2418
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 1018 transition count 2418
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 1010 transition count 2410
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 1010 transition count 2410
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 159 place count 1003 transition count 2403
Iterating global reduction 0 with 7 rules applied. Total rules applied 166 place count 1003 transition count 2403
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 171 place count 998 transition count 2398
Iterating global reduction 0 with 5 rules applied. Total rules applied 176 place count 998 transition count 2398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 180 place count 994 transition count 2394
Iterating global reduction 0 with 4 rules applied. Total rules applied 184 place count 994 transition count 2394
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 188 place count 990 transition count 2390
Iterating global reduction 0 with 4 rules applied. Total rules applied 192 place count 990 transition count 2390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 989 transition count 2389
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 989 transition count 2389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 988 transition count 2388
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 988 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 987 transition count 2387
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 987 transition count 2387
Applied a total of 198 rules in 789 ms. Remains 987 /1086 variables (removed 99) and now considering 2387/2486 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13957460101171145988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4768364811093106444.kers'
[2026-05-23 15:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13957460101171145988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4768364811093106444.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2387 rows 987 cols 4774 entries
Finished phase 1 with 967 SingleSign rule and 0 generalized
[2026-05-23 15:56:29] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4768364811093106444.kers
Total runtime 19 ms.
[2026-05-23 15:56:29] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-23 15:56:29] [INFO ] Invariant cache hit.
[2026-05-23 15:56:31] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Running 1667 sub problems to find dead transitions.
[2026-05-23 15:56:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 967/3374 variables, and 0 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 1667/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1667 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 967/3374 variables, and 0 constraints, problems are : Problem set: 0 solved, 1667 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/987 constraints, PredecessorRefiner: 0/1667 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60663ms problems are : Problem set: 0 solved, 1667 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Starting structural reductions in LTL mode, iteration 1 : 987/1086 places, 2387/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63085 ms. Remains : 987/1086 places, 2387/2486 transitions.
[2026-05-23 15:57:31] [INFO ] Flatten gal took : 60 ms
[2026-05-23 15:57:31] [INFO ] Flatten gal took : 58 ms
[2026-05-23 15:57:31] [INFO ] Input system was already deterministic with 2387 transitions.
[2026-05-23 15:57:32] [INFO ] Flatten gal took : 56 ms
[2026-05-23 15:57:32] [INFO ] Flatten gal took : 52 ms
[2026-05-23 15:57:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality12210723833547267348.gal : 22 ms
[2026-05-23 15:57:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality12542653530864738746.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12210723833547267348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12542653530864738746.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,7.29226e+33,2.65473,22552,2,1955,5,15498,6,0,6338,8441,0


Converting to forward existential form...Done !
original formula: EG(EX((EG(EF((TrainState_18_2_31==1))) * AF((TrainState_6_4_21==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX((EG(E(TRUE U (TrainState_18_2_31==1))) * !(EG(!((TrainState_6_4_21==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,14.8886,177604,1,0,8,978745,27,3,28246,24071,14
FORMULA BART-PT-020-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1053 transition count 2453
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1053 transition count 2453
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 89 place count 1030 transition count 2430
Iterating global reduction 0 with 23 rules applied. Total rules applied 112 place count 1030 transition count 2430
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 1020 transition count 2420
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 1020 transition count 2420
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 141 place count 1011 transition count 2411
Iterating global reduction 0 with 9 rules applied. Total rules applied 150 place count 1011 transition count 2411
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 158 place count 1003 transition count 2403
Iterating global reduction 0 with 8 rules applied. Total rules applied 166 place count 1003 transition count 2403
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 172 place count 997 transition count 2397
Iterating global reduction 0 with 6 rules applied. Total rules applied 178 place count 997 transition count 2397
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 182 place count 993 transition count 2393
Iterating global reduction 0 with 4 rules applied. Total rules applied 186 place count 993 transition count 2393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 190 place count 989 transition count 2389
Iterating global reduction 0 with 4 rules applied. Total rules applied 194 place count 989 transition count 2389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 988 transition count 2388
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 988 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 987 transition count 2387
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 987 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 986 transition count 2386
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 986 transition count 2386
Applied a total of 200 rules in 836 ms. Remains 986 /1086 variables (removed 100) and now considering 2386/2486 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5507111963665261773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16169159191141688602.kers'
[2026-05-23 15:57:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5507111963665261773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16169159191141688602.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2386 rows 986 cols 4772 entries
Finished phase 1 with 966 SingleSign rule and 0 generalized
[2026-05-23 15:57:47] [INFO ] Computed 20 invariants in 14 ms
Computed 20 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16169159191141688602.kers
Total runtime 17 ms.
[2026-05-23 15:57:48] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-23 15:57:48] [INFO ] Invariant cache hit.
[2026-05-23 15:57:49] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2026-05-23 15:57:49] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/3372 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/3372 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Starting structural reductions in LTL mode, iteration 1 : 986/1086 places, 2386/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63289 ms. Remains : 986/1086 places, 2386/2486 transitions.
[2026-05-23 15:58:50] [INFO ] Flatten gal took : 59 ms
[2026-05-23 15:58:50] [INFO ] Flatten gal took : 54 ms
[2026-05-23 15:58:50] [INFO ] Input system was already deterministic with 2386 transitions.
[2026-05-23 15:58:50] [INFO ] Flatten gal took : 53 ms
[2026-05-23 15:58:50] [INFO ] Flatten gal took : 55 ms
[2026-05-23 15:58:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality754273225480516101.gal : 15 ms
[2026-05-23 15:58:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8394512487111988281.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality754273225480516101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8394512487111988281.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18154e+33,2.54189,22672,2,2146,5,18448,6,0,6333,9779,0


Converting to forward existential form...Done !
original formula: AX(EF(EG((((TrainState_13_3_37==0)||(TrainState_7_2_24==1))&&((TrainState_3_2_38==0)||(TrainState_15_3_24==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((((TrainState_13_3_37==0)||(TrainState_7_2_24==1))&&((TrainState_3_2_38==0)||(TrainSt...185
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,14.0243,180964,1,0,6,1.0619e+06,22,0,26305,48808,8
FORMULA BART-PT-020-CTLCardinality-2024-10 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 : 1086/1086 places, 2486/2486 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1051 transition count 2451
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1051 transition count 2451
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 95 place count 1026 transition count 2426
Iterating global reduction 0 with 25 rules applied. Total rules applied 120 place count 1026 transition count 2426
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 1016 transition count 2416
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 1016 transition count 2416
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 1007 transition count 2407
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 1007 transition count 2407
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 166 place count 999 transition count 2399
Iterating global reduction 0 with 8 rules applied. Total rules applied 174 place count 999 transition count 2399
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 180 place count 993 transition count 2393
Iterating global reduction 0 with 6 rules applied. Total rules applied 186 place count 993 transition count 2393
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 190 place count 989 transition count 2389
Iterating global reduction 0 with 4 rules applied. Total rules applied 194 place count 989 transition count 2389
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 198 place count 985 transition count 2385
Iterating global reduction 0 with 4 rules applied. Total rules applied 202 place count 985 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 984 transition count 2384
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 984 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 983 transition count 2383
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 983 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 982 transition count 2382
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 982 transition count 2382
Applied a total of 208 rules in 486 ms. Remains 982 /1086 variables (removed 104) and now considering 2382/2486 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16074764622374811717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5978765727942213126.kers'
[2026-05-23 15:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16074764622374811717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5978765727942213126.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2382 rows 982 cols 4764 entries
Finished phase 1 with 962 SingleSign rule and 0 generalized
[2026-05-23 15:59:05] [INFO ] Computed 20 invariants in 14 ms
Computed 20 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-5978765727942213126.kers
Total runtime 19 ms.
[2026-05-23 15:59:05] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-23 15:59:05] [INFO ] Invariant cache hit.
[2026-05-23 15:59:06] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Running 1662 sub problems to find dead transitions.
[2026-05-23 15:59:06] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 1662 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/982 constraints, PredecessorRefiner: 1662/1662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1662 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 962/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 1662 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/982 constraints, PredecessorRefiner: 0/1662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 1662 unsolved
Search for dead transitions found 0 dead transitions in 60578ms
Starting structural reductions in LTL mode, iteration 1 : 982/1086 places, 2382/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62538 ms. Remains : 982/1086 places, 2382/2486 transitions.
[2026-05-23 16:00:07] [INFO ] Flatten gal took : 49 ms
[2026-05-23 16:00:07] [INFO ] Flatten gal took : 47 ms
[2026-05-23 16:00:07] [INFO ] Input system was already deterministic with 2382 transitions.
[2026-05-23 16:00:07] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:00:07] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:00:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality17889061979749624183.gal : 15 ms
[2026-05-23 16:00:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality13203327193040024096.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17889061979749624183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13203327193040024096.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.62933e+33,2.62352,22444,2,1945,5,15434,6,0,6313,8344,0


Converting to forward existential form...Done !
original formula: EX((EX(EX(EG(((TrainState_18_2_20!=0)&&(TrainState_20_2_33!=1))))) * AG(EF(((TrainState_18_1_7==0)||(TrainState_20_1_16==1))))))
=> equivalent forward existential formula: [((EY(Init) * EX(EX(EG(((TrainState_18_2_20!=0)&&(TrainState_20_2_33!=1)))))) * !(E(TRUE U !(E(TRUE U ((TrainSta...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,14.8094,169916,1,0,11,1.00058e+06,23,2,26211,39993,12
FORMULA BART-PT-020-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1086/1086 places, 2486/2486 transitions.
Graph (trivial) has 2476 edges and 1086 vertex of which 1067 / 1086 are part of one of the 20 SCC in 8 ms
Free SCC test removed 1047 places
Ensure Unique test removed 2432 transitions
Reduce isomorphic transitions removed 2432 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 16 rules applied. Total rules applied 17 place count 23 transition count 38
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 26 place count 20 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 29 place count 19 transition count 30
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 32 place count 18 transition count 28
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 35 place count 17 transition count 26
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 38 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 40 place count 15 transition count 23
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 9 with 2 rules applied. Total rules applied 42 place count 14 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 44 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 46 place count 13 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 50 place count 13 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 50 place count 13 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 54 place count 11 transition count 13
Applied a total of 54 rules in 27 ms. Remains 11 /1086 variables (removed 1075) and now considering 13/2486 (removed 2473) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2652163754900329581.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-553852313760288960.kers'
[2026-05-23 16:00:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2652163754900329581.kers, --Pflows, --basisKERS=/tmp/petrispot-output-553852313760288960.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 8 cols 18 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-23 16:00:22] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-553852313760288960.kers
Total runtime 1 ms.
[2026-05-23 16:00:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 16:00:22] [INFO ] Invariant cache hit.
[2026-05-23 16:00:22] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-23 16:00:22] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-23 16:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 12/23 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 258ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/1086 places, 13/2486 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 345 ms. Remains : 11/1086 places, 13/2486 transitions.
[2026-05-23 16:00:22] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:00:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:00:22] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-23 16:00:23] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:00:23] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:00:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5738367280094709076.gal : 0 ms
[2026-05-23 16:00:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1931742804193397615.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5738367280094709076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1931742804193397615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,40,0.004977,3800,2,22,5,92,5,0,58,57,0


Converting to forward existential form...Done !
original formula: AG(AF(((AG((TrainState_19_3_18==1)) * EF(((TrainState_11_2_10==0)&&(TrainState_3_3_34==1)))) * ((TrainState_3_1_3==0)||(TrainState_4_3_24...163
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(E(TRUE U !((TrainState_19_3_18==1)))) * E(TRUE U ((TrainState_11_2_10==0)&&(TrainSta...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.009899,4344,1,0,8,264,19,0,243,109,14
FORMULA BART-PT-020-CTLCardinality-2024-14 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 : 1086/1086 places, 2486/2486 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1054 transition count 2454
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1054 transition count 2454
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 85 place count 1033 transition count 2433
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 1033 transition count 2433
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 1024 transition count 2424
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 1024 transition count 2424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 132 place count 1016 transition count 2416
Iterating global reduction 0 with 8 rules applied. Total rules applied 140 place count 1016 transition count 2416
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 148 place count 1008 transition count 2408
Iterating global reduction 0 with 8 rules applied. Total rules applied 156 place count 1008 transition count 2408
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 162 place count 1002 transition count 2402
Iterating global reduction 0 with 6 rules applied. Total rules applied 168 place count 1002 transition count 2402
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 998 transition count 2398
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 998 transition count 2398
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 180 place count 994 transition count 2394
Iterating global reduction 0 with 4 rules applied. Total rules applied 184 place count 994 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 993 transition count 2393
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 993 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 992 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 992 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 189 place count 991 transition count 2391
Iterating global reduction 0 with 1 rules applied. Total rules applied 190 place count 991 transition count 2391
Applied a total of 190 rules in 781 ms. Remains 991 /1086 variables (removed 95) and now considering 2391/2486 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13829296974608652290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2463857752067617373.kers'
[2026-05-23 16:00:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13829296974608652290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2463857752067617373.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2391 rows 991 cols 4782 entries
Finished phase 1 with 971 SingleSign rule and 0 generalized
[2026-05-23 16:00:23] [INFO ] Computed 20 invariants in 14 ms
Computed 20 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-2463857752067617373.kers
Total runtime 18 ms.
[2026-05-23 16:00:24] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-23 16:00:24] [INFO ] Invariant cache hit.
[2026-05-23 16:00:25] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2026-05-23 16:00:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1671/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Starting structural reductions in LTL mode, iteration 1 : 991/1086 places, 2391/2486 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63306 ms. Remains : 991/1086 places, 2391/2486 transitions.
[2026-05-23 16:01:26] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:01:26] [INFO ] Flatten gal took : 48 ms
[2026-05-23 16:01:26] [INFO ] Input system was already deterministic with 2391 transitions.
[2026-05-23 16:01:26] [INFO ] Flatten gal took : 43 ms
[2026-05-23 16:01:26] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:01:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2380235517358911463.gal : 14 ms
[2026-05-23 16:01:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18422863245058244521.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2380235517358911463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18422863245058244521.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,7.92314e+33,2.74015,22784,2,2160,5,18642,6,0,6358,10037,0


Converting to forward existential form...Done !
original formula: (AG(((EG(AF((TrainState_12_3_34==0))) * EX(TRUE)) * A((TrainState_13_3_17==0) U ((TrainState_17_2_22==0)||(TrainState_11_1_23==1))))) * (...296
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(EG(!(EG(!((TrainState_12_3_34==0)))))))] = FALSE * [(FwdU(Init,TRUE) * !(EX(TRUE)))] = ...736
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2383/8/8
Hit Full ! (commute/partial/dont) 2385/6/6
(forward)formula 0,0,21.696,204124,1,0,10,1.16862e+06,44,3,29821,54059,16
FORMULA BART-PT-020-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 16:01:48] [INFO ] Flatten gal took : 25 ms
[2026-05-23 16:01:48] [INFO ] Flatten gal took : 26 ms
Total runtime 476821 ms.

BK_STOP 1779552108610

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="BART-PT-020"
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-5973"
echo " Executing tool itstools"
echo " Input is BART-PT-020, 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 r018-smll-177946788000249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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