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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.4K Mar 5 09:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 09:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 09:23 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 4.3K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 09:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 5 09:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 5 09:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 09:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 189K 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-COL-010-CTLFireability-2024-00
FORMULA_NAME BART-COL-010-CTLFireability-2024-01
FORMULA_NAME BART-COL-010-CTLFireability-2024-02
FORMULA_NAME BART-COL-010-CTLFireability-2024-03
FORMULA_NAME BART-COL-010-CTLFireability-2024-04
FORMULA_NAME BART-COL-010-CTLFireability-2024-05
FORMULA_NAME BART-COL-010-CTLFireability-2024-06
FORMULA_NAME BART-COL-010-CTLFireability-2024-07
FORMULA_NAME BART-COL-010-CTLFireability-2024-08
FORMULA_NAME BART-COL-010-CTLFireability-2024-09
FORMULA_NAME BART-COL-010-CTLFireability-2024-10
FORMULA_NAME BART-COL-010-CTLFireability-2024-11
FORMULA_NAME BART-COL-010-CTLFireability-2024-12
FORMULA_NAME BART-COL-010-CTLFireability-2024-13
FORMULA_NAME BART-COL-010-CTLFireability-2024-14
FORMULA_NAME BART-COL-010-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779535462204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202604301425
[2026-05-23 11:24:23] [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 11:24:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:24:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 11:24:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 11:24:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1019 ms
[2026-05-23 11:24:25] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2026-05-23 11:24:25] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 12833 PT places and 1.407229512E10 transition bindings in 98 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
[2026-05-23 11:24:25] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 9 ms.
[2026-05-23 11:24:25] [INFO ] Skeletonized 0 HLPN properties in 2 ms. Removed 16 properties that had guard overlaps.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 10
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2026-05-23 11:24:25] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 571 ms.
[2026-05-23 11:24:25] [INFO ] Unfolded 16 HLPN properties in 13 ms.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:24:25] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 4 ms
Reduce places removed 10487 places and 121 transitions.
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-1062944710543353984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8783663632287115777.kers'
[2026-05-23 11:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1062944710543353984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8783663632287115777.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:24:26] [INFO ] Computed 1 invariants in 2 ms
Computed 1 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8783663632287115777.kers
Total runtime 11 ms.
[2026-05-23 11:24:26] [INFO ] Implicit Places using invariants in 507 ms returned []
[2026-05-23 11:24:26] [INFO ] Invariant cache hit.
[2026-05-23 11:24:26] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 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/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17840ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 17858ms
Finished structural reductions in LTL mode , in 1 iterations and 18749 ms. Remains : 132/132 places, 202/202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:24:44] [INFO ] Invariant cache hit.
[2026-05-23 11:24:44] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 11:24:44] [INFO ] Invariant cache hit.
[2026-05-23 11:24:44] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2026-05-23 11:24:45] [INFO ] Flatten gal took : 66 ms
[2026-05-23 11:24:45] [INFO ] Flatten gal took : 40 ms
[2026-05-23 11:24:45] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 24 to 18
RANDOM walk for 40020 steps (8 resets) in 593 ms. (67 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 762 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 991 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
[2026-05-23 11:24:46] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 131/334 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-23 11:24:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 11:24:46] [INFO ] Flatten gal took : 24 ms
FORMULA BART-COL-010-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 11:24:46] [INFO ] Flatten gal took : 20 ms
[2026-05-23 11:24:46] [INFO ] Input system was already deterministic with 202 transitions.
FORMULA BART-COL-010-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 25 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11736990382809709157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2216751275216057190.kers'
[2026-05-23 11:24:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11736990382809709157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2216751275216057190.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 109 cols 358 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-23 11:24:46] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2216751275216057190.kers
Total runtime 1 ms.
[2026-05-23 11:24:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 11:24:46] [INFO ] Invariant cache hit.
[2026-05-23 11:24:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-23 11:24:47] [INFO ] Redundant transitions in 6 ms returned []
Running 143 sub problems to find dead transitions.
[2026-05-23 11:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8478 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 7559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16055ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 16057ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16247 ms. Remains : 109/132 places, 179/202 transitions.
[2026-05-23 11:25:03] [INFO ] Flatten gal took : 15 ms
[2026-05-23 11:25:03] [INFO ] Flatten gal took : 14 ms
[2026-05-23 11:25:03] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 11:25:03] [INFO ] Flatten gal took : 14 ms
[2026-05-23 11:25:03] [INFO ] Flatten gal took : 13 ms
[2026-05-23 11:25:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4251187678232618657.gal : 8 ms
[2026-05-23 11:25:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7311178873646504153.ctl : 10 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/CTLFireability4251187678232618657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7311178873646504153.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,9.7455e+13,0.359728,11996,2,1190,5,50698,6,0,618,41102,0


Converting to forward existential form...Done !
original formula: AF(!(A(((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(TrainState_195...3593
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((!(EG(!((TrainState_42>=1)))) * !((E(!((TrainState_42>=1)) U (!((TrainState_0>=1)) * !((T...7970
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 177/0/2
Detected timeout of ITS tools.
[2026-05-23 11:25:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 11:25:33] [INFO ] Applying decomposition
[2026-05-23 11:25:33] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18372294305714281814.txt' '-o' '/tmp/graph18372294305714281814.bin' '-w' '/tmp/graph18372294305714281814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18372294305714281814.bin' '-l' '-1' '-v' '-w' '/tmp/graph18372294305714281814.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:25:33] [INFO ] Decomposing Gal with order
[2026-05-23 11:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:25:33] [INFO ] Removed a total of 52 redundant transitions.
[2026-05-23 11:25:33] [INFO ] Flatten gal took : 71 ms
[2026-05-23 11:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 13 ms.
[2026-05-23 11:25:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11460193951135984712.gal : 13 ms
[2026-05-23 11:25:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2909806338868859644.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11460193951135984712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2909806338868859644.ctl'

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 -...263
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,9.7455e+13,11.9351,203228,420,144,294604,52951,406,1.05273e+06,91,292436,0


Converting to forward existential form...Done !
original formula: AF(!(A(((((((((i5.i0.u16.TrainState_61>=1)||(i6.i2.u40.TrainState_191>=1))||((i5.i1.u3.TrainState_63>=1)||(i4.i1.u36.TrainState_189>=1)))...5022
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((!(EG(!((i1.i0.u0.TrainState_42>=1)))) * !((E(!((i1.i0.u0.TrainState_42>=1)) U (!((i0.u1....11091
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 22 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15917195540941697250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8488702145421823123.kers'
[2026-05-23 11:26:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15917195540941697250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8488702145421823123.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 100 cols 340 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-23 11:26:03] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8488702145421823123.kers
Total runtime 1 ms.
[2026-05-23 11:26:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 11:26:03] [INFO ] Invariant cache hit.
[2026-05-23 11:26:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-23 11:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10399ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 10401ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10577 ms. Remains : 100/132 places, 170/202 transitions.
[2026-05-23 11:26:14] [INFO ] Flatten gal took : 8 ms
[2026-05-23 11:26:14] [INFO ] Flatten gal took : 8 ms
[2026-05-23 11:26:14] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-23 11:26:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:26:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:26:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12579066023266253444.gal : 2 ms
[2026-05-23 11:26:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15633478949858346702.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12579066023266253444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15633478949858346702.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,4.26342e+13,0.212483,9436,2,1091,5,37510,6,0,573,24746,0


Converting to forward existential form...Done !
original formula: AG(((TrainState_0>=1) + (((((((!(E(EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_118>=1)))||(((Trai...3976
=> equivalent forward existential formula: ((((((([(FwdU(FwdU((FwdU(Init,TRUE) * !((TrainState_0>=1))),EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||(...4435
(forward)formula 0,0,0.228701,9656,1,0,11,37510,11,4,662,24746,2
FORMULA BART-COL-010-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 26 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 127 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 119 transition count 189
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 2 with 24 rules applied. Total rules applied 41 place count 107 transition count 177
Applied a total of 41 rules in 46 ms. Remains 107 /132 variables (removed 25) and now considering 177/202 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7809385346224534692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8846091147569362145.kers'
[2026-05-23 11:26:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7809385346224534692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8846091147569362145.kers]
Normalized transition count is 176 out of 177 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 107 cols 352 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-23 11:26:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8846091147569362145.kers
Total runtime 1 ms.
[2026-05-23 11:26:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 11:26:14] [INFO ] Invariant cache hit.
[2026-05-23 11:26:14] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-23 11:26:14] [INFO ] Redundant transitions in 11 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-23 11:26:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/284 variables, and 108 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 141/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/284 variables, and 249 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11890ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 11891ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/132 places, 177/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12100 ms. Remains : 107/132 places, 177/202 transitions.
[2026-05-23 11:26:26] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:26:26] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:26:26] [INFO ] Input system was already deterministic with 177 transitions.
[2026-05-23 11:26:26] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:26:26] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:26:26] [INFO ] Time to serialize gal into /tmp/CTLFireability853787814726575848.gal : 1 ms
[2026-05-23 11:26:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15400688975082529830.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/CTLFireability853787814726575848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15400688975082529830.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,8.15725e+13,0.475231,11500,2,1168,5,48948,6,0,607,28400,0


Converting to forward existential form...Done !
original formula: !(A(!(((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainState_177...4627
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainS...13147
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 153/0/24
(forward)formula 0,1,11.6549,210952,1,0,23,1.20372e+06,34,8,4295,902313,25
FORMULA BART-COL-010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-7846715208488522857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10897900281515058906.kers'
[2026-05-23 11:26:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7846715208488522857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10897900281515058906.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:26:38] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10897900281515058906.kers
Total runtime 1 ms.
[2026-05-23 11:26:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 11:26:38] [INFO ] Invariant cache hit.
[2026-05-23 11:26:38] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:26:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 8739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 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/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18051ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18052ms
Finished structural reductions in LTL mode , in 1 iterations and 18287 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:26:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:26:56] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:26:56] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:26:56] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:26:56] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:26:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5220342608637906454.gal : 1 ms
[2026-05-23 11:26:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7990438402414727204.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/CTLFireability5220342608637906454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7990438402414727204.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.359762,13212,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: AG(AF((EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_118>=1)))||(((TrainState_57>=1)||(TrainState_1...3551
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_118...3603
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,14.4308,327252,1,0,13,1.59885e+06,17,5,4274,1.94254e+06,11
FORMULA BART-COL-010-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:27:11] [INFO ] Invariant cache hit.
[2026-05-23 11:27:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 11:27:11] [INFO ] Invariant cache hit.
[2026-05-23 11:27:11] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:27:11] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:27:11] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:11] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:27:11] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:11] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11675026997049550602.gal : 2 ms
[2026-05-23 11:27:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17011088096276532926.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11675026997049550602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17011088096276532926.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.388134,13208,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: E(AX((AX((((TrainState_42>=1)&&((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState...3597
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(EX(!((((TrainState_42>=1)&&((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_6...3655
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.46758,52152,1,0,18,271432,17,8,4149,207201,12
FORMULA BART-COL-010-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:27:14] [INFO ] Invariant cache hit.
[2026-05-23 11:27:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-23 11:27:14] [INFO ] Invariant cache hit.
[2026-05-23 11:27:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-05-23 11:27:14] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 162 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:27:14] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:27:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:14] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:27:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:14] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:27:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17438379842653012940.gal : 2 ms
[2026-05-23 11:27:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14586773094062392653.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/CTLFireability17438379842653012940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14586773094062392653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.354787,13216,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: A(EF((TrainState_0>=1)) U AF((!((((!((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_118>=1)))||(((TrainS...5789
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!((((!((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_...17414
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 165/0/37
Using saturation style SCC detection
(forward)formula 0,0,20.8002,383316,1,0,12,2.0652e+06,31,4,5224,2.09146e+06,15
FORMULA BART-COL-010-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:27:35] [INFO ] Invariant cache hit.
[2026-05-23 11:27:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 11:27:35] [INFO ] Invariant cache hit.
[2026-05-23 11:27:35] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:27:35] [INFO ] Flatten gal took : 5 ms
[2026-05-23 11:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:27:35] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:27:35] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:27:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8632660168520378259.gal : 2 ms
[2026-05-23 11:27:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11704443878273435815.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8632660168520378259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11704443878273435815.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,6.1745e+14,0.377534,13204,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: (AF((EG((AG(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_118<1)))&&(((TrainState_57<1)&&(TrainState_110<...7174
=> equivalent forward existential formula: ([FwdG(Init,!((EG((!(E(TRUE U !(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_11...7289
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 34/11194/168
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-23 11:28:05] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:28:05] [INFO ] Applying decomposition
[2026-05-23 11:28:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2758558767580620778.txt' '-o' '/tmp/graph2758558767580620778.bin' '-w' '/tmp/graph2758558767580620778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2758558767580620778.bin' '-l' '-1' '-v' '-w' '/tmp/graph2758558767580620778.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:28:05] [INFO ] Decomposing Gal with order
[2026-05-23 11:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:28:05] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-23 11:28:05] [INFO ] Flatten gal took : 18 ms
[2026-05-23 11:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 8 ms.
[2026-05-23 11:28:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4526230042841429271.gal : 4 ms
[2026-05-23 11:28:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5862207521587217604.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/CTLFireability4526230042841429271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5862207521587217604.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,7.60733,139964,409,210,206620,18986,418,742441,125,92140,0


Converting to forward existential form...Done !
original formula: (AF((EG((AG(((((((((u2.TrainState_61<1)&&(i3.i0.u34.TrainState_65<1))&&((u2.TrainState_53<1)&&(i2.i1.u25.TrainState_118<1)))&&(((u2.Train...9808
=> equivalent forward existential formula: ([FwdG(Init,!((EG((!(E(TRUE U !(((((((((u2.TrainState_61<1)&&(i3.i0.u34.TrainState_65<1))&&((u2.TrainState_53<1)...9923
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 16 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2021628708033976523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11216042039042083469.kers'
[2026-05-23 11:28:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2021628708033976523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11216042039042083469.kers]
Normalized transition count is 27 out of 28 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 19 cols 54 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-23 11:28:35] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11216042039042083469.kers
Total runtime 0 ms.
[2026-05-23 11:28:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 11:28:35] [INFO ] Invariant cache hit.
[2026-05-23 11:28:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-23 11:28:35] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-23 11:28:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 723ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 822 ms. Remains : 19/132 places, 28/202 transitions.
[2026-05-23 11:28:36] [INFO ] Flatten gal took : 3 ms
[2026-05-23 11:28:36] [INFO ] Flatten gal took : 1 ms
[2026-05-23 11:28:36] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-23 11:28:36] [INFO ] Flatten gal took : 1 ms
[2026-05-23 11:28:36] [INFO ] Flatten gal took : 1 ms
[2026-05-23 11:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2681165486772477871.gal : 0 ms
[2026-05-23 11:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability9394533204472318333.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/CTLFireability2681165486772477871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9394533204472318333.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,1.31231e+07,0.038265,4512,2,200,5,4238,6,0,106,3544,0


Converting to forward existential form...Done !
original formula: AF(AG((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainState_177>...227
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=...284
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.157842,6084,1,0,6,12934,19,1,663,10974,10
FORMULA BART-COL-010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 9 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13800760106013388853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5730253276899581067.kers'
[2026-05-23 11:28:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13800760106013388853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5730253276899581067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 129 cols 398 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 11:28:36] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5730253276899581067.kers
Total runtime 2 ms.
[2026-05-23 11:28:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 11:28:36] [INFO ] Invariant cache hit.
[2026-05-23 11:28:36] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-05-23 11:28:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25092ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 25093ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25336 ms. Remains : 129/132 places, 199/202 transitions.
[2026-05-23 11:29:01] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:01] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:01] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-23 11:29:02] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:02] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12668008623511237739.gal : 2 ms
[2026-05-23 11:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18181369790536275660.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/CTLFireability12668008623511237739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18181369790536275660.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,4.94361e+14,0.611925,13684,2,1410,5,62263,6,0,718,42252,0


Converting to forward existential form...Done !
original formula: A(EG((EX(((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(TrainState_1...3097
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG((TrainState_42>=1))))))) * !(E(!(E(TRUE U EG((TrainState_42>=1)))) U (!(EG((EX(((((...3244
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.04032,61888,1,0,6,309436,28,1,4278,225523,8
FORMULA BART-COL-010-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-1014856578161215817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3471699369986317924.kers'
[2026-05-23 11:29:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1014856578161215817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3471699369986317924.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:29:05] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3471699369986317924.kers
Total runtime 1 ms.
[2026-05-23 11:29:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 11:29:05] [INFO ] Invariant cache hit.
[2026-05-23 11:29:05] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:29:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 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/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11927 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24790ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 24790ms
Finished structural reductions in LTL mode , in 1 iterations and 24952 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:29:30] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:30] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:30] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:29:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 11:29:30] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:29:30] [INFO ] Time to serialize gal into /tmp/CTLFireability334884070645782181.gal : 2 ms
[2026-05-23 11:29:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1969589337821584110.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability334884070645782181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1969589337821584110.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.589252,13200,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: EX((EF(((((AX(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_118<1)))&&(((TrainState_57<1)&&(TrainState_11...3708
=> equivalent forward existential formula: ((([(((FwdU(EY(Init),TRUE) * ((TrainState_0<1)&&(TrainState_42<1))) * (((((((((TrainState_61<1)&&(TrainState_191...6893
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,2.43303,42256,1,0,12,209743,14,4,4646,131409,9
FORMULA BART-COL-010-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:29:32] [INFO ] Invariant cache hit.
[2026-05-23 11:29:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 11:29:32] [INFO ] Invariant cache hit.
[2026-05-23 11:29:32] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 132/132 places, 202/202 transitions.
[2026-05-23 11:29:32] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:29:32] [INFO ] Flatten gal took : 10 ms
[2026-05-23 11:29:32] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 11:29:32] [INFO ] Flatten gal took : 10 ms
[2026-05-23 11:29:32] [INFO ] Flatten gal took : 9 ms
[2026-05-23 11:29:32] [INFO ] Time to serialize gal into /tmp/CTLFireability11531031098673455472.gal : 1 ms
[2026-05-23 11:29:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11960738654890324869.ctl : 4 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/CTLFireability11531031098673455472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11960738654890324869.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.556163,13272,2,1443,5,59658,6,0,733,37980,0


Converting to forward existential form...Done !
original formula: (E((((((((EX((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainSta...28903
=> equivalent forward existential formula: [(((Init * E((((((((EX((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1))...44254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 165/0/37
Hit Full ! (commute/partial/dont) 165/0/37
Detected timeout of ITS tools.
[2026-05-23 11:30:02] [INFO ] Flatten gal took : 6 ms
[2026-05-23 11:30:02] [INFO ] Applying decomposition
[2026-05-23 11:30:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1412939847592194517.txt' '-o' '/tmp/graph1412939847592194517.bin' '-w' '/tmp/graph1412939847592194517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1412939847592194517.bin' '-l' '-1' '-v' '-w' '/tmp/graph1412939847592194517.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:30:02] [INFO ] Decomposing Gal with order
[2026-05-23 11:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:30:02] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-23 11:30:03] [INFO ] Flatten gal took : 34 ms
[2026-05-23 11:30:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2026-05-23 11:30:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15657267584065450207.gal : 5 ms
[2026-05-23 11:30:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9309489442269771267.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/CTLFireability15657267584065450207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9309489442269771267.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,4.42569,86584,497,177,150252,22428,414,285181,109,84972,0


Converting to forward existential form...Done !
original formula: (E((((((((EX((((((i5.u12.TrainState_131>=1)||(i6.u33.TrainState_130>=1))||((i6.u33.TrainState_175>=1)||(i6.u37.TrainState_178>=1)))||(((i...38652
=> equivalent forward existential formula: [(((Init * E((((((((EX((((((i5.u12.TrainState_131>=1)||(i6.u33.TrainState_130>=1))||((i6.u33.TrainState_175>=1)|...59083
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 132 transition count 145
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 75 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 70 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 70 transition count 140
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 152 place count 56 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 2 with 35 rules applied. Total rules applied 187 place count 56 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 187 place count 56 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 189 place count 55 transition count 90
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 55 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 54 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 54 transition count 89
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 193 place count 54 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 54 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 53 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 53 transition count 86
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 53 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 198 place count 52 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 52 transition count 84
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 200 place count 52 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 201 place count 51 transition count 83
Applied a total of 201 rules in 46 ms. Remains 51 /132 variables (removed 81) and now considering 83/202 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18000513821515905672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14469787268042695295.kers'
[2026-05-23 11:30:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18000513821515905672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14469787268042695295.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 51 cols 166 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 11:30:33] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14469787268042695295.kers
Total runtime 2 ms.
[2026-05-23 11:30:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-23 11:30:33] [INFO ] Invariant cache hit.
[2026-05-23 11:30:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-23 11:30:33] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-23 11:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 83/134 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 52 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 83/134 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 81/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 133 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2982 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6198ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6198ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/132 places, 83/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6338 ms. Remains : 51/132 places, 83/202 transitions.
[2026-05-23 11:30:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:30:39] [INFO ] Flatten gal took : 3 ms
[2026-05-23 11:30:39] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-23 11:30:39] [INFO ] Flatten gal took : 3 ms
[2026-05-23 11:30:39] [INFO ] Flatten gal took : 3 ms
[2026-05-23 11:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10495212805518520729.gal : 1 ms
[2026-05-23 11:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5660013818936205980.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/CTLFireability10495212805518520729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5660013818936205980.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.5394e+10,0.900891,20012,2,552,5,91529,6,0,290,97707,0


Converting to forward existential form...Done !
original formula: !(E((TrainState_42>=1) U !(EF(AG((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainStat...257
=> equivalent forward existential formula: [(FwdU(Init,(TrainState_42>=1)) * !(E(TRUE U !(E(TRUE U !((((((TrainState_131>=1)||(TrainState_130>=1))||((Train...317
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 81/0/2
(forward)formula 0,0,1.03315,20192,1,0,7,91529,22,1,1679,97707,8
FORMULA BART-COL-010-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 10 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3691111245958564272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8367512675677547706.kers'
[2026-05-23 11:30:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3691111245958564272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8367512675677547706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 100 cols 340 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-23 11:30:40] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8367512675677547706.kers
Total runtime 1 ms.
[2026-05-23 11:30:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 11:30:40] [INFO ] Invariant cache hit.
[2026-05-23 11:30:40] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-23 11:30:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16470ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 16471ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16611 ms. Remains : 100/132 places, 170/202 transitions.
[2026-05-23 11:30:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 11:30:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 11:30:57] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-23 11:30:57] [INFO ] Flatten gal took : 5 ms
[2026-05-23 11:30:57] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:30:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18407835075963864811.gal : 1 ms
[2026-05-23 11:30:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15743919546444713966.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/CTLFireability18407835075963864811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15743919546444713966.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,4.26342e+13,0.329492,9420,2,1091,5,37510,6,0,573,24746,0


Converting to forward existential form...Done !
original formula: AF(AX(AF(AX(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_118<1)))&&(((TrainState_57<1)&&(TrainState_110<...1923
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(!(EX(!(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_...1986
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,12.9223,240008,1,0,104,1.3155e+06,22,101,3541,1.2918e+06,112
FORMULA BART-COL-010-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 11 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14792616939934451777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3709589479580050304.kers'
[2026-05-23 11:31:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14792616939934451777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3709589479580050304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 109 cols 358 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-23 11:31:10] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3709589479580050304.kers
Total runtime 1 ms.
[2026-05-23 11:31:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 11:31:10] [INFO ] Invariant cache hit.
[2026-05-23 11:31:10] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-05-23 11:31:10] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2026-05-23 11:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18939ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 18940ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19102 ms. Remains : 109/132 places, 179/202 transitions.
[2026-05-23 11:31:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:31:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:31:29] [INFO ] Input system was already deterministic with 179 transitions.
[2026-05-23 11:31:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:31:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 11:31:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3812377514973231113.gal : 2 ms
[2026-05-23 11:31:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9858509098436749051.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/CTLFireability3812377514973231113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9858509098436749051.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,9.7455e+13,0.457625,11448,2,1190,5,48707,6,0,618,28225,0


Converting to forward existential form...Done !
original formula: EF(EG(A(E(((TrainState_42>=1)&&(((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_...2256
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_11...6289
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 153/3/26
Hit Full ! (commute/partial/dont) 21/13659/158
(forward)formula 0,1,2.39092,44980,1,0,12,238456,32,6,4695,157810,17
FORMULA BART-COL-010-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 11:31:31] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:31:31] [INFO ] Flatten gal took : 7 ms
[2026-05-23 11:31:31] [INFO ] Applying decomposition
[2026-05-23 11:31:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2477768870744271080.txt' '-o' '/tmp/graph2477768870744271080.bin' '-w' '/tmp/graph2477768870744271080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2477768870744271080.bin' '-l' '-1' '-v' '-w' '/tmp/graph2477768870744271080.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:31:31] [INFO ] Decomposing Gal with order
[2026-05-23 11:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:31:31] [INFO ] Removed a total of 44 redundant transitions.
[2026-05-23 11:31:31] [INFO ] Flatten gal took : 23 ms
[2026-05-23 11:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2026-05-23 11:31:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16776140633911930707.gal : 3 ms
[2026-05-23 11:31:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11042260109250963844.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16776140633911930707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11042260109250963844.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,7.63191,136040,497,210,232580,17252,403,572148,125,69543,0


Converting to forward existential form...Done !
original formula: AF(!(A(((((((((u3.TrainState_61>=1)||(i5.u37.TrainState_191>=1))||((u3.TrainState_63>=1)||(i4.u35.TrainState_189>=1)))||(((i6.u19.TrainSt...4687
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((!(EG(!((i2.u0.TrainState_42>=1)))) * !((E(!((i2.u0.TrainState_42>=1)) U (!((u3.TrainStat...10338
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-23 11:38:27] [INFO ] Applying decomposition
[2026-05-23 11:38:27] [INFO ] Flatten gal took : 8 ms
[2026-05-23 11:38:27] [INFO ] Decomposing Gal with order
[2026-05-23 11:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:38:28] [INFO ] Removed a total of 140 redundant transitions.
[2026-05-23 11:38:28] [INFO ] Flatten gal took : 62 ms
[2026-05-23 11:38:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-23 11:38:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11881192748345776119.gal : 5 ms
[2026-05-23 11:38:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1805549832139424843.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/CTLFireability11881192748345776119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1805549832139424843.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1745e+14,0.547144,17340,1454,12,26781,337,473,16128,5,279,0


Converting to forward existential form...Done !
original formula: AF(!(A(((((((((trainidspeeddistance61.TrainState_61>=1)||(trainidspeeddistance191.TrainState_191>=1))||((trainidspeeddistance63.TrainStat...7312
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((!(EG(!((trainidspeeddistance42.TrainState_42>=1)))) * !((E(!((trainidspeeddistance42.Tra...16087
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
(forward)formula 0,1,185.535,2206664,1,0,3.99857e+06,1132,2126,6.10188e+06,25,4321,4028484
FORMULA BART-COL-010-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF((EG((AG(((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance65.TrainState_65<1))&&((trainidspeeddistance53.TrainSta...14772
=> equivalent forward existential formula: ([FwdG(Init,!((EG((!(E(TRUE U !(((((((((trainidspeeddistance61.TrainState_61<1)&&(trainidspeeddistance65.TrainSt...14887
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
(forward)formula 1,0,287.996,3794996,1,0,7.60459e+06,1132,2043,9.77858e+06,24,4321,2214464
FORMULA BART-COL-010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E((((((((EX((((((trainidspeeddistance131.TrainState_131>=1)||(trainidspeeddistance130.TrainState_130>=1))||((trainidspeeddistance175.Tra...58923
=> equivalent forward existential formula: [(((Init * E((((((((EX((((((trainidspeeddistance131.TrainState_131>=1)||(trainidspeeddistance130.TrainState_130>...90028
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
Fast SCC detection found an SCC at level 100
Fast SCC detection found an SCC at level 101
Fast SCC detection found an SCC at level 102
Fast SCC detection found an SCC at level 103
Fast SCC detection found an SCC at level 104
Fast SCC detection found an SCC at level 105
Fast SCC detection found an SCC at level 106
Fast SCC detection found an SCC at level 107
Fast SCC detection found an SCC at level 108
Fast SCC detection found an SCC at level 109
Fast SCC detection found an SCC at level 110
Fast SCC detection found an SCC at level 111
Fast SCC detection found an SCC at level 112
Fast SCC detection found an SCC at level 113
Fast SCC detection found an SCC at level 114
Fast SCC detection found an SCC at level 115
Fast SCC detection found an SCC at level 116
Fast SCC detection found an SCC at level 117
Fast SCC detection found an SCC at level 118
Fast SCC detection found an SCC at level 119
Fast SCC detection found an SCC at level 120
Fast SCC detection found an SCC at level 121
Fast SCC detection found an SCC at level 122
Fast SCC detection found an SCC at level 123
Fast SCC detection found an SCC at level 124
Fast SCC detection found an SCC at level 125
Fast SCC detection found an SCC at level 126
Fast SCC detection found an SCC at level 127
Fast SCC detection found an SCC at level 128
Fast SCC detection found an SCC at level 129
Fast SCC detection found an SCC at level 130
Fast SCC detection found an SCC at level 131
(forward)formula 2,0,679.852,4631884,1,0,8.34242e+06,1132,1648,1.20288e+07,25,4321,4208716
FORMULA BART-COL-010-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1525581 ms.

BK_STOP 1779536989478

--------------------
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-COL-010"
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-COL-010, 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-177946788000178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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