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-177946788000226.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-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 221K Mar 5 09:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 805K Mar 5 09:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Mar 5 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Mar 5 09:21 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 118K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 322K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 172K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 376K Mar 5 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Mar 5 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 493K Mar 5 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:23 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 534K 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-002-CTLFireability-2024-00
FORMULA_NAME BART-PT-002-CTLFireability-2024-01
FORMULA_NAME BART-PT-002-CTLFireability-2024-02
FORMULA_NAME BART-PT-002-CTLFireability-2024-03
FORMULA_NAME BART-PT-002-CTLFireability-2024-04
FORMULA_NAME BART-PT-002-CTLFireability-2024-05
FORMULA_NAME BART-PT-002-CTLFireability-2024-06
FORMULA_NAME BART-PT-002-CTLFireability-2024-07
FORMULA_NAME BART-PT-002-CTLFireability-2024-08
FORMULA_NAME BART-PT-002-CTLFireability-2024-09
FORMULA_NAME BART-PT-002-CTLFireability-2024-10
FORMULA_NAME BART-PT-002-CTLFireability-2024-11
FORMULA_NAME BART-PT-002-CTLFireability-2024-12
FORMULA_NAME BART-PT-002-CTLFireability-2024-13
FORMULA_NAME BART-PT-002-CTLFireability-2024-14
FORMULA_NAME BART-PT-002-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779548080209

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 14:54:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 14:54:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:54:42] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2026-05-23 14:54:42] [INFO ] Transformed 474 places.
[2026-05-23 14:54:42] [INFO ] Transformed 404 transitions.
[2026-05-23 14:54:42] [INFO ] Found NUPN structural information;
[2026-05-23 14:54:42] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 16 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18112498566947347312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-748660683470383307.kers'
[2026-05-23 14:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18112498566947347312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-748660683470383307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 264 cols 808 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 14:54:42] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-748660683470383307.kers
Total runtime 4 ms.
[2026-05-23 14:54:43] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-23 14:54:43] [INFO ] Invariant cache hit.
[2026-05-23 14:54:43] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 14:54:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30033 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 28449 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58616ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 58640ms
Finished structural reductions in LTL mode , in 1 iterations and 59567 ms. Remains : 264/264 places, 404/404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2026-05-23 14:55:42] [INFO ] Invariant cache hit.
[2026-05-23 14:55:42] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 14:55:42] [INFO ] Invariant cache hit.
[2026-05-23 14:55:42] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2026-05-23 14:55:42] [INFO ] Flatten gal took : 90 ms
[2026-05-23 14:55:43] [INFO ] Flatten gal took : 67 ms
[2026-05-23 14:55:43] [INFO ] Input system was already deterministic with 404 transitions.
Reduction of identical properties reduced properties to check from 40 to 36
RANDOM walk for 40000 steps (8 resets) in 1248 ms. (32 steps per ms) remains 3/36 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2026-05-23 14:55:43] [INFO ] Invariant cache hit.
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 264/668 variables, and 9 constraints, problems are : Problem set: 3 solved, 0 unsolved in 86 ms.
Refiners :[Domain max(s): 7/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-23 14:55:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 14:55:44] [INFO ] Flatten gal took : 41 ms
FORMULA BART-PT-002-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 14:55:44] [INFO ] Flatten gal took : 43 ms
[2026-05-23 14:55:44] [INFO ] Input system was already deterministic with 404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 82 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6982820563482920293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17797820149672270336.kers'
[2026-05-23 14:55:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6982820563482920293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17797820149672270336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 98 cols 476 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-23 14:55:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17797820149672270336.kers
Total runtime 2 ms.
[2026-05-23 14:55:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 14:55:44] [INFO ] Invariant cache hit.
[2026-05-23 14:55:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 14:55:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13605ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 13607ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13835 ms. Remains : 98/264 places, 238/404 transitions.
[2026-05-23 14:55:58] [INFO ] Flatten gal took : 11 ms
[2026-05-23 14:55:58] [INFO ] Flatten gal took : 11 ms
[2026-05-23 14:55:58] [INFO ] Input system was already deterministic with 238 transitions.
[2026-05-23 14:55:58] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:55:58] [INFO ] Flatten gal took : 9 ms
[2026-05-23 14:55:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5726304463092367866.gal : 7 ms
[2026-05-23 14:55:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4898664541281563388.ctl : 7 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/CTLFireability5726304463092367866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4898664541281563388.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,2401,0.063633,4904,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: EX(EF(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((TrainState_1_1_1==1)||(TrainState_2_1_1==1)))] != FALSE
(forward)formula 0,1,0.089621,5204,1,0,8,4592,9,1,1118,2235,4
FORMULA BART-PT-002-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2959102883337090452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14904963448596216481.kers'
[2026-05-23 14:55:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2959102883337090452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14904963448596216481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 264 cols 808 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 14:55:58] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14904963448596216481.kers
Total runtime 3 ms.
[2026-05-23 14:55:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-23 14:55:58] [INFO ] Invariant cache hit.
[2026-05-23 14:55:58] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 14:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30019 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (OVERLAPS) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 28130 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58190ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 58192ms
Finished structural reductions in LTL mode , in 1 iterations and 58573 ms. Remains : 264/264 places, 404/404 transitions.
[2026-05-23 14:56:56] [INFO ] Flatten gal took : 18 ms
[2026-05-23 14:56:56] [INFO ] Flatten gal took : 16 ms
[2026-05-23 14:56:57] [INFO ] Input system was already deterministic with 404 transitions.
[2026-05-23 14:56:57] [INFO ] Flatten gal took : 15 ms
[2026-05-23 14:56:57] [INFO ] Flatten gal took : 15 ms
[2026-05-23 14:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1618021991234538096.gal : 5 ms
[2026-05-23 14:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7173369906451601767.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1618021991234538096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7173369906451601767.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,17424,0.187379,8848,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: (AF((EG((((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0)&&(TrainState_2_2_19==0)))&&(((TrainState_2_2_30=...13916
=> equivalent forward existential formula: ([((FwdU(EY((Init * !(!(EG(!((EG((((((((((TrainState_2_3_30==0)&&(TrainState_2_1_19==0))&&((TrainState_1_2_22==0...28034
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 330/74/74
(forward)formula 0,1,9.27422,208628,1,0,20,1.70495e+06,53,7,7902,586941,16
FORMULA BART-PT-002-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2026-05-23 14:57:06] [INFO ] Invariant cache hit.
[2026-05-23 14:57:06] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 14:57:06] [INFO ] Invariant cache hit.
[2026-05-23 14:57:06] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 264/264 places, 404/404 transitions.
[2026-05-23 14:57:06] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:57:06] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:57:06] [INFO ] Input system was already deterministic with 404 transitions.
[2026-05-23 14:57:06] [INFO ] Flatten gal took : 13 ms
[2026-05-23 14:57:06] [INFO ] Flatten gal took : 13 ms
[2026-05-23 14:57:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12549743001325952344.gal : 4 ms
[2026-05-23 14:57:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15912816533303505106.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/CTLFireability12549743001325952344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15912816533303505106.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,17424,0.187912,8852,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: EX(EX(AG((EX(((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4_12==1)||(TrainState_1_3_7==1)))||(((TrainState_2_2_5==...8619
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !((EX(((((((TrainState_1_2_5==1)||(TrainState_1_4_12==1))||((TrainState_2_4_12==1)||...8676
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.975025,26148,1,0,10,135496,15,2,6702,21047,7
FORMULA BART-PT-002-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 2 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2026-05-23 14:57:07] [INFO ] Invariant cache hit.
[2026-05-23 14:57:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 14:57:07] [INFO ] Invariant cache hit.
[2026-05-23 14:57:08] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 264/264 places, 404/404 transitions.
[2026-05-23 14:57:08] [INFO ] Flatten gal took : 13 ms
[2026-05-23 14:57:08] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:57:08] [INFO ] Input system was already deterministic with 404 transitions.
[2026-05-23 14:57:08] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:57:08] [INFO ] Flatten gal took : 14 ms
[2026-05-23 14:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5866396913737765268.gal : 3 ms
[2026-05-23 14:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16588706744674034999.ctl : 3 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/CTLFireability5866396913737765268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16588706744674034999.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,17424,0.191746,8864,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: (A(((((((((!((!(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))) * AG(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))))) + (TrainState_1_1_...27104
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(EG(E((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(T...34675
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 68/0/336
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 330/74/74
(forward)formula 0,0,9.01102,223924,1,0,44,1.7926e+06,83,21,9012,581226,46
FORMULA BART-PT-002-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 264 transition count 276
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 136 transition count 276
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 256 place count 136 transition count 266
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 288 place count 114 transition count 254
Iterating global reduction 2 with 12 rules applied. Total rules applied 300 place count 114 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 114 transition count 252
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 310 place count 106 transition count 244
Iterating global reduction 3 with 8 rules applied. Total rules applied 318 place count 106 transition count 244
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 324 place count 100 transition count 238
Iterating global reduction 3 with 6 rules applied. Total rules applied 330 place count 100 transition count 238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 336 place count 94 transition count 232
Iterating global reduction 3 with 6 rules applied. Total rules applied 342 place count 94 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 346 place count 90 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 350 place count 90 transition count 228
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 354 place count 86 transition count 224
Iterating global reduction 3 with 4 rules applied. Total rules applied 358 place count 86 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 84 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 place count 84 transition count 222
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 386 place count 72 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 390 place count 72 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 4 with 4 rules applied. Total rules applied 394 place count 70 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 398 place count 70 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 5 with 4 rules applied. Total rules applied 402 place count 68 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 406 place count 68 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 410 place count 66 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 414 place count 66 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 7 with 4 rules applied. Total rules applied 418 place count 64 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 422 place count 64 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 8 with 4 rules applied. Total rules applied 426 place count 62 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 430 place count 62 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 9 with 4 rules applied. Total rules applied 434 place count 60 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 438 place count 60 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 10 with 4 rules applied. Total rules applied 442 place count 58 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 446 place count 58 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 11 with 4 rules applied. Total rules applied 450 place count 56 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 454 place count 56 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 12 with 4 rules applied. Total rules applied 458 place count 54 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 462 place count 54 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 13 with 4 rules applied. Total rules applied 466 place count 52 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 470 place count 52 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 14 with 4 rules applied. Total rules applied 474 place count 50 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 478 place count 50 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 15 with 4 rules applied. Total rules applied 482 place count 48 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 486 place count 48 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 16 with 4 rules applied. Total rules applied 490 place count 46 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 494 place count 46 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 17 with 4 rules applied. Total rules applied 498 place count 44 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 502 place count 44 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 18 with 4 rules applied. Total rules applied 506 place count 42 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 510 place count 42 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 19 with 4 rules applied. Total rules applied 514 place count 40 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 518 place count 40 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 20 with 4 rules applied. Total rules applied 522 place count 38 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 526 place count 38 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 21 with 4 rules applied. Total rules applied 530 place count 36 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 534 place count 36 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 22 with 4 rules applied. Total rules applied 538 place count 34 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 542 place count 34 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 23 with 4 rules applied. Total rules applied 546 place count 32 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 550 place count 32 transition count 86
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 554 place count 30 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 558 place count 30 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 25 with 4 rules applied. Total rules applied 562 place count 28 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 566 place count 28 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 26 with 4 rules applied. Total rules applied 570 place count 26 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 574 place count 26 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 27 with 4 rules applied. Total rules applied 578 place count 24 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 582 place count 24 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 28 with 4 rules applied. Total rules applied 586 place count 22 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 590 place count 22 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 29 with 4 rules applied. Total rules applied 594 place count 20 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 598 place count 20 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 30 with 4 rules applied. Total rules applied 602 place count 18 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 606 place count 18 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 31 with 4 rules applied. Total rules applied 610 place count 16 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 614 place count 16 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 32 with 4 rules applied. Total rules applied 618 place count 14 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 622 place count 14 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 33 with 4 rules applied. Total rules applied 626 place count 12 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 630 place count 12 transition count 26
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 634 place count 10 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 638 place count 10 transition count 20
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 642 place count 8 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 646 place count 8 transition count 14
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 650 place count 6 transition count 12
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 36 with 6 rules applied. Total rules applied 656 place count 6 transition count 6
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 660 place count 4 transition count 4
Applied a total of 660 rules in 132 ms. Remains 4 /264 variables (removed 260) and now considering 4/404 (removed 400) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12700403802421328548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14322348144018374438.kers'
[2026-05-23 14:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12700403802421328548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14322348144018374438.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 14:57:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14322348144018374438.kers
Total runtime 1 ms.
[2026-05-23 14:57:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 14:57:17] [INFO ] Invariant cache hit.
[2026-05-23 14:57:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-23 14:57:17] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 14:57:17] [INFO ] Invariant cache hit.
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/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 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
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/8 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 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 95ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/264 places, 4/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 279 ms. Remains : 4/264 places, 4/404 transitions.
[2026-05-23 14:57:17] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:57:17] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:57:17] [INFO ] Input system was already deterministic with 4 transitions.
[2026-05-23 14:57:17] [INFO ] Flatten gal took : 0 ms
[2026-05-23 14:57:17] [INFO ] Flatten gal took : 1 ms
[2026-05-23 14:57:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3367797502049361360.gal : 0 ms
[2026-05-23 14:57:17] [INFO ] Time to serialize properties into /tmp/CTLFireability14940243750483358898.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/CTLFireability3367797502049361360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14940243750483358898.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,4,0.00233,3736,2,7,5,25,6,0,23,14,0


Converting to forward existential form...Done !
original formula: EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))
=> equivalent forward existential formula: [FwdG(Init,((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/4
(forward)formula 0,1,0.003395,4012,1,0,6,49,19,1,91,34,8
FORMULA BART-PT-002-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 6 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8188154414017555478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-683559578523823525.kers'
[2026-05-23 14:57:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8188154414017555478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-683559578523823525.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 258 cols 796 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-23 14:57:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-683559578523823525.kers
Total runtime 2 ms.
[2026-05-23 14:57:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 14:57:17] [INFO ] Invariant cache hit.
[2026-05-23 14:57:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2026-05-23 14:57:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (OVERLAPS) 0/656 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 656/656 variables, and 260 constraints, problems are : Problem set: 0 solved, 326 unsolved in 28635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 2/258 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (OVERLAPS) 398/656 variables, 258/260 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 326/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 0/656 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Int declared 656/656 variables, and 586 constraints, problems are : Problem set: 0 solved, 326 unsolved in 29662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58334ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 58335ms
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58623 ms. Remains : 258/264 places, 398/404 transitions.
[2026-05-23 14:58:16] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:58:16] [INFO ] Flatten gal took : 11 ms
[2026-05-23 14:58:16] [INFO ] Input system was already deterministic with 398 transitions.
[2026-05-23 14:58:16] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:58:16] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:58:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11377836309955955816.gal : 3 ms
[2026-05-23 14:58:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13346805446302655900.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/CTLFireability11377836309955955816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13346805446302655900.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,16641,0.198114,9092,2,1022,5,22479,6,0,1433,20703,0


Converting to forward existential form...Done !
original formula: AG(EX((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(TrainState_1_1_4==1)))||(((TrainState_1_1_27==1)...3534
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1_36==1)||(Trai...3588
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.0812,24368,1,0,8,121769,10,2,5675,20703,4
FORMULA BART-PT-002-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11474533547579988648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1828240084528214387.kers'
[2026-05-23 14:58:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11474533547579988648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1828240084528214387.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 404 rows 264 cols 808 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 14:58:17] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1828240084528214387.kers
Total runtime 3 ms.
[2026-05-23 14:58:17] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 14:58:17] [INFO ] Invariant cache hit.
[2026-05-23 14:58:17] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-23 14:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 530 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30021 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 262/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/262 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 2/264 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 404/668 variables, 264/530 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 332/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 862 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30026 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in LTL mode , in 1 iterations and 60444 ms. Remains : 264/264 places, 404/404 transitions.
[2026-05-23 14:59:17] [INFO ] Flatten gal took : 11 ms
[2026-05-23 14:59:17] [INFO ] Flatten gal took : 12 ms
[2026-05-23 14:59:18] [INFO ] Input system was already deterministic with 404 transitions.
[2026-05-23 14:59:18] [INFO ] Flatten gal took : 9 ms
[2026-05-23 14:59:18] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3193175412436878979.gal : 2 ms
[2026-05-23 14:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8517640839380460952.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/CTLFireability3193175412436878979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8517640839380460952.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,17424,0.183974,8860,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: AG(A(AF((EX(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))) * A((((((((((TrainState_1_1_17==1)||(TrainState_1_4_17==1))||((TrainState_1_1...12739
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(!(!(E(TRUE U !(!((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainStat...31186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.05048,26200,1,0,6,113089,20,0,6651,20428,7
FORMULA BART-PT-002-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 180 place count 147 transition count 287
Iterating global reduction 0 with 54 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 242 place count 139 transition count 279
Iterating global reduction 0 with 8 rules applied. Total rules applied 250 place count 139 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 256 place count 133 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 262 place count 133 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 268 place count 127 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 280 place count 121 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 292 place count 115 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 304 place count 109 transition count 249
Iterating global reduction 0 with 6 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 314 place count 105 transition count 245
Iterating global reduction 0 with 4 rules applied. Total rules applied 318 place count 105 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 322 place count 101 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 326 place count 101 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 328 place count 99 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 330 place count 99 transition count 239
Applied a total of 330 rules in 27 ms. Remains 99 /264 variables (removed 165) and now considering 239/404 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5367443459016951882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10427319077658588493.kers'
[2026-05-23 14:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5367443459016951882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10427319077658588493.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 99 cols 478 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-23 14:59:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10427319077658588493.kers
Total runtime 1 ms.
[2026-05-23 14:59:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 14:59:19] [INFO ] Invariant cache hit.
[2026-05-23 14:59:19] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-23 14:59:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 101 constraints, problems are : Problem set: 0 solved, 167 unsolved in 6942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 167/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 268 constraints, problems are : Problem set: 0 solved, 167 unsolved in 8022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14981ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 14982ms
Starting structural reductions in LTL mode, iteration 1 : 99/264 places, 239/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15168 ms. Remains : 99/264 places, 239/404 transitions.
[2026-05-23 14:59:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:59:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:34] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-23 14:59:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:59:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7603634825290184873.gal : 7 ms
[2026-05-23 14:59:34] [INFO ] Time to serialize properties into /tmp/CTLFireability18237275642965698004.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/CTLFireability7603634825290184873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18237275642965698004.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,2450,0.051479,5004,2,388,5,4148,6,0,638,2071,0


Converting to forward existential form...Done !
original formula: AF(AX(E(!(AG((TrainState_2_2_11==1))) U (TrainState_1_1_33==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(!(!(E(TRUE U !((TrainState_2_2_11==1))))) U (TrainState_1_1_33==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.164532,7744,1,0,7,19377,22,0,2650,4878,10
FORMULA BART-PT-002-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 29 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16160806327101405522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12231314395848436299.kers'
[2026-05-23 14:59:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16160806327101405522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12231314395848436299.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 98 cols 476 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-23 14:59:34] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12231314395848436299.kers
Total runtime 2 ms.
[2026-05-23 14:59:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 14:59:34] [INFO ] Invariant cache hit.
[2026-05-23 14:59:34] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 14:59:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 8467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18858ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18862ms
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19079 ms. Remains : 98/264 places, 238/404 transitions.
[2026-05-23 14:59:53] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:53] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:53] [INFO ] Input system was already deterministic with 238 transitions.
[2026-05-23 14:59:53] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:53] [INFO ] Flatten gal took : 7 ms
[2026-05-23 14:59:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12811383424643313158.gal : 2 ms
[2026-05-23 14:59:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9399556392811729.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/CTLFireability12811383424643313158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9399556392811729.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 -...281
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,2401,0.131011,5000,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: EG(EX(EF((TrainState_1_0_0==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(E(TRUE U (TrainState_1_0_0==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.382627,7900,1,0,6,19162,18,1,2817,5258,10
FORMULA BART-PT-002-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 323 place count 101 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 326 place count 101 transition count 241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 328 place count 99 transition count 239
Iterating global reduction 0 with 2 rules applied. Total rules applied 330 place count 99 transition count 239
Applied a total of 330 rules in 41 ms. Remains 99 /264 variables (removed 165) and now considering 239/404 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16806812489885506402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-668384217250073716.kers'
[2026-05-23 14:59:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16806812489885506402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-668384217250073716.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 239 rows 99 cols 478 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-23 14:59:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-668384217250073716.kers
Total runtime 2 ms.
[2026-05-23 14:59:54] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-23 14:59:54] [INFO ] Invariant cache hit.
[2026-05-23 14:59:54] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-23 14:59:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 101 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 2/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 239/338 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 167/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 268 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10614 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20202ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 20202ms
Starting structural reductions in LTL mode, iteration 1 : 99/264 places, 239/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20507 ms. Remains : 99/264 places, 239/404 transitions.
[2026-05-23 15:00:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:00:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:00:14] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-23 15:00:14] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:00:14] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:00:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8814341783351613695.gal : 2 ms
[2026-05-23 15:00:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8144137142633259470.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/CTLFireability8814341783351613695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8144137142633259470.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,2450,0.128378,5004,2,388,5,4128,6,0,638,1962,0


Converting to forward existential form...Done !
original formula: (AF(((AX(AX((TrainState_2_0_0==0))) + (TrainState_2_1_15==1)) + AX((TrainState_2_1_15==1)))) + AX((AG(EF((TrainState_1_1_20==1))) * EG((A...214
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(!(EG(!(((!(EX(!(!(EX(!((TrainState_2_0_0==0))))))) + (TrainState_2_1_15==1)) + !(EX(!((Trai...456
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.463202,11120,1,0,19,48824,26,6,2653,16451,17
FORMULA BART-PT-002-CTLFireability-2024-10 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 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 178 place count 149 transition count 289
Iterating global reduction 0 with 52 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 238 place count 141 transition count 281
Iterating global reduction 0 with 8 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 252 place count 135 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 264 place count 129 transition count 269
Iterating global reduction 0 with 6 rules applied. Total rules applied 270 place count 129 transition count 269
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 276 place count 123 transition count 263
Iterating global reduction 0 with 6 rules applied. Total rules applied 282 place count 123 transition count 263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 287 place count 118 transition count 258
Iterating global reduction 0 with 5 rules applied. Total rules applied 292 place count 118 transition count 258
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 297 place count 113 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 306 place count 109 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 313 place count 106 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 316 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 317 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 318 place count 105 transition count 245
Applied a total of 318 rules in 21 ms. Remains 105 /264 variables (removed 159) and now considering 245/404 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14103202643272489473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-888206288837243382.kers'
[2026-05-23 15:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14103202643272489473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-888206288837243382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 105 cols 490 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-23 15:00:15] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-888206288837243382.kers
Total runtime 2 ms.
[2026-05-23 15:00:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 15:00:15] [INFO ] Invariant cache hit.
[2026-05-23 15:00:15] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2026-05-23 15:00:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 245/350 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 0/350 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 107 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 245/350 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 173/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/350 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 280 constraints, problems are : Problem set: 0 solved, 173 unsolved in 11273 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21008ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 21008ms
Starting structural reductions in LTL mode, iteration 1 : 105/264 places, 245/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21320 ms. Remains : 105/264 places, 245/404 transitions.
[2026-05-23 15:00:36] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:00:36] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:00:36] [INFO ] Input system was already deterministic with 245 transitions.
[2026-05-23 15:00:36] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:00:36] [INFO ] Flatten gal took : 9 ms
[2026-05-23 15:00:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1716877258947264525.gal : 2 ms
[2026-05-23 15:00:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11844753163399118847.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/CTLFireability1716877258947264525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11844753163399118847.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,2744,0.10423,5068,2,410,5,4684,6,0,668,2387,0


Converting to forward existential form...Done !
original formula: EG((E(!(AX(AX((TrainState_1_3_36==1)))) U AX(FALSE)) + AG((TrainState_1_4_26==0))))
=> equivalent forward existential formula: [FwdG(Init,(E(!(!(EX(!(!(EX(!((TrainState_1_3_36==1)))))))) U !(EX(!(FALSE)))) + !(E(TRUE U !((TrainState_1_4_26...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.242843,8240,1,0,7,22103,23,0,2783,5582,9
FORMULA BART-PT-002-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 402 edges and 264 vertex of which 262 / 264 are part of one of the 2 SCC in 6 ms
Free SCC test removed 260 places
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 399 transitions.
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 2 transition count 3
Applied a total of 4 rules in 21 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8063325276461770091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16043721855024604756.kers'
[2026-05-23 15:00:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8063325276461770091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16043721855024604756.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:00:36] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16043721855024604756.kers
Total runtime 0 ms.
[2026-05-23 15:00:36] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 15:00:36] [INFO ] Invariant cache hit.
[2026-05-23 15:00:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2026-05-23 15:00:37] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:00:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 389 ms. Remains : 2/264 places, 3/404 transitions.
[2026-05-23 15:00:37] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:37] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:37] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:00:37] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:00:37] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1731664698013391913.gal : 1 ms
[2026-05-23 15:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3236183681615443252.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/CTLFireability1731664698013391913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3236183681615443252.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,2,0.031348,3728,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: AF(EG(AG((TrainState_2_2_23==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !((TrainState_2_2_23==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.032478,4012,1,0,6,19,22,1,48,11,10
FORMULA BART-PT-002-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 176 place count 150 transition count 290
Iterating global reduction 0 with 52 rules applied. Total rules applied 228 place count 150 transition count 290
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 236 place count 142 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 250 place count 136 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 262 place count 130 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 274 place count 124 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 280 place count 124 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 284 place count 120 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 292 place count 116 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 310 place count 108 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 312 place count 108 transition count 248
Applied a total of 312 rules in 35 ms. Remains 108 /264 variables (removed 156) and now considering 248/404 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3546749196705472776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3329757024080893620.kers'
[2026-05-23 15:00:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3546749196705472776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3329757024080893620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 108 cols 496 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 15:00:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3329757024080893620.kers
Total runtime 1 ms.
[2026-05-23 15:00:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 15:00:37] [INFO ] Invariant cache hit.
[2026-05-23 15:00:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-23 15:00:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 248/356 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 110 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12510 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 2/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 248/356 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 176/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 286 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19969ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19969ms
Starting structural reductions in LTL mode, iteration 1 : 108/264 places, 248/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20250 ms. Remains : 108/264 places, 248/404 transitions.
[2026-05-23 15:00:57] [INFO ] Flatten gal took : 10 ms
[2026-05-23 15:00:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:00:57] [INFO ] Input system was already deterministic with 248 transitions.
[2026-05-23 15:00:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:00:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:00:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14259929419733741383.gal : 2 ms
[2026-05-23 15:00:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3160506698774246967.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/CTLFireability14259929419733741383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3160506698774246967.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,2891,0.056499,5204,2,424,5,5063,6,0,683,2865,0


Converting to forward existential form...Done !
original formula: E(E(E(AG(((TrainState_1_1_12==1)||(TrainState_1_4_27==1))) U (TrainState_1_1_1==1)) U AF(AX(((TrainState_1_1_27==1)||(TrainState_1_1_16==...248
=> equivalent forward existential formula: [(FwdU(Init,E(E(!(E(TRUE U !(((TrainState_1_1_12==1)||(TrainState_1_4_27==1))))) U (TrainState_1_1_1==1)) U !(EG...336
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 211/0/37
Using saturation style SCC detection
(forward)formula 0,0,0.362133,12396,1,0,16,53120,45,4,3245,20496,25
FORMULA BART-PT-002-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 402 edges and 264 vertex of which 263 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 261 places
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 4 ms. Remains 2 /264 variables (removed 262) and now considering 3/404 (removed 401) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13911608719879453943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-426500773353833596.kers'
[2026-05-23 15:00:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13911608719879453943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-426500773353833596.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:00:57] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-426500773353833596.kers
Total runtime 3 ms.
[2026-05-23 15:00:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 15:00:57] [INFO ] Invariant cache hit.
[2026-05-23 15:00:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-23 15:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/264 places, 3/404 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 141 ms. Remains : 2/264 places, 3/404 transitions.
[2026-05-23 15:00:58] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:58] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:58] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:00:58] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:58] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:00:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12513619300536759855.gal : 0 ms
[2026-05-23 15:00:58] [INFO ] Time to serialize properties into /tmp/CTLFireability17278243997642826092.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/CTLFireability12513619300536759855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17278243997642826092.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,2,0.002409,3724,2,4,5,12,5,0,12,6,0


Converting to forward existential form...Done !
original formula: EG((TrainState_2_2_9==0))
=> equivalent forward existential formula: [FwdG(Init,(TrainState_2_2_9==0))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.003118,3992,1,0,5,18,18,0,49,11,8
FORMULA BART-PT-002-CTLFireability-2024-14 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 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 178 place count 149 transition count 289
Iterating global reduction 0 with 52 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 238 place count 141 transition count 281
Iterating global reduction 0 with 8 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 252 place count 135 transition count 275
Iterating global reduction 0 with 6 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 273 place count 125 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 283 place count 120 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 293 place count 115 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 298 place count 115 transition count 255
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 301 place count 112 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 304 place count 112 transition count 252
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 307 place count 109 transition count 249
Iterating global reduction 0 with 3 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 107 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 107 transition count 247
Applied a total of 314 rules in 17 ms. Remains 107 /264 variables (removed 157) and now considering 247/404 (removed 157) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14768791793087426553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2991797832545995258.kers'
[2026-05-23 15:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14768791793087426553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2991797832545995258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 107 cols 494 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-23 15:00:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2991797832545995258.kers
Total runtime 2 ms.
[2026-05-23 15:00:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 15:00:58] [INFO ] Invariant cache hit.
[2026-05-23 15:00:58] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-23 15:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 2/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 247/354 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 109 constraints, problems are : Problem set: 0 solved, 175 unsolved in 12008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 2/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 247/354 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 175/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/354 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 284 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22205ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 22206ms
Starting structural reductions in LTL mode, iteration 1 : 107/264 places, 247/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22386 ms. Remains : 107/264 places, 247/404 transitions.
[2026-05-23 15:01:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:01:20] [INFO ] Flatten gal took : 12 ms
[2026-05-23 15:01:20] [INFO ] Input system was already deterministic with 247 transitions.
[2026-05-23 15:01:20] [INFO ] Flatten gal took : 19 ms
[2026-05-23 15:01:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 15:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14852697990104006762.gal : 2 ms
[2026-05-23 15:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8313464761500351531.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/CTLFireability14852697990104006762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8313464761500351531.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,2850,0.091523,5056,2,420,5,4556,6,0,678,2340,0


Converting to forward existential form...Done !
original formula: A(A(E(AX(AX((TrainState_1_0_0==1))) U (TrainState_2_1_11!=1)) U (EX((TrainState_1_4_13==1)) + (TrainState_1_0_0==1))) U AG(A(AF((TrainSta...225
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((E(!(!((E(!((TrainState_1_1_37==1)) U (!((TrainState_1_4_13==1)) * !((TrainState...1717
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 243/0/4
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,0.858348,22340,1,0,58,139321,50,40,3087,52837,64
FORMULA BART-PT-002-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-23 15:01:21] [INFO ] Flatten gal took : 5 ms
[2026-05-23 15:01:21] [INFO ] Flatten gal took : 9 ms
Total runtime 399499 ms.

BK_STOP 1779548481458

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-002"
export BK_EXAMINATION="CTLFireability"
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-002, examination is CTLFireability"
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-177946788000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;