Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100857.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BART-PT-030, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100857
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 52M
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.0M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 809K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 591K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.7M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 86K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 7.1M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-030-CTLCardinality-2025-00
FORMULA_NAME BART-PT-030-CTLCardinality-2025-01
FORMULA_NAME BART-PT-030-CTLCardinality-2025-02
FORMULA_NAME BART-PT-030-CTLCardinality-2025-03
FORMULA_NAME BART-PT-030-CTLCardinality-2025-04
FORMULA_NAME BART-PT-030-CTLCardinality-2025-05
FORMULA_NAME BART-PT-030-CTLCardinality-2025-06
FORMULA_NAME BART-PT-030-CTLCardinality-2025-07
FORMULA_NAME BART-PT-030-CTLCardinality-2025-08
FORMULA_NAME BART-PT-030-CTLCardinality-2025-09
FORMULA_NAME BART-PT-030-CTLCardinality-2025-10
FORMULA_NAME BART-PT-030-CTLCardinality-2025-11
FORMULA_NAME BART-PT-030-CTLCardinality-2025-12
FORMULA_NAME BART-PT-030-CTLCardinality-2025-13
FORMULA_NAME BART-PT-030-CTLCardinality-2025-14
FORMULA_NAME BART-PT-030-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748674774279

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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 06:59:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:59:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:59:36] [INFO ] Load time of PNML (sax parser for PT used): 530 ms
[2025-05-31 06:59:36] [INFO ] Transformed 4170 places.
[2025-05-31 06:59:36] [INFO ] Transformed 6060 transitions.
[2025-05-31 06:59:36] [INFO ] Found NUPN structural information;
[2025-05-31 06:59:36] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 666 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 111 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 937 places :
Symmetric choice reduction at 0 with 937 rule applications. Total rules 937 place count 3023 transition count 5123
Iterating global reduction 0 with 937 rules applied. Total rules applied 1874 place count 3023 transition count 5123
Discarding 777 places :
Symmetric choice reduction at 0 with 777 rule applications. Total rules 2651 place count 2246 transition count 4346
Iterating global reduction 0 with 777 rules applied. Total rules applied 3428 place count 2246 transition count 4346
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 3543 place count 2131 transition count 4231
Iterating global reduction 0 with 115 rules applied. Total rules applied 3658 place count 2131 transition count 4231
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 3745 place count 2044 transition count 4144
Iterating global reduction 0 with 87 rules applied. Total rules applied 3832 place count 2044 transition count 4144
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 3918 place count 1958 transition count 4058
Iterating global reduction 0 with 86 rules applied. Total rules applied 4004 place count 1958 transition count 4058
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 4089 place count 1873 transition count 3973
Iterating global reduction 0 with 85 rules applied. Total rules applied 4174 place count 1873 transition count 3973
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 4258 place count 1789 transition count 3889
Iterating global reduction 0 with 84 rules applied. Total rules applied 4342 place count 1789 transition count 3889
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 4422 place count 1709 transition count 3809
Iterating global reduction 0 with 80 rules applied. Total rules applied 4502 place count 1709 transition count 3809
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 4556 place count 1655 transition count 3755
Iterating global reduction 0 with 54 rules applied. Total rules applied 4610 place count 1655 transition count 3755
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 4660 place count 1605 transition count 3705
Iterating global reduction 0 with 50 rules applied. Total rules applied 4710 place count 1605 transition count 3705
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 4735 place count 1580 transition count 3680
Iterating global reduction 0 with 25 rules applied. Total rules applied 4760 place count 1580 transition count 3680
Applied a total of 4760 rules in 1929 ms. Remains 1580 /3960 variables (removed 2380) and now considering 3680/6060 (removed 2380) transitions.
// Phase 1: matrix 3680 rows 1580 cols
[2025-05-31 06:59:38] [INFO ] Computed 30 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:59:39] [INFO ] Implicit Places using invariants in 677 ms returned []
[2025-05-31 06:59:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:59:40] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Running 2600 sub problems to find dead transitions.
[2025-05-31 06:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1550/5260 variables, and 0 constraints, problems are : Problem set: 0 solved, 2600 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1580 constraints, PredecessorRefiner: 2600/2600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1550/5260 variables, and 0 constraints, problems are : Problem set: 0 solved, 2600 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1580 constraints, PredecessorRefiner: 0/2600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61215ms problems are : Problem set: 0 solved, 2600 unsolved
Search for dead transitions found 0 dead transitions in 61250ms
Starting structural reductions in LTL mode, iteration 1 : 1580/3960 places, 3680/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64960 ms. Remains : 1580/3960 places, 3680/6060 transitions.
Support contains 53 out of 1580 places after structural reductions.
[2025-05-31 07:00:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-31 07:00:41] [INFO ] Flatten gal took : 175 ms
[2025-05-31 07:00:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-31 07:00:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BART-PT-030-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 07:00:41] [INFO ] Flatten gal took : 99 ms
FORMULA BART-PT-030-CTLCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 07:00:42] [INFO ] Input system was already deterministic with 3680 transitions.
Support contains 36 out of 1580 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1850 ms. (21 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2025-05-31 07:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 277/282 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 632/914 variables, 282/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/914 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/5260 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/30 constraints, State Equation: 282/1580 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 277/282 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 632/914 variables, 282/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/914 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 914/5260 variables, and 289 constraints, problems are : Problem set: 0 solved, 2 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 5/30 constraints, State Equation: 282/1580 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 9 ms.
[2025-05-31 07:00:43] [INFO ] Flatten gal took : 65 ms
[2025-05-31 07:00:43] [INFO ] Flatten gal took : 64 ms
[2025-05-31 07:00:43] [INFO ] Input system was already deterministic with 3680 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1542 transition count 3642
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1542 transition count 3642
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 99 place count 1519 transition count 3619
Iterating global reduction 0 with 23 rules applied. Total rules applied 122 place count 1519 transition count 3619
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 135 place count 1506 transition count 3606
Iterating global reduction 0 with 13 rules applied. Total rules applied 148 place count 1506 transition count 3606
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 159 place count 1495 transition count 3595
Iterating global reduction 0 with 11 rules applied. Total rules applied 170 place count 1495 transition count 3595
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 179 place count 1486 transition count 3586
Iterating global reduction 0 with 9 rules applied. Total rules applied 188 place count 1486 transition count 3586
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 195 place count 1479 transition count 3579
Iterating global reduction 0 with 7 rules applied. Total rules applied 202 place count 1479 transition count 3579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 207 place count 1474 transition count 3574
Iterating global reduction 0 with 5 rules applied. Total rules applied 212 place count 1474 transition count 3574
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 215 place count 1471 transition count 3571
Iterating global reduction 0 with 3 rules applied. Total rules applied 218 place count 1471 transition count 3571
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 1470 transition count 3570
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 1470 transition count 3570
Applied a total of 220 rules in 679 ms. Remains 1470 /1580 variables (removed 110) and now considering 3570/3680 (removed 110) transitions.
// Phase 1: matrix 3570 rows 1470 cols
[2025-05-31 07:00:44] [INFO ] Computed 30 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:44] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-05-31 07:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:45] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2025-05-31 07:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60926ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60933ms
Starting structural reductions in LTL mode, iteration 1 : 1470/1580 places, 3570/3680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62685 ms. Remains : 1470/1580 places, 3570/3680 transitions.
[2025-05-31 07:01:46] [INFO ] Flatten gal took : 57 ms
[2025-05-31 07:01:46] [INFO ] Flatten gal took : 56 ms
[2025-05-31 07:01:46] [INFO ] Input system was already deterministic with 3570 transitions.
[2025-05-31 07:01:46] [INFO ] Flatten gal took : 51 ms
[2025-05-31 07:01:46] [INFO ] Flatten gal took : 69 ms
[2025-05-31 07:01:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1365786941314273463.gal : 36 ms
[2025-05-31 07:01:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5974685084614730303.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1365786941314273463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5974685084614730303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.08022e+50,3.01841,40804,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,5.20036,40804,1,0,6,22988,7,1,12030,12401,1
FORMULA BART-PT-030-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Graph (trivial) has 3646 edges and 1580 vertex of which 1555 / 1580 are part of one of the 30 SCC in 10 ms
Free SCC test removed 1525 places
Ensure Unique test removed 3607 transitions
Reduce isomorphic transitions removed 3607 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 35 transition count 52
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 1 with 6 rules applied. Total rules applied 28 place count 33 transition count 48
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 2 with 4 rules applied. Total rules applied 32 place count 31 transition count 46
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 35 place count 30 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 29 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 46 place count 29 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 46 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 52 place count 26 transition count 31
Applied a total of 52 rules in 39 ms. Remains 26 /1580 variables (removed 1554) and now considering 31/3680 (removed 3649) transitions.
// Phase 1: matrix 31 rows 26 cols
[2025-05-31 07:01:52] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 07:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:52] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:01:52] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-05-31 07:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/56 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 36 constraints, problems are : Problem set: 0 solved, 16 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 52 constraints, problems are : Problem set: 0 solved, 16 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/1580 places, 31/3680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 454 ms. Remains : 26/1580 places, 31/3680 transitions.
[2025-05-31 07:01:52] [INFO ] Flatten gal took : 2 ms
[2025-05-31 07:01:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:01:52] [INFO ] Input system was already deterministic with 31 transitions.
[2025-05-31 07:01:52] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:01:52] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:01:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7765512948040123689.gal : 1 ms
[2025-05-31 07:01:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3969113156307087267.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7765512948040123689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3969113156307087267.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7680,0.003988,3900,2,52,5,221,5,0,136,141,0


Converting to forward existential form...Done !
original formula: A(EG(!(((!(A((TrainState_16_3_36==1) U ((TrainState_28_2_18==0)||(TrainState_20_2_12==1)))) + EF((TrainState_9_1_28==0))) + ((TrainState_...426
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((TrainState_28_3_14==0)||(TrainState_28_2_31==1))))) * !(((((TrainState_9_3_35!=1)||(T...1146
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 26/4/5
Using saturation style SCC detection
(forward)formula 0,0,0.018763,4540,1,0,20,2244,54,11,642,1965,25
FORMULA BART-PT-030-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1550 transition count 3650
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1550 transition count 3650
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 78 place count 1532 transition count 3632
Iterating global reduction 0 with 18 rules applied. Total rules applied 96 place count 1532 transition count 3632
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 106 place count 1522 transition count 3622
Iterating global reduction 0 with 10 rules applied. Total rules applied 116 place count 1522 transition count 3622
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 125 place count 1513 transition count 3613
Iterating global reduction 0 with 9 rules applied. Total rules applied 134 place count 1513 transition count 3613
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 142 place count 1505 transition count 3605
Iterating global reduction 0 with 8 rules applied. Total rules applied 150 place count 1505 transition count 3605
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 1499 transition count 3599
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 1499 transition count 3599
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 166 place count 1495 transition count 3595
Iterating global reduction 0 with 4 rules applied. Total rules applied 170 place count 1495 transition count 3595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 172 place count 1493 transition count 3593
Iterating global reduction 0 with 2 rules applied. Total rules applied 174 place count 1493 transition count 3593
Applied a total of 174 rules in 606 ms. Remains 1493 /1580 variables (removed 87) and now considering 3593/3680 (removed 87) transitions.
// Phase 1: matrix 3593 rows 1493 cols
[2025-05-31 07:01:53] [INFO ] Computed 30 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:53] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-31 07:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:01:54] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 2513 sub problems to find dead transitions.
[2025-05-31 07:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1463/5086 variables, and 0 constraints, problems are : Problem set: 0 solved, 2513 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1493 constraints, PredecessorRefiner: 2513/2513 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2513 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1463/5086 variables, and 0 constraints, problems are : Problem set: 0 solved, 2513 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1493 constraints, PredecessorRefiner: 0/2513 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60974ms problems are : Problem set: 0 solved, 2513 unsolved
Search for dead transitions found 0 dead transitions in 60979ms
Starting structural reductions in LTL mode, iteration 1 : 1493/1580 places, 3593/3680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62727 ms. Remains : 1493/1580 places, 3593/3680 transitions.
[2025-05-31 07:02:55] [INFO ] Flatten gal took : 51 ms
[2025-05-31 07:02:55] [INFO ] Flatten gal took : 51 ms
[2025-05-31 07:02:55] [INFO ] Input system was already deterministic with 3593 transitions.
[2025-05-31 07:02:55] [INFO ] Flatten gal took : 44 ms
[2025-05-31 07:02:55] [INFO ] Flatten gal took : 46 ms
[2025-05-31 07:02:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality5712203686869101399.gal : 13 ms
[2025-05-31 07:02:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1959448885448327618.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5712203686869101399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1959448885448327618.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.94459e+50,3.16859,41348,2,3148,5,26464,6,0,9568,14197,0


Converting to forward existential form...Done !
original formula: ((EF(EX(((TrainState_19_3_8==0)||(TrainState_29_2_28==0)))) * (EG(EX(TRUE)) + EG(((TrainState_7_3_28!=1) + EX((TrainState_3_2_9!=1)))))) ...352
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(((TrainState_19_3_8==0)||(TrainState_29_2_28==0))))))] = FALSE * [((Init * !(EG(((Train...725
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,23.6009,378380,1,0,16,2.30099e+06,39,4,39782,47975,17
FORMULA BART-PT-030-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Graph (trivial) has 3676 edges and 1580 vertex of which 1577 / 1580 are part of one of the 30 SCC in 5 ms
Free SCC test removed 1547 places
Ensure Unique test removed 3645 transitions
Reduce isomorphic transitions removed 3645 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 4 transition count 5
Applied a total of 32 rules in 13 ms. Remains 4 /1580 variables (removed 1576) and now considering 5/3680 (removed 3675) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-05-31 07:03:19] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:03:19] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1580 places, 5/3680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 4/1580 places, 5/3680 transitions.
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:03:19] [INFO ] Input system was already deterministic with 5 transitions.
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4978139691909992306.gal : 0 ms
[2025-05-31 07:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2602480184191976004.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4978139691909992306.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2602480184191976004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.002274,3660,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: A(AG((TrainState_11_2_15==0)) U (TrainState_14_3_29==1))
=> equivalent forward existential formula: [((Init * !(EG(!((TrainState_14_3_29==1))))) * !(E(!((TrainState_14_3_29==1)) U (!(!(E(TRUE U !((TrainState_11_2...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2/0/3
(forward)formula 0,0,0.003781,4172,1,0,8,46,24,4,95,25,12
FORMULA BART-PT-030-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Graph (trivial) has 3668 edges and 1580 vertex of which 1564 / 1580 are part of one of the 30 SCC in 4 ms
Free SCC test removed 1534 places
Ensure Unique test removed 3623 transitions
Reduce isomorphic transitions removed 3623 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 20 transition count 29
Reduce places removed 3 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 7 rules applied. Total rules applied 36 place count 17 transition count 25
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 42 place count 15 transition count 21
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 46 place count 13 transition count 19
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 49 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 50 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 54 place count 11 transition count 13
Applied a total of 54 rules in 14 ms. Remains 11 /1580 variables (removed 1569) and now considering 13/3680 (removed 3667) transitions.
// Phase 1: matrix 13 rows 11 cols
[2025-05-31 07:03:19] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:03:19] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 84 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 153 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 260ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/1580 places, 13/3680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 366 ms. Remains : 11/1580 places, 13/3680 transitions.
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:03:19] [INFO ] Input system was already deterministic with 13 transitions.
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:03:19] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality14129559818525893891.gal : 0 ms
[2025-05-31 07:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14830318047134704655.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14129559818525893891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14830318047134704655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,40,0.018234,3788,2,22,5,85,5,0,58,54,0


Converting to forward existential form...Done !
original formula: !(A(((TrainState_13_4_26==0)||(TrainState_19_2_31==1)) U !((!(AG(EF(((TrainState_5_1_28==0)||(TrainState_10_2_35==1))))) + (TrainState_13...168
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!(!((!(!(E(TRUE U !(E(TRUE U ((TrainState_5_1_28==0)||(TrainState_10_2_35==1))))))) + (Train...677
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.021326,4172,1,0,10,258,25,3,238,143,12
FORMULA BART-PT-030-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1544 transition count 3644
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1544 transition count 3644
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 94 place count 1522 transition count 3622
Iterating global reduction 0 with 22 rules applied. Total rules applied 116 place count 1522 transition count 3622
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 129 place count 1509 transition count 3609
Iterating global reduction 0 with 13 rules applied. Total rules applied 142 place count 1509 transition count 3609
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 153 place count 1498 transition count 3598
Iterating global reduction 0 with 11 rules applied. Total rules applied 164 place count 1498 transition count 3598
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 173 place count 1489 transition count 3589
Iterating global reduction 0 with 9 rules applied. Total rules applied 182 place count 1489 transition count 3589
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 189 place count 1482 transition count 3582
Iterating global reduction 0 with 7 rules applied. Total rules applied 196 place count 1482 transition count 3582
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 201 place count 1477 transition count 3577
Iterating global reduction 0 with 5 rules applied. Total rules applied 206 place count 1477 transition count 3577
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 209 place count 1474 transition count 3574
Iterating global reduction 0 with 3 rules applied. Total rules applied 212 place count 1474 transition count 3574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 213 place count 1473 transition count 3573
Iterating global reduction 0 with 1 rules applied. Total rules applied 214 place count 1473 transition count 3573
Applied a total of 214 rules in 678 ms. Remains 1473 /1580 variables (removed 107) and now considering 3573/3680 (removed 107) transitions.
// Phase 1: matrix 3573 rows 1473 cols
[2025-05-31 07:03:20] [INFO ] Computed 30 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:20] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-31 07:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:21] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 2493 sub problems to find dead transitions.
[2025-05-31 07:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 2493/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 0/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60904ms problems are : Problem set: 0 solved, 2493 unsolved
Search for dead transitions found 0 dead transitions in 60908ms
Starting structural reductions in LTL mode, iteration 1 : 1473/1580 places, 3573/3680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62672 ms. Remains : 1473/1580 places, 3573/3680 transitions.
[2025-05-31 07:04:22] [INFO ] Flatten gal took : 44 ms
[2025-05-31 07:04:22] [INFO ] Flatten gal took : 44 ms
[2025-05-31 07:04:22] [INFO ] Input system was already deterministic with 3573 transitions.
[2025-05-31 07:04:22] [INFO ] Flatten gal took : 39 ms
[2025-05-31 07:04:22] [INFO ] Flatten gal took : 40 ms
[2025-05-31 07:04:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8782250083396269640.gal : 11 ms
[2025-05-31 07:04:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality9646632856012249913.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8782250083396269640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9646632856012249913.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.39548e+50,3.11277,40984,2,2917,5,23119,6,0,9468,12482,0


Converting to forward existential form...Done !
original formula: AX(EG(((TrainState_7_1_5==1)||(TrainState_2_3_26==0))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((TrainState_7_1_5==1)||(TrainState_2_3_26==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,16.3268,353220,1,0,8,2.17881e+06,18,2,36434,37130,7
FORMULA BART-PT-030-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1580/1580 places, 3680/3680 transitions.
Graph (trivial) has 3674 edges and 1580 vertex of which 1577 / 1580 are part of one of the 30 SCC in 8 ms
Free SCC test removed 1547 places
Ensure Unique test removed 3645 transitions
Reduce isomorphic transitions removed 3645 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 4 transition count 5
Applied a total of 32 rules in 16 ms. Remains 4 /1580 variables (removed 1576) and now considering 5/3680 (removed 3675) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-05-31 07:04:39] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-31 07:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:39] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:04:39] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-05-31 07:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1580 places, 5/3680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 147 ms. Remains : 4/1580 places, 5/3680 transitions.
[2025-05-31 07:04:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:04:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:04:39] [INFO ] Input system was already deterministic with 5 transitions.
[2025-05-31 07:04:39] [INFO ] Flatten gal took : 1 ms
[2025-05-31 07:04:39] [INFO ] Flatten gal took : 0 ms
[2025-05-31 07:04:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5312294685179318237.gal : 0 ms
[2025-05-31 07:04:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13160424023162711344.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5312294685179318237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13160424023162711344.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4,0.001758,3660,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: A((TrainState_8_1_34==0) U EF(!(AF((TrainState_9_3_34==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(!(EG(!((TrainState_9_3_34==1)))))))))) * !(E(!(E(TRUE U !(!(EG(!((TrainState_9_3_34=...258
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003351,4172,1,0,6,45,28,1,90,22,8
FORMULA BART-PT-030-CTLCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-31 07:04:39] [INFO ] Flatten gal took : 41 ms
[2025-05-31 07:04:39] [INFO ] Flatten gal took : 42 ms
Total runtime 304097 ms.

BK_STOP 1748675079647

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-030"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BART-PT-030, 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 r002-tall-174853730100857"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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