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-177946788100274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BART-PT-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 92M
-rw-r--r-- 1 mcc users 3.5M Mar 5 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 13M Mar 5 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Mar 5 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.3M Mar 5 09:49 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 1.9M Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Mar 15 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Mar 15 07:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0M Mar 5 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15M Mar 5 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9M Mar 5 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Mar 5 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 673K Mar 15 07:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.4M Mar 15 07:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779558394780

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 17:46:36] [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 17:46:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:46:38] [INFO ] Load time of PNML (sax parser for PT used): 1161 ms
[2026-05-23 17:46:38] [INFO ] Transformed 6810 places.
[2026-05-23 17:46:38] [INFO ] Transformed 10100 transitions.
[2026-05-23 17:46:38] [INFO ] Found NUPN structural information;
[2026-05-23 17:46:38] [INFO ] Parsed PT model containing 6810 places and 10100 transitions and 81000 arcs in 1413 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 450 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 6600 out of 6600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 101 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (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-7653028312084662141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3632514121101700776.kers'
[2026-05-23 17:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7653028312084662141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3632514121101700776.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 10100 rows 6600 cols 20200 entries
Finished phase 1 with 6550 SingleSign rule and 0 generalized
[2026-05-23 17:46:40] [INFO ] Computed 50 invariants in 51 ms
Computed 50 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-3632514121101700776.kers
Total runtime 62 ms.
[2026-05-23 17:46:43] [INFO ] Implicit Places using invariants in 3454 ms returned []
Implicit Place search using SMT only with invariants took 3568 ms to find 0 implicit places.
Running 8300 sub problems to find dead transitions.
[2026-05-23 17:46:43] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30293 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 8300/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30216 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 0/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68975ms problems are : Problem set: 0 solved, 8300 unsolved
Search for dead transitions found 0 dead transitions in 69056ms
Finished structural reductions in LTL mode , in 1 iterations and 72836 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 40 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2026-05-23 17:47:52] [INFO ] Invariant cache hit.
[2026-05-23 17:47:55] [INFO ] Implicit Places using invariants in 2269 ms returned []
Implicit Place search using SMT only with invariants took 2271 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 6600/6600 places, 10100/10100 transitions.
Support contains 6600 out of 6600 places after structural reductions.
[2026-05-23 17:47:56] [INFO ] Flatten gal took : 732 ms
[2026-05-23 17:47:58] [INFO ] Flatten gal took : 575 ms
[2026-05-23 17:48:00] [INFO ] Input system was already deterministic with 10100 transitions.
Reduction of identical properties reduced properties to check from 51 to 47
RANDOM walk for 40000 steps (8 resets) in 3551 ms. (11 steps per ms) remains 5/47 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9875 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
[2026-05-23 17:48:04] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/6150 variables, 6150/6150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6150/16700 variables, and 6150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5224 ms.
Refiners :[Domain max(s): 6150/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6150 variables, 6150/6150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6150/16700 variables, and 6150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Domain max(s): 6150/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10314ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6150 out of 6600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 6600 transition count 10050
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 6550 transition count 10050
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 8 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 500 place count 6350 transition count 9850
Drop transitions (Redundant composition of simpler transitions.) removed 1750 transitions
Redundant transition composition rules discarded 1750 transitions
Iterating global reduction 2 with 1750 rules applied. Total rules applied 2250 place count 6350 transition count 8100
Applied a total of 2250 rules in 1048 ms. Remains 6350 /6600 variables (removed 250) and now considering 8100/10100 (removed 2000) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1051 ms. Remains : 6350/6600 places, 8100/10100 transitions.
RANDOM walk for 40000 steps (8 resets) in 1243 ms. (32 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7894 ms. (5 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10336602790378344077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16598782761345478894.kers'
[2026-05-23 17:48:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10336602790378344077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16598782761345478894.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 8100 rows 6350 cols 16200 entries
Finished phase 1 with 6300 SingleSign rule and 0 generalized
[2026-05-23 17:48:18] [INFO ] Computed 50 invariants in 45 ms
Computed 50 P flows in 45 ms.
Exported basis to /tmp/petrispot-output-16598782761345478894.kers
Total runtime 52 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6150 variables, 6150/6150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6150 variables, 0/6150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 200/6350 variables, 50/6200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6350 variables, 200/6400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6350 variables, 0/6400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8100/14450 variables, 6350/12750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14450 variables, 0/12750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/14450 variables, 0/12750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14450/14450 variables, and 12750 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32487 ms.
Refiners :[Domain max(s): 6350/6350 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 6350/6350 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6150 variables, 6150/6150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6150 variables, 0/6150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 200/6350 variables, 50/6200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6350 variables, 200/6400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6350 variables, 0/6400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8100/14450 variables, 6350/12750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14450 variables, 2/12752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14450 variables, 0/12752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/14450 variables, 0/12752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14450/14450 variables, and 12752 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29185 ms.
Refiners :[Domain max(s): 6350/6350 constraints, Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 6350/6350 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61797ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 79455 steps, including 93 resets, run visited all 3 properties in 889 ms. (steps per millisecond=89 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 904 ms.
[2026-05-23 17:49:21] [INFO ] Flatten gal took : 236 ms
[2026-05-23 17:49:23] [INFO ] Flatten gal took : 408 ms
[2026-05-23 17:49:24] [INFO ] Input system was already deterministic with 10100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 6600 transition count 10050
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 6550 transition count 10050
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 500 place count 6350 transition count 9850
Applied a total of 500 rules in 319 ms. Remains 6350 /6600 variables (removed 250) and now considering 9850/10100 (removed 250) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9586673190881138253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10522394263094143761.kers'
[2026-05-23 17:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9586673190881138253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10522394263094143761.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 9850 rows 6350 cols 19700 entries
Finished phase 1 with 6300 SingleSign rule and 0 generalized
[2026-05-23 17:49:25] [INFO ] Computed 50 invariants in 52 ms
Computed 50 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-10522394263094143761.kers
Total runtime 61 ms.
[2026-05-23 17:49:27] [INFO ] Implicit Places using invariants in 2192 ms returned []
[2026-05-23 17:49:27] [INFO ] Invariant cache hit.
[2026-05-23 17:49:36] [INFO ] Implicit Places using invariants and state equation in 8949 ms returned []
Implicit Place search using SMT with State Equation took 11149 ms to find 0 implicit places.
[2026-05-23 17:49:37] [INFO ] Redundant transitions in 1698 ms returned []
Running 8050 sub problems to find dead transitions.
[2026-05-23 17:49:37] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/6300 variables, 6300/6300 constraints. Problems are: Problem set: 0 solved, 8050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6300/16200 variables, and 6300 constraints, problems are : Problem set: 0 solved, 8050 unsolved in 30165 ms.
Refiners :[Domain max(s): 6300/6350 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6350 constraints, PredecessorRefiner: 8050/8050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6300 variables, 6300/6300 constraints. Problems are: Problem set: 0 solved, 8050 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6300/16200 variables, and 6300 constraints, problems are : Problem set: 0 solved, 8050 unsolved in 30246 ms.
Refiners :[Domain max(s): 6300/6350 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6350 constraints, PredecessorRefiner: 0/8050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67994ms problems are : Problem set: 0 solved, 8050 unsolved
Search for dead transitions found 0 dead transitions in 68018ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6350/6600 places, 9850/10100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81216 ms. Remains : 6350/6600 places, 9850/10100 transitions.
[2026-05-23 17:50:46] [INFO ] Flatten gal took : 235 ms
[2026-05-23 17:50:46] [INFO ] Flatten gal took : 212 ms
[2026-05-23 17:50:47] [INFO ] Input system was already deterministic with 9850 transitions.
[2026-05-23 17:50:47] [INFO ] Flatten gal took : 211 ms
[2026-05-23 17:50:47] [INFO ] Flatten gal took : 211 ms
[2026-05-23 17:50:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17193562678312396677.gal : 90 ms
[2026-05-23 17:50:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14102394252544113517.ctl : 94 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/CTLFireability17193562678312396677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14102394252544113517.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.
Detected timeout of ITS tools.
[2026-05-23 17:51:18] [INFO ] Flatten gal took : 190 ms
[2026-05-23 17:51:18] [INFO ] Applying decomposition
[2026-05-23 17:51:18] [INFO ] Flatten gal took : 195 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/graph929898101250320469.txt' '-o' '/tmp/graph929898101250320469.bin' '-w' '/tmp/graph929898101250320469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph929898101250320469.bin' '-l' '-1' '-v' '-w' '/tmp/graph929898101250320469.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:51:19] [INFO ] Decomposing Gal with order
[2026-05-23 17:51:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:51:23] [INFO ] Removed a total of 1027 redundant transitions.
[2026-05-23 17:51:24] [INFO ] Flatten gal took : 951 ms
[2026-05-23 17:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 79 ms.
[2026-05-23 17:51:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14508507770869022778.gal : 89 ms
[2026-05-23 17:51:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6610880414603870378.ctl : 81 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/CTLFireability14508507770869022778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6610880414603870378.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,1.54948e+105,11.8031,70480,1843,75,40584,3623,4962,37349,326,3443,0


Converting to forward existential form...Done !
original formula: (AF((AG(((((((((((((((i4.i0.u1959.TrainState_31_3_35==1)||(i45.i2.u797.TrainState_33_2_19==1))||((i25.i1.u1588.TrainState_18_3_30==1)||(i...889304
=> equivalent forward existential formula: [FwdG((Init * !(EG(((((((((((((((i4.i0.u1959.TrainState_31_3_35==0)&&(i45.i2.u797.TrainState_33_2_19==0))&&((i25...889370
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 777 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (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-2317516467554524782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15216628641479497873.kers'
[2026-05-23 17:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2317516467554524782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15216628641479497873.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 10100 rows 6600 cols 20200 entries
Finished phase 1 with 6550 SingleSign rule and 0 generalized
[2026-05-23 17:52:10] [INFO ] Computed 50 invariants in 58 ms
Computed 50 P flows in 59 ms.
Exported basis to /tmp/petrispot-output-15216628641479497873.kers
Total runtime 75 ms.
[2026-05-23 17:52:12] [INFO ] Implicit Places using invariants in 2550 ms returned []
Implicit Place search using SMT only with invariants took 2552 ms to find 0 implicit places.
Running 8300 sub problems to find dead transitions.
[2026-05-23 17:52:13] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30244 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 8300/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30247 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 0/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67449ms problems are : Problem set: 0 solved, 8300 unsolved
Search for dead transitions found 0 dead transitions in 67466ms
Finished structural reductions in LTL mode , in 1 iterations and 70819 ms. Remains : 6600/6600 places, 10100/10100 transitions.
[2026-05-23 17:53:20] [INFO ] Flatten gal took : 231 ms
[2026-05-23 17:53:21] [INFO ] Flatten gal took : 244 ms
[2026-05-23 17:53:21] [INFO ] Input system was already deterministic with 10100 transitions.
[2026-05-23 17:53:21] [INFO ] Flatten gal took : 159 ms
[2026-05-23 17:53:21] [INFO ] Flatten gal took : 164 ms
[2026-05-23 17:53:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9571393053339745757.gal : 40 ms
[2026-05-23 17:53:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7038454935790975166.ctl : 12 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/CTLFireability9571393053339745757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7038454935790975166.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.
Detected timeout of ITS tools.
[2026-05-23 17:53:52] [INFO ] Flatten gal took : 146 ms
[2026-05-23 17:53:52] [INFO ] Applying decomposition
[2026-05-23 17:53:52] [INFO ] Flatten gal took : 152 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/graph8304325656343707937.txt' '-o' '/tmp/graph8304325656343707937.bin' '-w' '/tmp/graph8304325656343707937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8304325656343707937.bin' '-l' '-1' '-v' '-w' '/tmp/graph8304325656343707937.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:53:52] [INFO ] Decomposing Gal with order
[2026-05-23 17:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:53:56] [INFO ] Removed a total of 665 redundant transitions.
[2026-05-23 17:53:56] [INFO ] Flatten gal took : 362 ms
[2026-05-23 17:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 32 ms.
[2026-05-23 17:54:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12665476605809338591.gal : 70 ms
[2026-05-23 17:54:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12072654155226357204.ctl : 16 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/CTLFireability12665476605809338591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12072654155226357204.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 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.06831e+106,11.4701,71732,1525,75,33610,3275,4585,34024,283,2874,0


Converting to forward existential form...Done !
original formula: (AX(AG(EF(((((((((((((i13.i0.u128.TrainState_12_0_0==1)||(i36.i1.u349.TrainState_23_0_0==1))||((i34.i0.u120.TrainState_47_0_0==1)||(i8.i0...288642
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U ((((((((((((i13.i0.u128.TrainState_12_0_0==1)||(i36.i1.u349.TrainState_23_0_...4390778
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 30 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2026-05-23 17:54:32] [INFO ] Invariant cache hit.
[2026-05-23 17:54:34] [INFO ] Implicit Places using invariants in 2160 ms returned []
Implicit Place search using SMT only with invariants took 2162 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2202 ms. Remains : 6600/6600 places, 10100/10100 transitions.
[2026-05-23 17:54:35] [INFO ] Flatten gal took : 167 ms
[2026-05-23 17:54:35] [INFO ] Flatten gal took : 236 ms
[2026-05-23 17:54:35] [INFO ] Input system was already deterministic with 10100 transitions.
[2026-05-23 17:54:35] [INFO ] Flatten gal took : 149 ms
[2026-05-23 17:54:36] [INFO ] Flatten gal took : 158 ms
[2026-05-23 17:54:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15737725293043540811.gal : 30 ms
[2026-05-23 17:54:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10901854056409590709.ctl : 16 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/CTLFireability15737725293043540811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10901854056409590709.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.
Detected timeout of ITS tools.
[2026-05-23 17:55:06] [INFO ] Flatten gal took : 152 ms
[2026-05-23 17:55:06] [INFO ] Applying decomposition
[2026-05-23 17:55:06] [INFO ] Flatten gal took : 160 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/graph12846124239674253673.txt' '-o' '/tmp/graph12846124239674253673.bin' '-w' '/tmp/graph12846124239674253673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12846124239674253673.bin' '-l' '-1' '-v' '-w' '/tmp/graph12846124239674253673.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:55:06] [INFO ] Decomposing Gal with order
[2026-05-23 17:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:55:11] [INFO ] Removed a total of 995 redundant transitions.
[2026-05-23 17:55:11] [INFO ] Flatten gal took : 365 ms
[2026-05-23 17:55:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 61 ms.
[2026-05-23 17:55:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2038934404674429224.gal : 53 ms
[2026-05-23 17:55:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12261528821848386957.ctl : 49 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/CTLFireability2038934404674429224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12261528821848386957.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,1.06831e+106,11.2026,72260,1981,75,41868,3397,5044,42384,268,3103,0


Converting to forward existential form...Done !
original formula: EG(AF((EX(((((((((((((((((i22.i11.u2082.TrainState_31_3_35==1)||(i18.i4.u799.TrainState_33_2_19==1))||((i47.i8.u1811.TrainState_18_3_30==...568065
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((EX(((((((((((((((((i22.i11.u2082.TrainState_31_3_35==1)||(i18.i4.u799.TrainState_33_2_19==1))...568114
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 20 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (removed 0) transitions.
[2026-05-23 17:55:51] [INFO ] Invariant cache hit.
[2026-05-23 17:55:53] [INFO ] Implicit Places using invariants in 2202 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2233 ms. Remains : 6600/6600 places, 10100/10100 transitions.
[2026-05-23 17:55:53] [INFO ] Flatten gal took : 140 ms
[2026-05-23 17:55:54] [INFO ] Flatten gal took : 275 ms
[2026-05-23 17:55:54] [INFO ] Input system was already deterministic with 10100 transitions.
[2026-05-23 17:55:54] [INFO ] Flatten gal took : 181 ms
[2026-05-23 17:55:55] [INFO ] Flatten gal took : 298 ms
[2026-05-23 17:55:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5186913152123708560.gal : 52 ms
[2026-05-23 17:55:55] [INFO ] Time to serialize properties into /tmp/CTLFireability860656084482229650.ctl : 35 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/CTLFireability5186913152123708560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability860656084482229650.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.
Detected timeout of ITS tools.
[2026-05-23 17:56:25] [INFO ] Flatten gal took : 280 ms
[2026-05-23 17:56:25] [INFO ] Applying decomposition
[2026-05-23 17:56:26] [INFO ] Flatten gal took : 281 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/graph7637274054314989307.txt' '-o' '/tmp/graph7637274054314989307.bin' '-w' '/tmp/graph7637274054314989307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7637274054314989307.bin' '-l' '-1' '-v' '-w' '/tmp/graph7637274054314989307.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:56:26] [INFO ] Decomposing Gal with order
[2026-05-23 17:56:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:56:30] [INFO ] Removed a total of 812 redundant transitions.
[2026-05-23 17:56:30] [INFO ] Flatten gal took : 351 ms
[2026-05-23 17:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 61 ms.
[2026-05-23 17:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12912702625769064999.gal : 67 ms
[2026-05-23 17:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7326261248323784882.ctl : 36 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/CTLFireability12912702625769064999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7326261248323784882.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,1.06831e+106,11.7189,72712,1677,75,36146,3193,4770,33765,253,2806,0


Converting to forward existential form...Done !
original formula: EF((((((((((A(((((((((i6.i0.u29.TrainState_15_1_1==1)||(i41.i7.u8.TrainState_17_1_1==1))||((i23.i0.u9.TrainState_19_1_1==1)||(i34.i0.u31....714638
=> equivalent forward existential formula: ((((((((([((FwdU(Init,TRUE) * !(EG(!(EX(!(EX(!(((((((((((((((i49.i5.u2029.TrainState_31_3_35==1)||(i42.i3.u783.T...1404302
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 6600 transition count 10050
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 6550 transition count 10050
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 5 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 500 place count 6350 transition count 9850
Applied a total of 500 rules in 426 ms. Remains 6350 /6600 variables (removed 250) and now considering 9850/10100 (removed 250) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4501478078526763632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-864345282235573138.kers'
[2026-05-23 17:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4501478078526763632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-864345282235573138.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 9850 rows 6350 cols 19700 entries
Finished phase 1 with 6300 SingleSign rule and 0 generalized
[2026-05-23 17:57:15] [INFO ] Computed 50 invariants in 88 ms
Computed 50 P flows in 89 ms.
Exported basis to /tmp/petrispot-output-864345282235573138.kers
Total runtime 105 ms.
[2026-05-23 17:57:17] [INFO ] Implicit Places using invariants in 2624 ms returned []
[2026-05-23 17:57:17] [INFO ] Invariant cache hit.
[2026-05-23 17:57:26] [INFO ] Implicit Places using invariants and state equation in 8474 ms returned []
Implicit Place search using SMT with State Equation took 11108 ms to find 0 implicit places.
[2026-05-23 17:57:27] [INFO ] Redundant transitions in 1776 ms returned []
Running 8050 sub problems to find dead transitions.
[2026-05-23 17:57:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/6300 variables, 6300/6300 constraints. Problems are: Problem set: 0 solved, 8050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6300/16200 variables, and 6300 constraints, problems are : Problem set: 0 solved, 8050 unsolved in 30238 ms.
Refiners :[Domain max(s): 6300/6350 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6350 constraints, PredecessorRefiner: 8050/8050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6300 variables, 6300/6300 constraints. Problems are: Problem set: 0 solved, 8050 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6300/16200 variables, and 6300 constraints, problems are : Problem set: 0 solved, 8050 unsolved in 30235 ms.
Refiners :[Domain max(s): 6300/6350 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6350 constraints, PredecessorRefiner: 0/8050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67193ms problems are : Problem set: 0 solved, 8050 unsolved
Search for dead transitions found 0 dead transitions in 67214ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6350/6600 places, 9850/10100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80558 ms. Remains : 6350/6600 places, 9850/10100 transitions.
[2026-05-23 17:58:35] [INFO ] Flatten gal took : 212 ms
[2026-05-23 17:58:35] [INFO ] Flatten gal took : 262 ms
[2026-05-23 17:58:36] [INFO ] Input system was already deterministic with 9850 transitions.
[2026-05-23 17:58:36] [INFO ] Flatten gal took : 175 ms
[2026-05-23 17:58:36] [INFO ] Flatten gal took : 184 ms
[2026-05-23 17:58:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10413109760882321592.gal : 34 ms
[2026-05-23 17:58:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6961862142660875431.ctl : 16 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/CTLFireability10413109760882321592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6961862142660875431.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.
Detected timeout of ITS tools.
[2026-05-23 17:59:07] [INFO ] Flatten gal took : 153 ms
[2026-05-23 17:59:07] [INFO ] Applying decomposition
[2026-05-23 17:59:07] [INFO ] Flatten gal took : 169 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/graph12533788944141639771.txt' '-o' '/tmp/graph12533788944141639771.bin' '-w' '/tmp/graph12533788944141639771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12533788944141639771.bin' '-l' '-1' '-v' '-w' '/tmp/graph12533788944141639771.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:59:07] [INFO ] Decomposing Gal with order
[2026-05-23 17:59:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:59:11] [INFO ] Removed a total of 1158 redundant transitions.
[2026-05-23 17:59:11] [INFO ] Flatten gal took : 340 ms
[2026-05-23 17:59:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 23 ms.
[2026-05-23 17:59:19] [INFO ] Time to serialize gal into /tmp/CTLFireability3741155522097051500.gal : 52 ms
[2026-05-23 17:59:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12130988943694914688.ctl : 25 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/CTLFireability3741155522097051500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12130988943694914688.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,1.54948e+105,11.4349,69632,2011,75,40582,3658,5252,37732,321,3433,0


Converting to forward existential form...Done !
original formula: EF(EG((EF(((((((((((((((i21.i0.u170.TrainState_12_0_0==1)||(i27.i0.u114.TrainState_23_0_0==1))||((i19.i0.u145.TrainState_47_0_0==1)||(i8....505066
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((((((((((((((i21.i0.u170.TrainState_12_0_0==1)||(i27.i0.u114.TrainState_23_0_0=...505122
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,1,20.1515,142276,1,0,131961,249689,87842,217974,4298,297460,274559
FORMULA BART-PT-050-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 52 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (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-4572941465756391516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14522504521757184751.kers'
[2026-05-23 17:59:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4572941465756391516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14522504521757184751.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 10100 rows 6600 cols 20200 entries
Finished phase 1 with 6550 SingleSign rule and 0 generalized
[2026-05-23 17:59:40] [INFO ] Computed 50 invariants in 82 ms
Computed 50 P flows in 99 ms.
Exported basis to /tmp/petrispot-output-14522504521757184751.kers
Total runtime 125 ms.
[2026-05-23 17:59:42] [INFO ] Implicit Places using invariants in 2851 ms returned []
Implicit Place search using SMT only with invariants took 2856 ms to find 0 implicit places.
Running 8300 sub problems to find dead transitions.
[2026-05-23 17:59:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30263 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 8300/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30207 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 0/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68116ms problems are : Problem set: 0 solved, 8300 unsolved
Search for dead transitions found 0 dead transitions in 68143ms
Finished structural reductions in LTL mode , in 1 iterations and 71083 ms. Remains : 6600/6600 places, 10100/10100 transitions.
[2026-05-23 18:00:51] [INFO ] Flatten gal took : 166 ms
[2026-05-23 18:00:51] [INFO ] Flatten gal took : 205 ms
[2026-05-23 18:00:51] [INFO ] Input system was already deterministic with 10100 transitions.
[2026-05-23 18:00:51] [INFO ] Flatten gal took : 148 ms
[2026-05-23 18:00:52] [INFO ] Flatten gal took : 164 ms
[2026-05-23 18:00:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5820844433066427780.gal : 33 ms
[2026-05-23 18:00:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7119515963998368732.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/CTLFireability5820844433066427780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7119515963998368732.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.
Detected timeout of ITS tools.
[2026-05-23 18:01:22] [INFO ] Flatten gal took : 146 ms
[2026-05-23 18:01:22] [INFO ] Applying decomposition
[2026-05-23 18:01:22] [INFO ] Flatten gal took : 156 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/graph16770872214322588526.txt' '-o' '/tmp/graph16770872214322588526.bin' '-w' '/tmp/graph16770872214322588526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16770872214322588526.bin' '-l' '-1' '-v' '-w' '/tmp/graph16770872214322588526.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:01:22] [INFO ] Decomposing Gal with order
[2026-05-23 18:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:01:26] [INFO ] Removed a total of 701 redundant transitions.
[2026-05-23 18:01:26] [INFO ] Flatten gal took : 368 ms
[2026-05-23 18:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 23 ms.
[2026-05-23 18:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15856495403503765329.gal : 50 ms
[2026-05-23 18:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17410420940097288529.ctl : 18 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/CTLFireability15856495403503765329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17410420940097288529.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 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.06831e+106,12.6772,71884,1647,75,32048,3207,4485,29928,271,2765,0


Converting to forward existential form...Done !
original formula: AG((EX(((((((((((((((((((((i49.i7.u2081.TrainState_31_3_35==1)||(i29.i0.u899.TrainState_33_2_19==1))||((i36.i9.u1770.TrainState_18_3_30==...363007
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(((((((((((((((((((((i49.i7.u2081.TrainState_31_3_35==1)||(i29.i0.u899.TrainState_33_2_...363109
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,26.0211,241604,1,0,413601,236896,93985,574211,7003,293309,482643
FORMULA BART-PT-050-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3200 transitions
Trivial Post-agglo rules discarded 3200 transitions
Performed 3200 trivial Post agglomeration. Transition count delta: 3200
Iterating post reduction 0 with 3200 rules applied. Total rules applied 3200 place count 6600 transition count 6900
Reduce places removed 3200 places and 0 transitions.
Iterating post reduction 1 with 3200 rules applied. Total rules applied 6400 place count 3400 transition count 6900
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 6400 place count 3400 transition count 6650
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 7200 place count 2850 transition count 6350
Iterating global reduction 2 with 300 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 7550 place count 2850 transition count 6300
Discarding 200 places :
Symmetric choice reduction at 3 with 200 rule applications. Total rules 7750 place count 2650 transition count 6100
Iterating global reduction 3 with 200 rules applied. Total rules applied 7950 place count 2650 transition count 6100
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8100 place count 2500 transition count 5950
Iterating global reduction 3 with 150 rules applied. Total rules applied 8250 place count 2500 transition count 5950
Discarding 150 places :
Symmetric choice reduction at 3 with 150 rule applications. Total rules 8400 place count 2350 transition count 5800
Iterating global reduction 3 with 150 rules applied. Total rules applied 8550 place count 2350 transition count 5800
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8650 place count 2250 transition count 5700
Iterating global reduction 3 with 100 rules applied. Total rules applied 8750 place count 2250 transition count 5700
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 8850 place count 2150 transition count 5600
Iterating global reduction 3 with 100 rules applied. Total rules applied 8950 place count 2150 transition count 5600
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 9000 place count 2100 transition count 5550
Iterating global reduction 3 with 50 rules applied. Total rules applied 9050 place count 2100 transition count 5550
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 3 with 600 rules applied. Total rules applied 9650 place count 1800 transition count 5250
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 9750 place count 1800 transition count 5150
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 9850 place count 1750 transition count 5100
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 9950 place count 1750 transition count 5000
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 10050 place count 1700 transition count 4950
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 10150 place count 1700 transition count 4850
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 10250 place count 1650 transition count 4800
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 6 with 100 rules applied. Total rules applied 10350 place count 1650 transition count 4700
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 10450 place count 1600 transition count 4650
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 7 with 100 rules applied. Total rules applied 10550 place count 1600 transition count 4550
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 8 with 100 rules applied. Total rules applied 10650 place count 1550 transition count 4500
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 8 with 100 rules applied. Total rules applied 10750 place count 1550 transition count 4400
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 9 with 100 rules applied. Total rules applied 10850 place count 1500 transition count 4350
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 9 with 100 rules applied. Total rules applied 10950 place count 1500 transition count 4250
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 10 with 100 rules applied. Total rules applied 11050 place count 1450 transition count 4200
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 10 with 100 rules applied. Total rules applied 11150 place count 1450 transition count 4100
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 11 with 100 rules applied. Total rules applied 11250 place count 1400 transition count 4050
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 11 with 100 rules applied. Total rules applied 11350 place count 1400 transition count 3950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 12 with 100 rules applied. Total rules applied 11450 place count 1350 transition count 3900
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 12 with 100 rules applied. Total rules applied 11550 place count 1350 transition count 3800
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 13 with 100 rules applied. Total rules applied 11650 place count 1300 transition count 3750
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 13 with 100 rules applied. Total rules applied 11750 place count 1300 transition count 3650
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 14 with 100 rules applied. Total rules applied 11850 place count 1250 transition count 3600
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 14 with 100 rules applied. Total rules applied 11950 place count 1250 transition count 3500
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 15 with 100 rules applied. Total rules applied 12050 place count 1200 transition count 3450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 15 with 100 rules applied. Total rules applied 12150 place count 1200 transition count 3350
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 16 with 100 rules applied. Total rules applied 12250 place count 1150 transition count 3300
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 16 with 100 rules applied. Total rules applied 12350 place count 1150 transition count 3200
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 17 with 100 rules applied. Total rules applied 12450 place count 1100 transition count 3150
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 17 with 100 rules applied. Total rules applied 12550 place count 1100 transition count 3050
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 18 with 100 rules applied. Total rules applied 12650 place count 1050 transition count 3000
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 18 with 100 rules applied. Total rules applied 12750 place count 1050 transition count 2900
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 19 with 100 rules applied. Total rules applied 12850 place count 1000 transition count 2850
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 19 with 100 rules applied. Total rules applied 12950 place count 1000 transition count 2750
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 20 with 100 rules applied. Total rules applied 13050 place count 950 transition count 2700
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 20 with 100 rules applied. Total rules applied 13150 place count 950 transition count 2600
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 21 with 100 rules applied. Total rules applied 13250 place count 900 transition count 2550
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 21 with 100 rules applied. Total rules applied 13350 place count 900 transition count 2450
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 22 with 100 rules applied. Total rules applied 13450 place count 850 transition count 2400
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 22 with 100 rules applied. Total rules applied 13550 place count 850 transition count 2300
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 23 with 100 rules applied. Total rules applied 13650 place count 800 transition count 2250
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 23 with 100 rules applied. Total rules applied 13750 place count 800 transition count 2150
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 24 with 100 rules applied. Total rules applied 13850 place count 750 transition count 2100
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 24 with 100 rules applied. Total rules applied 13950 place count 750 transition count 2000
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 25 with 100 rules applied. Total rules applied 14050 place count 700 transition count 1950
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 25 with 100 rules applied. Total rules applied 14150 place count 700 transition count 1850
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 26 with 100 rules applied. Total rules applied 14250 place count 650 transition count 1800
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 26 with 100 rules applied. Total rules applied 14350 place count 650 transition count 1700
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 27 with 100 rules applied. Total rules applied 14450 place count 600 transition count 1650
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 27 with 100 rules applied. Total rules applied 14550 place count 600 transition count 1550
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 28 with 100 rules applied. Total rules applied 14650 place count 550 transition count 1500
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 28 with 100 rules applied. Total rules applied 14750 place count 550 transition count 1400
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 29 with 100 rules applied. Total rules applied 14850 place count 500 transition count 1350
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 29 with 100 rules applied. Total rules applied 14950 place count 500 transition count 1250
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 30 with 100 rules applied. Total rules applied 15050 place count 450 transition count 1200
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 30 with 100 rules applied. Total rules applied 15150 place count 450 transition count 1100
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 31 with 100 rules applied. Total rules applied 15250 place count 400 transition count 1050
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 31 with 100 rules applied. Total rules applied 15350 place count 400 transition count 950
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 32 with 100 rules applied. Total rules applied 15450 place count 350 transition count 900
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 32 with 100 rules applied. Total rules applied 15550 place count 350 transition count 800
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 33 with 100 rules applied. Total rules applied 15650 place count 300 transition count 750
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 33 with 100 rules applied. Total rules applied 15750 place count 300 transition count 650
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 34 with 100 rules applied. Total rules applied 15850 place count 250 transition count 600
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 34 with 100 rules applied. Total rules applied 15950 place count 250 transition count 500
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 35 with 100 rules applied. Total rules applied 16050 place count 200 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 35 with 100 rules applied. Total rules applied 16150 place count 200 transition count 350
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 36 with 100 rules applied. Total rules applied 16250 place count 150 transition count 300
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 36 with 150 rules applied. Total rules applied 16400 place count 150 transition count 150
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 37 with 100 rules applied. Total rules applied 16500 place count 100 transition count 100
Applied a total of 16500 rules in 5392 ms. Remains 100 /6600 variables (removed 6500) and now considering 100/10100 (removed 10000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7596113453899098025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-438271321216061922.kers'
[2026-05-23 18:02:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7596113453899098025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-438271321216061922.kers]
Culling duplicate invariants (modulo rational): removing 50 columns.
Culled 50 columns in 0 ms.
// Phase 1: matrix 100 rows 50 cols 100 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 18:02:05] [INFO ] Computed 50 invariants in 0 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-438271321216061922.kers
Total runtime 1 ms.
[2026-05-23 18:02:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 18:02:06] [INFO ] Invariant cache hit.
[2026-05-23 18:02:06] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2026-05-23 18:02:06] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-23 18:02:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2472 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 100/200 variables, 100/150 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 50/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 200 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4690ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4691ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/6600 places, 100/10100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10289 ms. Remains : 100/6600 places, 100/10100 transitions.
[2026-05-23 18:02:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 18:02:10] [INFO ] Flatten gal took : 3 ms
[2026-05-23 18:02:10] [INFO ] Input system was already deterministic with 100 transitions.
[2026-05-23 18:02:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:02:10] [INFO ] Flatten gal took : 2 ms
[2026-05-23 18:02:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1808694124527710403.gal : 1 ms
[2026-05-23 18:02:10] [INFO ] Time to serialize properties into /tmp/CTLFireability567398122022678812.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/CTLFireability1808694124527710403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability567398122022678812.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,1.1259e+15,0.028672,4336,2,151,5,649,6,0,503,398,0


Converting to forward existential form...Done !
original formula: EG(AG((((((((TrainState_12_0_0==1)||(TrainState_23_0_0==1))||((TrainState_47_0_0==1)||(TrainState_33_0_0==1)))||(((TrainState_19_0_0==1)|...1313
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((((((((TrainState_12_0_0==1)||(TrainState_23_0_0==1))||((TrainState_47_0_0==1)||(TrainSt...1368
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.104732,5460,1,0,6,8617,21,0,2155,549,7
FORMULA BART-PT-050-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Applied a total of 0 rules in 414 ms. Remains 6600 /6600 variables (removed 0) and now considering 10100/10100 (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-8253484279284611069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17776186768496692890.kers'
[2026-05-23 18:02:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8253484279284611069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17776186768496692890.kers]
Culled 0 columns in 12 ms.
// Phase 1: matrix 10100 rows 6600 cols 20200 entries
Finished phase 1 with 6550 SingleSign rule and 0 generalized
[2026-05-23 18:02:11] [INFO ] Computed 50 invariants in 90 ms
Computed 50 P flows in 91 ms.
Exported basis to /tmp/petrispot-output-17776186768496692890.kers
Total runtime 103 ms.
[2026-05-23 18:02:13] [INFO ] Implicit Places using invariants in 2535 ms returned []
Implicit Place search using SMT only with invariants took 2536 ms to find 0 implicit places.
Running 8300 sub problems to find dead transitions.
[2026-05-23 18:02:14] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30146 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 8300/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6550 variables, 6550/6550 constraints. Problems are: Problem set: 0 solved, 8300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6550/16700 variables, and 6550 constraints, problems are : Problem set: 0 solved, 8300 unsolved in 30226 ms.
Refiners :[Domain max(s): 6550/6600 constraints, Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/6600 constraints, PredecessorRefiner: 0/8300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68315ms problems are : Problem set: 0 solved, 8300 unsolved
Search for dead transitions found 0 dead transitions in 68331ms
Finished structural reductions in LTL mode , in 1 iterations and 71306 ms. Remains : 6600/6600 places, 10100/10100 transitions.
[2026-05-23 18:03:22] [INFO ] Flatten gal took : 191 ms
[2026-05-23 18:03:22] [INFO ] Flatten gal took : 220 ms
[2026-05-23 18:03:23] [INFO ] Input system was already deterministic with 10100 transitions.
[2026-05-23 18:03:23] [INFO ] Flatten gal took : 143 ms
[2026-05-23 18:03:23] [INFO ] Flatten gal took : 156 ms
[2026-05-23 18:03:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5442698411070760508.gal : 34 ms
[2026-05-23 18:03:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16497216395716456045.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/CTLFireability5442698411070760508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16497216395716456045.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.
Detected timeout of ITS tools.
[2026-05-23 18:03:53] [INFO ] Flatten gal took : 134 ms
[2026-05-23 18:03:53] [INFO ] Applying decomposition
[2026-05-23 18:03:53] [INFO ] Flatten gal took : 141 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/graph17031845266045863830.txt' '-o' '/tmp/graph17031845266045863830.bin' '-w' '/tmp/graph17031845266045863830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17031845266045863830.bin' '-l' '-1' '-v' '-w' '/tmp/graph17031845266045863830.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:03:54] [INFO ] Decomposing Gal with order
[2026-05-23 18:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:03:58] [INFO ] Removed a total of 823 redundant transitions.
[2026-05-23 18:03:58] [INFO ] Flatten gal took : 323 ms
[2026-05-23 18:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 26 ms.
[2026-05-23 18:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17970376888745208923.gal : 53 ms
[2026-05-23 18:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5046586972605916487.ctl : 11 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/CTLFireability17970376888745208923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5046586972605916487.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,1.06831e+106,13.0919,71396,1725,75,35695,3334,4943,35913,303,2973,0


Converting to forward existential form...Done !
original formula: E(((((((((((!(((((((((((((i17.i0.u139.TrainState_45_1_6==1)||(i36.i2.u503.TrainState_35_1_39==1))||((i25.i0.u108.TrainState_8_1_33==1)||(...216964
=> equivalent forward existential formula: [(FwdU(Init,((((((((((!(((((((((((((i17.i0.u139.TrainState_45_1_6==1)||(i36.i2.u503.TrainState_35_1_39==1))||((i...217016
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,15.2233,72608,1,0,60198,14320,43861,91808,2532,29222,117067
FORMULA BART-PT-050-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1598 places :
Symmetric choice reduction at 0 with 1598 rule applications. Total rules 1598 place count 5002 transition count 8502
Iterating global reduction 0 with 1598 rules applied. Total rules applied 3196 place count 5002 transition count 8502
Discarding 1347 places :
Symmetric choice reduction at 0 with 1347 rule applications. Total rules 4543 place count 3655 transition count 7155
Iterating global reduction 0 with 1347 rules applied. Total rules applied 5890 place count 3655 transition count 7155
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 6088 place count 3457 transition count 6957
Iterating global reduction 0 with 198 rules applied. Total rules applied 6286 place count 3457 transition count 6957
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6435 place count 3308 transition count 6808
Iterating global reduction 0 with 149 rules applied. Total rules applied 6584 place count 3308 transition count 6808
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6733 place count 3159 transition count 6659
Iterating global reduction 0 with 149 rules applied. Total rules applied 6882 place count 3159 transition count 6659
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7031 place count 3010 transition count 6510
Iterating global reduction 0 with 149 rules applied. Total rules applied 7180 place count 3010 transition count 6510
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7329 place count 2861 transition count 6361
Iterating global reduction 0 with 149 rules applied. Total rules applied 7478 place count 2861 transition count 6361
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7627 place count 2712 transition count 6212
Iterating global reduction 0 with 149 rules applied. Total rules applied 7776 place count 2712 transition count 6212
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7875 place count 2613 transition count 6113
Iterating global reduction 0 with 99 rules applied. Total rules applied 7974 place count 2613 transition count 6113
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8073 place count 2514 transition count 6014
Iterating global reduction 0 with 99 rules applied. Total rules applied 8172 place count 2514 transition count 6014
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8222 place count 2464 transition count 5964
Iterating global reduction 0 with 50 rules applied. Total rules applied 8272 place count 2464 transition count 5964
Applied a total of 8272 rules in 4074 ms. Remains 2464 /6600 variables (removed 4136) and now considering 5964/10100 (removed 4136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2477114741095296216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3990087707783049200.kers'
[2026-05-23 18:04:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2477114741095296216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3990087707783049200.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5964 rows 2464 cols 11928 entries
Finished phase 1 with 2414 SingleSign rule and 0 generalized
[2026-05-23 18:04:22] [INFO ] Computed 50 invariants in 24 ms
Computed 50 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3990087707783049200.kers
Total runtime 31 ms.
[2026-05-23 18:04:22] [INFO ] Implicit Places using invariants in 535 ms returned []
[2026-05-23 18:04:22] [INFO ] Invariant cache hit.
[2026-05-23 18:04:25] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 3718 ms to find 0 implicit places.
Running 4164 sub problems to find dead transitions.
[2026-05-23 18:04:25] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2414/8428 variables, and 0 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2464 constraints, PredecessorRefiner: 4164/4164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4164 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2414/8428 variables, and 0 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2464 constraints, PredecessorRefiner: 0/4164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62479ms problems are : Problem set: 0 solved, 4164 unsolved
Search for dead transitions found 0 dead transitions in 62487ms
Starting structural reductions in LTL mode, iteration 1 : 2464/6600 places, 5964/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70286 ms. Remains : 2464/6600 places, 5964/10100 transitions.
[2026-05-23 18:05:28] [INFO ] Flatten gal took : 109 ms
[2026-05-23 18:05:28] [INFO ] Flatten gal took : 118 ms
[2026-05-23 18:05:28] [INFO ] Input system was already deterministic with 5964 transitions.
[2026-05-23 18:05:28] [INFO ] Flatten gal took : 111 ms
[2026-05-23 18:05:28] [INFO ] Flatten gal took : 102 ms
[2026-05-23 18:05:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11230933180002684183.gal : 20 ms
[2026-05-23 18:05:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17997595588120423193.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/CTLFireability11230933180002684183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17997595588120423193.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.22067e+84,15.5461,88988,2,4879,5,38764,6,0,15823,21037,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:05:59] [INFO ] Flatten gal took : 64 ms
[2026-05-23 18:05:59] [INFO ] Applying decomposition
[2026-05-23 18:05:59] [INFO ] Flatten gal took : 67 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/graph731357030342995287.txt' '-o' '/tmp/graph731357030342995287.bin' '-w' '/tmp/graph731357030342995287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph731357030342995287.bin' '-l' '-1' '-v' '-w' '/tmp/graph731357030342995287.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:05:59] [INFO ] Decomposing Gal with order
[2026-05-23 18:05:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:05:59] [INFO ] Removed a total of 1924 redundant transitions.
[2026-05-23 18:05:59] [INFO ] Flatten gal took : 132 ms
[2026-05-23 18:05:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1073 labels/synchronizations in 20 ms.
[2026-05-23 18:05:59] [INFO ] Time to serialize gal into /tmp/CTLFireability13524977709837226104.gal : 31 ms
[2026-05-23 18:05:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11482871737422211890.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/CTLFireability13524977709837226104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11482871737422211890.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 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.22067e+84,2.42482,31404,239,25,1509,849,865,913,156,1353,0


Converting to forward existential form...Done !
original formula: A((!((A(AG((i21.u77.TrainState_42_0_0==1)) U !(((i5.u412.TrainState_31_1_30==1)||(i44.u224.TrainState_1_3_14==1)))) + !(((i9.u82.TrainSta...552
=> equivalent forward existential formula: [((Init * !(EG(!(EG((i14.u362.TrainState_35_1_28!=1)))))) * !(E(!(EG((i14.u362.TrainState_35_1_28!=1))) U (!((!(...886
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,1,2.88745,31728,1,0,28916,2394,4343,88363,650,3810,42984
FORMULA BART-PT-050-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Graph (trivial) has 10061 edges and 6600 vertex of which 6465 / 6600 are part of one of the 49 SCC in 5 ms
Free SCC test removed 6416 places
Ensure Unique test removed 9845 transitions
Reduce isomorphic transitions removed 9845 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 136 transition count 143
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 179 place count 71 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 70 transition count 142
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 180 place count 70 transition count 137
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 190 place count 65 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 196 place count 59 transition count 131
Iterating global reduction 3 with 6 rules applied. Total rules applied 202 place count 59 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 59 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 207 place count 55 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 211 place count 55 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 52 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 52 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 220 place count 49 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 223 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 225 place count 47 transition count 118
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 47 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 45 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 45 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 44 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 44 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 245 place count 38 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 38 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 249 place count 37 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 251 place count 37 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 253 place count 36 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 255 place count 36 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 257 place count 35 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 259 place count 35 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 261 place count 34 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 263 place count 34 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 265 place count 33 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 267 place count 33 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 269 place count 32 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 271 place count 32 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 273 place count 31 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 275 place count 31 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 277 place count 30 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 279 place count 30 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 281 place count 29 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 283 place count 29 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 285 place count 28 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 287 place count 28 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 289 place count 27 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 291 place count 27 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 293 place count 26 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 295 place count 26 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 297 place count 25 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 299 place count 25 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 301 place count 24 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 303 place count 24 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 305 place count 23 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 307 place count 23 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 309 place count 22 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 311 place count 22 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 313 place count 21 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 315 place count 21 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 317 place count 20 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 319 place count 20 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 321 place count 19 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 323 place count 19 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 325 place count 18 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 327 place count 18 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 329 place count 17 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 331 place count 17 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 333 place count 16 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 335 place count 16 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 337 place count 15 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 339 place count 15 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 341 place count 14 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 343 place count 14 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 345 place count 13 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 347 place count 13 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 349 place count 12 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 351 place count 12 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 353 place count 11 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 355 place count 11 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 357 place count 10 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 359 place count 10 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 361 place count 9 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 363 place count 9 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 365 place count 8 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 367 place count 8 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 369 place count 7 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 371 place count 7 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 373 place count 6 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 375 place count 6 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 377 place count 5 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 37 with 3 rules applied. Total rules applied 380 place count 5 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 382 place count 4 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 39 with 1 rules applied. Total rules applied 383 place count 4 transition count 5
Applied a total of 383 rules in 87 ms. Remains 4 /6600 variables (removed 6596) and now considering 5/10100 (removed 10095) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16139760119040641982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2905844311900998217.kers'
[2026-05-23 18:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16139760119040641982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2905844311900998217.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 18:06:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2905844311900998217.kers
Total runtime 2 ms.
[2026-05-23 18:06:02] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 18:06:02] [INFO ] Invariant cache hit.
[2026-05-23 18:06:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-23 18:06:02] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 18:06:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/6600 places, 5/10100 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 4/6600 places, 5/10100 transitions.
[2026-05-23 18:06:02] [INFO ] Flatten gal took : 1 ms
[2026-05-23 18:06:02] [INFO ] Flatten gal took : 0 ms
[2026-05-23 18:06:02] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-23 18:06:02] [INFO ] Flatten gal took : 0 ms
[2026-05-23 18:06:02] [INFO ] Flatten gal took : 0 ms
[2026-05-23 18:06:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13130013394026329003.gal : 0 ms
[2026-05-23 18:06:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2008742728905238572.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/CTLFireability13130013394026329003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2008742728905238572.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((EG((TrainState_43_0_0==0)) + (TrainState_16_2_38==1)))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(TrainState_43_0_0==0))] != FALSE + [(FwdU(Init,TRUE) * (TrainState_16_2_38==1))] != FALS...157
Hit Full ! (commute/partial/dont) 2/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.00406,4012,1,0,6,48,18,0,94,32,8
FORMULA BART-PT-050-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1596 places :
Symmetric choice reduction at 0 with 1596 rule applications. Total rules 1596 place count 5004 transition count 8504
Iterating global reduction 0 with 1596 rules applied. Total rules applied 3192 place count 5004 transition count 8504
Discarding 1345 places :
Symmetric choice reduction at 0 with 1345 rule applications. Total rules 4537 place count 3659 transition count 7159
Iterating global reduction 0 with 1345 rules applied. Total rules applied 5882 place count 3659 transition count 7159
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6082 place count 3459 transition count 6959
Iterating global reduction 0 with 200 rules applied. Total rules applied 6282 place count 3459 transition count 6959
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6432 place count 3309 transition count 6809
Iterating global reduction 0 with 150 rules applied. Total rules applied 6582 place count 3309 transition count 6809
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6731 place count 3160 transition count 6660
Iterating global reduction 0 with 149 rules applied. Total rules applied 6880 place count 3160 transition count 6660
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7029 place count 3011 transition count 6511
Iterating global reduction 0 with 149 rules applied. Total rules applied 7178 place count 3011 transition count 6511
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7327 place count 2862 transition count 6362
Iterating global reduction 0 with 149 rules applied. Total rules applied 7476 place count 2862 transition count 6362
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7625 place count 2713 transition count 6213
Iterating global reduction 0 with 149 rules applied. Total rules applied 7774 place count 2713 transition count 6213
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7874 place count 2613 transition count 6113
Iterating global reduction 0 with 100 rules applied. Total rules applied 7974 place count 2613 transition count 6113
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8073 place count 2514 transition count 6014
Iterating global reduction 0 with 99 rules applied. Total rules applied 8172 place count 2514 transition count 6014
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8222 place count 2464 transition count 5964
Iterating global reduction 0 with 50 rules applied. Total rules applied 8272 place count 2464 transition count 5964
Applied a total of 8272 rules in 5053 ms. Remains 2464 /6600 variables (removed 4136) and now considering 5964/10100 (removed 4136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7535267915037641260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3420909103637323937.kers'
[2026-05-23 18:06:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7535267915037641260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3420909103637323937.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 5964 rows 2464 cols 11928 entries
Finished phase 1 with 2414 SingleSign rule and 0 generalized
[2026-05-23 18:06:08] [INFO ] Computed 50 invariants in 36 ms
Computed 50 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-3420909103637323937.kers
Total runtime 45 ms.
[2026-05-23 18:06:08] [INFO ] Implicit Places using invariants in 639 ms returned []
[2026-05-23 18:06:08] [INFO ] Invariant cache hit.
[2026-05-23 18:06:11] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 3829 ms to find 0 implicit places.
Running 4164 sub problems to find dead transitions.
[2026-05-23 18:06:11] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2414/8428 variables, and 0 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2464 constraints, PredecessorRefiner: 4164/4164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2414/8428 variables, and 0 constraints, problems are : Problem set: 0 solved, 4164 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2464 constraints, PredecessorRefiner: 0/4164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62402ms problems are : Problem set: 0 solved, 4164 unsolved
Search for dead transitions found 0 dead transitions in 62407ms
Starting structural reductions in LTL mode, iteration 1 : 2464/6600 places, 5964/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71297 ms. Remains : 2464/6600 places, 5964/10100 transitions.
[2026-05-23 18:07:14] [INFO ] Flatten gal took : 105 ms
[2026-05-23 18:07:14] [INFO ] Flatten gal took : 112 ms
[2026-05-23 18:07:14] [INFO ] Input system was already deterministic with 5964 transitions.
[2026-05-23 18:07:14] [INFO ] Flatten gal took : 107 ms
[2026-05-23 18:07:14] [INFO ] Flatten gal took : 75 ms
[2026-05-23 18:07:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8799111782093883309.gal : 19 ms
[2026-05-23 18:07:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4497145090547188637.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/CTLFireability8799111782093883309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4497145090547188637.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,4.25892e+84,16.2485,89032,2,5267,5,44941,6,0,15823,23926,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:07:45] [INFO ] Flatten gal took : 107 ms
[2026-05-23 18:07:45] [INFO ] Applying decomposition
[2026-05-23 18:07:45] [INFO ] Flatten gal took : 109 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/graph16932171921587482908.txt' '-o' '/tmp/graph16932171921587482908.bin' '-w' '/tmp/graph16932171921587482908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16932171921587482908.bin' '-l' '-1' '-v' '-w' '/tmp/graph16932171921587482908.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:07:45] [INFO ] Decomposing Gal with order
[2026-05-23 18:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:07:46] [INFO ] Removed a total of 1927 redundant transitions.
[2026-05-23 18:07:46] [INFO ] Flatten gal took : 221 ms
[2026-05-23 18:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 1056 labels/synchronizations in 23 ms.
[2026-05-23 18:07:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1302010009189892464.gal : 38 ms
[2026-05-23 18:07:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7802846965082423294.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/CTLFireability1302010009189892464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7802846965082423294.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,4.25892e+84,2.12034,31468,239,33,1649,1007,874,1116,176,1655,0


Converting to forward existential form...Done !
original formula: !(E(!((((i14.u273.TrainState_2_4_19==1) * E(EG((i14.u131.TrainState_2_1_13==1)) U ((i4.u472.TrainState_26_3_33==1)&&(i5.u15.TrainState_34...447
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((((i14.u273.TrainState_2_4_19==1) * E(EG((i14.u131.TrainState_2_1_13==1)) U ((i4.u472.TrainSta...505
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,0,2.38761,31752,1,0,4562,3054,5616,4110,872,4116,16632
FORMULA BART-PT-050-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1599 places :
Symmetric choice reduction at 0 with 1599 rule applications. Total rules 1599 place count 5001 transition count 8501
Iterating global reduction 0 with 1599 rules applied. Total rules applied 3198 place count 5001 transition count 8501
Discarding 1349 places :
Symmetric choice reduction at 0 with 1349 rule applications. Total rules 4547 place count 3652 transition count 7152
Iterating global reduction 0 with 1349 rules applied. Total rules applied 5896 place count 3652 transition count 7152
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 6095 place count 3453 transition count 6953
Iterating global reduction 0 with 199 rules applied. Total rules applied 6294 place count 3453 transition count 6953
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6443 place count 3304 transition count 6804
Iterating global reduction 0 with 149 rules applied. Total rules applied 6592 place count 3304 transition count 6804
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 6741 place count 3155 transition count 6655
Iterating global reduction 0 with 149 rules applied. Total rules applied 6890 place count 3155 transition count 6655
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7039 place count 3006 transition count 6506
Iterating global reduction 0 with 149 rules applied. Total rules applied 7188 place count 3006 transition count 6506
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7337 place count 2857 transition count 6357
Iterating global reduction 0 with 149 rules applied. Total rules applied 7486 place count 2857 transition count 6357
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 7635 place count 2708 transition count 6208
Iterating global reduction 0 with 149 rules applied. Total rules applied 7784 place count 2708 transition count 6208
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 7883 place count 2609 transition count 6109
Iterating global reduction 0 with 99 rules applied. Total rules applied 7982 place count 2609 transition count 6109
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 8081 place count 2510 transition count 6010
Iterating global reduction 0 with 99 rules applied. Total rules applied 8180 place count 2510 transition count 6010
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 8229 place count 2461 transition count 5961
Iterating global reduction 0 with 49 rules applied. Total rules applied 8278 place count 2461 transition count 5961
Applied a total of 8278 rules in 5075 ms. Remains 2461 /6600 variables (removed 4139) and now considering 5961/10100 (removed 4139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7673692737176523215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17945982018188473381.kers'
[2026-05-23 18:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7673692737176523215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17945982018188473381.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5961 rows 2461 cols 11922 entries
Finished phase 1 with 2411 SingleSign rule and 0 generalized
[2026-05-23 18:07:53] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-17945982018188473381.kers
Total runtime 30 ms.
[2026-05-23 18:07:54] [INFO ] Implicit Places using invariants in 692 ms returned []
[2026-05-23 18:07:54] [INFO ] Invariant cache hit.
[2026-05-23 18:07:57] [INFO ] Implicit Places using invariants and state equation in 3131 ms returned []
Implicit Place search using SMT with State Equation took 3826 ms to find 0 implicit places.
Running 4161 sub problems to find dead transitions.
[2026-05-23 18:07:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2411/8422 variables, and 0 constraints, problems are : Problem set: 0 solved, 4161 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2461 constraints, PredecessorRefiner: 4161/4161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2411/8422 variables, and 0 constraints, problems are : Problem set: 0 solved, 4161 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2461 constraints, PredecessorRefiner: 0/4161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62431ms problems are : Problem set: 0 solved, 4161 unsolved
Search for dead transitions found 0 dead transitions in 62437ms
Starting structural reductions in LTL mode, iteration 1 : 2461/6600 places, 5961/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71347 ms. Remains : 2461/6600 places, 5961/10100 transitions.
[2026-05-23 18:09:00] [INFO ] Flatten gal took : 103 ms
[2026-05-23 18:09:00] [INFO ] Flatten gal took : 110 ms
[2026-05-23 18:09:00] [INFO ] Input system was already deterministic with 5961 transitions.
[2026-05-23 18:09:00] [INFO ] Flatten gal took : 108 ms
[2026-05-23 18:09:00] [INFO ] Flatten gal took : 109 ms
[2026-05-23 18:09:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14815482638744356474.gal : 31 ms
[2026-05-23 18:09:00] [INFO ] Time to serialize properties into /tmp/CTLFireability637636440048719398.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/CTLFireability14815482638744356474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability637636440048719398.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,3.96058e+84,17.0192,89000,2,4873,5,38594,6,0,15808,20848,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:09:30] [INFO ] Flatten gal took : 68 ms
[2026-05-23 18:09:30] [INFO ] Applying decomposition
[2026-05-23 18:09:31] [INFO ] Flatten gal took : 70 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/graph6270383177986197146.txt' '-o' '/tmp/graph6270383177986197146.bin' '-w' '/tmp/graph6270383177986197146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6270383177986197146.bin' '-l' '-1' '-v' '-w' '/tmp/graph6270383177986197146.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:09:31] [INFO ] Decomposing Gal with order
[2026-05-23 18:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:09:31] [INFO ] Removed a total of 1898 redundant transitions.
[2026-05-23 18:09:31] [INFO ] Flatten gal took : 137 ms
[2026-05-23 18:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1085 labels/synchronizations in 15 ms.
[2026-05-23 18:09:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15831720471160837464.gal : 27 ms
[2026-05-23 18:09:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5815681587093936886.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/CTLFireability15831720471160837464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5815681587093936886.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,3.96058e+84,2.12148,31356,194,33,1161,1095,720,708,182,1699,0


Converting to forward existential form...Done !
original formula: EF(AX((i48.u84.TrainState_49_2_4==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i48.u84.TrainState_49_2_4==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.19726,31620,1,0,1411,1095,1947,765,624,1699,4598
FORMULA BART-PT-050-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6100 place count 3450 transition count 6950
Iterating global reduction 0 with 200 rules applied. Total rules applied 6300 place count 3450 transition count 6950
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6450 place count 3300 transition count 6800
Iterating global reduction 0 with 150 rules applied. Total rules applied 6600 place count 3300 transition count 6800
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6750 place count 3150 transition count 6650
Iterating global reduction 0 with 150 rules applied. Total rules applied 6900 place count 3150 transition count 6650
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7050 place count 3000 transition count 6500
Iterating global reduction 0 with 150 rules applied. Total rules applied 7200 place count 3000 transition count 6500
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7350 place count 2850 transition count 6350
Iterating global reduction 0 with 150 rules applied. Total rules applied 7500 place count 2850 transition count 6350
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7650 place count 2700 transition count 6200
Iterating global reduction 0 with 150 rules applied. Total rules applied 7800 place count 2700 transition count 6200
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7900 place count 2600 transition count 6100
Iterating global reduction 0 with 100 rules applied. Total rules applied 8000 place count 2600 transition count 6100
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8100 place count 2500 transition count 6000
Iterating global reduction 0 with 100 rules applied. Total rules applied 8200 place count 2500 transition count 6000
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8250 place count 2450 transition count 5950
Iterating global reduction 0 with 50 rules applied. Total rules applied 8300 place count 2450 transition count 5950
Applied a total of 8300 rules in 4449 ms. Remains 2450 /6600 variables (removed 4150) and now considering 5950/10100 (removed 4150) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7964120745508517547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11943593064007479298.kers'
[2026-05-23 18:09:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7964120745508517547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11943593064007479298.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5950 rows 2450 cols 11900 entries
Finished phase 1 with 2400 SingleSign rule and 0 generalized
[2026-05-23 18:09:38] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-11943593064007479298.kers
Total runtime 31 ms.
[2026-05-23 18:09:39] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-23 18:09:39] [INFO ] Invariant cache hit.
[2026-05-23 18:09:42] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 3667 ms to find 0 implicit places.
Running 4150 sub problems to find dead transitions.
[2026-05-23 18:09:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 4150/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4150 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2400/8400 variables, and 0 constraints, problems are : Problem set: 0 solved, 4150 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2450 constraints, PredecessorRefiner: 0/4150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62642ms problems are : Problem set: 0 solved, 4150 unsolved
Search for dead transitions found 0 dead transitions in 62661ms
Starting structural reductions in LTL mode, iteration 1 : 2450/6600 places, 5950/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70788 ms. Remains : 2450/6600 places, 5950/10100 transitions.
[2026-05-23 18:10:44] [INFO ] Flatten gal took : 100 ms
[2026-05-23 18:10:45] [INFO ] Flatten gal took : 108 ms
[2026-05-23 18:10:45] [INFO ] Input system was already deterministic with 5950 transitions.
[2026-05-23 18:10:45] [INFO ] Flatten gal took : 104 ms
[2026-05-23 18:10:45] [INFO ] Flatten gal took : 79 ms
[2026-05-23 18:10:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16894286300983361174.gal : 17 ms
[2026-05-23 18:10:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15868535216569476237.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/CTLFireability16894286300983361174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15868535216569476237.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,3.23448e+84,16.7817,88492,2,4858,5,38291,6,0,15753,20646,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:11:15] [INFO ] Flatten gal took : 60 ms
[2026-05-23 18:11:15] [INFO ] Applying decomposition
[2026-05-23 18:11:15] [INFO ] Flatten gal took : 64 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/graph16897212126204181730.txt' '-o' '/tmp/graph16897212126204181730.bin' '-w' '/tmp/graph16897212126204181730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16897212126204181730.bin' '-l' '-1' '-v' '-w' '/tmp/graph16897212126204181730.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:11:15] [INFO ] Decomposing Gal with order
[2026-05-23 18:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:11:16] [INFO ] Removed a total of 1874 redundant transitions.
[2026-05-23 18:11:16] [INFO ] Flatten gal took : 177 ms
[2026-05-23 18:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1091 labels/synchronizations in 13 ms.
[2026-05-23 18:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4342855218167330484.gal : 24 ms
[2026-05-23 18:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7734366441690781752.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/CTLFireability4342855218167330484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7734366441690781752.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,3.23448e+84,2.15583,31252,174,27,1001,879,631,586,154,1419,0


Converting to forward existential form...Done !
original formula: AF(AX((i30.u183.TrainState_32_1_16==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i30.u183.TrainState_32_1_16==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,0,2.7631,31520,1,0,58443,1368,2197,51384,574,3260,32668
FORMULA BART-PT-050-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1596 places :
Symmetric choice reduction at 0 with 1596 rule applications. Total rules 1596 place count 5004 transition count 8504
Iterating global reduction 0 with 1596 rules applied. Total rules applied 3192 place count 5004 transition count 8504
Discarding 1346 places :
Symmetric choice reduction at 0 with 1346 rule applications. Total rules 4538 place count 3658 transition count 7158
Iterating global reduction 0 with 1346 rules applied. Total rules applied 5884 place count 3658 transition count 7158
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 6081 place count 3461 transition count 6961
Iterating global reduction 0 with 197 rules applied. Total rules applied 6278 place count 3461 transition count 6961
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6426 place count 3313 transition count 6813
Iterating global reduction 0 with 148 rules applied. Total rules applied 6574 place count 3313 transition count 6813
Discarding 148 places :
Symmetric choice reduction at 0 with 148 rule applications. Total rules 6722 place count 3165 transition count 6665
Iterating global reduction 0 with 148 rules applied. Total rules applied 6870 place count 3165 transition count 6665
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 7017 place count 3018 transition count 6518
Iterating global reduction 0 with 147 rules applied. Total rules applied 7164 place count 3018 transition count 6518
Discarding 147 places :
Symmetric choice reduction at 0 with 147 rule applications. Total rules 7311 place count 2871 transition count 6371
Iterating global reduction 0 with 147 rules applied. Total rules applied 7458 place count 2871 transition count 6371
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 7604 place count 2725 transition count 6225
Iterating global reduction 0 with 146 rules applied. Total rules applied 7750 place count 2725 transition count 6225
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 7847 place count 2628 transition count 6128
Iterating global reduction 0 with 97 rules applied. Total rules applied 7944 place count 2628 transition count 6128
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 8040 place count 2532 transition count 6032
Iterating global reduction 0 with 96 rules applied. Total rules applied 8136 place count 2532 transition count 6032
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8186 place count 2482 transition count 5982
Iterating global reduction 0 with 50 rules applied. Total rules applied 8236 place count 2482 transition count 5982
Applied a total of 8236 rules in 4560 ms. Remains 2482 /6600 variables (removed 4118) and now considering 5982/10100 (removed 4118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18132323239432330033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-24506913149757124.kers'
[2026-05-23 18:11:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18132323239432330033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-24506913149757124.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5982 rows 2482 cols 11964 entries
Finished phase 1 with 2432 SingleSign rule and 0 generalized
[2026-05-23 18:11:23] [INFO ] Computed 50 invariants in 24 ms
Computed 50 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-24506913149757124.kers
Total runtime 30 ms.
[2026-05-23 18:11:24] [INFO ] Implicit Places using invariants in 534 ms returned []
[2026-05-23 18:11:24] [INFO ] Invariant cache hit.
[2026-05-23 18:11:27] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 3215 ms to find 0 implicit places.
Running 4182 sub problems to find dead transitions.
[2026-05-23 18:11:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2432/8464 variables, and 0 constraints, problems are : Problem set: 0 solved, 4182 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2482 constraints, PredecessorRefiner: 4182/4182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2432/8464 variables, and 0 constraints, problems are : Problem set: 0 solved, 4182 unsolved in 30132 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2482 constraints, PredecessorRefiner: 0/4182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62578ms problems are : Problem set: 0 solved, 4182 unsolved
Search for dead transitions found 0 dead transitions in 62592ms
Starting structural reductions in LTL mode, iteration 1 : 2482/6600 places, 5982/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70379 ms. Remains : 2482/6600 places, 5982/10100 transitions.
[2026-05-23 18:12:29] [INFO ] Flatten gal took : 99 ms
[2026-05-23 18:12:29] [INFO ] Flatten gal took : 105 ms
[2026-05-23 18:12:30] [INFO ] Input system was already deterministic with 5982 transitions.
[2026-05-23 18:12:30] [INFO ] Flatten gal took : 102 ms
[2026-05-23 18:12:30] [INFO ] Flatten gal took : 105 ms
[2026-05-23 18:12:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4325377890507008547.gal : 28 ms
[2026-05-23 18:12:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13536233721199795581.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/CTLFireability4325377890507008547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13536233721199795581.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,5.91908e+84,16.3545,89908,2,4915,5,39187,6,0,15913,21427,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:13:00] [INFO ] Flatten gal took : 62 ms
[2026-05-23 18:13:00] [INFO ] Applying decomposition
[2026-05-23 18:13:00] [INFO ] Flatten gal took : 65 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/graph10818980751095490399.txt' '-o' '/tmp/graph10818980751095490399.bin' '-w' '/tmp/graph10818980751095490399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10818980751095490399.bin' '-l' '-1' '-v' '-w' '/tmp/graph10818980751095490399.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:13:00] [INFO ] Decomposing Gal with order
[2026-05-23 18:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:13:01] [INFO ] Removed a total of 1972 redundant transitions.
[2026-05-23 18:13:01] [INFO ] Flatten gal took : 134 ms
[2026-05-23 18:13:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1040 labels/synchronizations in 13 ms.
[2026-05-23 18:13:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6979505283499435671.gal : 26 ms
[2026-05-23 18:13:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12608829280678669983.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/CTLFireability6979505283499435671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12608829280678669983.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,5.91908e+84,2.07989,31620,283,27,1899,955,1021,1227,169,1465,0


Converting to forward existential form...Done !
original formula: (AX(A(!((E((i49.u389.TrainState_5_4_25==1) U (i22.u241.TrainState_33_1_17==1)) * !(((i26.u227.TrainState_20_0_0==1)||(i15.u42.TrainState_...457
=> equivalent forward existential formula: ([(FwdU(((FwdU(EY((Init * !(E(TRUE U ((((((i17.u112.TrainState_24_0_0!=1)&&(i29.u452.TrainState_25_1_34!=1))||(i...876
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,1,2.26949,31896,1,0,3076,2351,4773,2033,711,2445,10922
FORMULA BART-PT-050-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1600 places :
Symmetric choice reduction at 0 with 1600 rule applications. Total rules 1600 place count 5000 transition count 8500
Iterating global reduction 0 with 1600 rules applied. Total rules applied 3200 place count 5000 transition count 8500
Discarding 1350 places :
Symmetric choice reduction at 0 with 1350 rule applications. Total rules 4550 place count 3650 transition count 7150
Iterating global reduction 0 with 1350 rules applied. Total rules applied 5900 place count 3650 transition count 7150
Discarding 199 places :
Symmetric choice reduction at 0 with 199 rule applications. Total rules 6099 place count 3451 transition count 6951
Iterating global reduction 0 with 199 rules applied. Total rules applied 6298 place count 3451 transition count 6951
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6448 place count 3301 transition count 6801
Iterating global reduction 0 with 150 rules applied. Total rules applied 6598 place count 3301 transition count 6801
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6748 place count 3151 transition count 6651
Iterating global reduction 0 with 150 rules applied. Total rules applied 6898 place count 3151 transition count 6651
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7048 place count 3001 transition count 6501
Iterating global reduction 0 with 150 rules applied. Total rules applied 7198 place count 3001 transition count 6501
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7348 place count 2851 transition count 6351
Iterating global reduction 0 with 150 rules applied. Total rules applied 7498 place count 2851 transition count 6351
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7648 place count 2701 transition count 6201
Iterating global reduction 0 with 150 rules applied. Total rules applied 7798 place count 2701 transition count 6201
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7898 place count 2601 transition count 6101
Iterating global reduction 0 with 100 rules applied. Total rules applied 7998 place count 2601 transition count 6101
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8098 place count 2501 transition count 6001
Iterating global reduction 0 with 100 rules applied. Total rules applied 8198 place count 2501 transition count 6001
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8248 place count 2451 transition count 5951
Iterating global reduction 0 with 50 rules applied. Total rules applied 8298 place count 2451 transition count 5951
Applied a total of 8298 rules in 4393 ms. Remains 2451 /6600 variables (removed 4149) and now considering 5951/10100 (removed 4149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-850972983392556053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4579338361735365806.kers'
[2026-05-23 18:13:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-850972983392556053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4579338361735365806.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 5951 rows 2451 cols 11902 entries
Finished phase 1 with 2401 SingleSign rule and 0 generalized
[2026-05-23 18:13:07] [INFO ] Computed 50 invariants in 38 ms
Computed 50 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-4579338361735365806.kers
Total runtime 50 ms.
[2026-05-23 18:13:08] [INFO ] Implicit Places using invariants in 515 ms returned []
[2026-05-23 18:13:08] [INFO ] Invariant cache hit.
[2026-05-23 18:13:11] [INFO ] Implicit Places using invariants and state equation in 2977 ms returned []
Implicit Place search using SMT with State Equation took 3493 ms to find 0 implicit places.
Running 4151 sub problems to find dead transitions.
[2026-05-23 18:13:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2401/8402 variables, and 0 constraints, problems are : Problem set: 0 solved, 4151 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2451 constraints, PredecessorRefiner: 4151/4151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4151 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2401/8402 variables, and 0 constraints, problems are : Problem set: 0 solved, 4151 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2451 constraints, PredecessorRefiner: 0/4151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62131ms problems are : Problem set: 0 solved, 4151 unsolved
Search for dead transitions found 0 dead transitions in 62135ms
Starting structural reductions in LTL mode, iteration 1 : 2451/6600 places, 5951/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70026 ms. Remains : 2451/6600 places, 5951/10100 transitions.
[2026-05-23 18:14:13] [INFO ] Flatten gal took : 101 ms
[2026-05-23 18:14:13] [INFO ] Flatten gal took : 108 ms
[2026-05-23 18:14:13] [INFO ] Input system was already deterministic with 5951 transitions.
[2026-05-23 18:14:14] [INFO ] Flatten gal took : 96 ms
[2026-05-23 18:14:14] [INFO ] Flatten gal took : 101 ms
[2026-05-23 18:14:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8966816403488394258.gal : 27 ms
[2026-05-23 18:14:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1974966790455473390.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/CTLFireability8966816403488394258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1974966790455473390.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,3.30049e+84,16.3964,88484,2,4862,5,38392,6,0,15758,20687,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:14:44] [INFO ] Flatten gal took : 64 ms
[2026-05-23 18:14:44] [INFO ] Applying decomposition
[2026-05-23 18:14:44] [INFO ] Flatten gal took : 69 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/graph14504710371505023877.txt' '-o' '/tmp/graph14504710371505023877.bin' '-w' '/tmp/graph14504710371505023877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14504710371505023877.bin' '-l' '-1' '-v' '-w' '/tmp/graph14504710371505023877.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:14:44] [INFO ] Decomposing Gal with order
[2026-05-23 18:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:14:44] [INFO ] Removed a total of 1910 redundant transitions.
[2026-05-23 18:14:45] [INFO ] Flatten gal took : 144 ms
[2026-05-23 18:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1067 labels/synchronizations in 15 ms.
[2026-05-23 18:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11186811206469994879.gal : 28 ms
[2026-05-23 18:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17304462407185936688.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/CTLFireability11186811206469994879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17304462407185936688.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 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,3.30049e+84,2.35996,31328,189,27,1129,710,676,681,146,1102,0


Converting to forward existential form...Done !
original formula: AF((AX((i33.u366.TrainState_48_1_29==1)) * EX(AF(((i5.u227.TrainState_24_2_16==0)&&(i28.u349.TrainState_4_1_26==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((i33.u366.TrainState_48_1_29==1)))) * EX(!(EG(!(((i5.u227.TrainState_24_2_16==0)&&(i28.u349...194
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,0,2.55627,31596,1,0,2592,1196,3508,2141,652,2309,10329
FORMULA BART-PT-050-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 6600/6600 places, 10100/10100 transitions.
Discarding 1597 places :
Symmetric choice reduction at 0 with 1597 rule applications. Total rules 1597 place count 5003 transition count 8503
Iterating global reduction 0 with 1597 rules applied. Total rules applied 3194 place count 5003 transition count 8503
Discarding 1347 places :
Symmetric choice reduction at 0 with 1347 rule applications. Total rules 4541 place count 3656 transition count 7156
Iterating global reduction 0 with 1347 rules applied. Total rules applied 5888 place count 3656 transition count 7156
Discarding 200 places :
Symmetric choice reduction at 0 with 200 rule applications. Total rules 6088 place count 3456 transition count 6956
Iterating global reduction 0 with 200 rules applied. Total rules applied 6288 place count 3456 transition count 6956
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6438 place count 3306 transition count 6806
Iterating global reduction 0 with 150 rules applied. Total rules applied 6588 place count 3306 transition count 6806
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 6738 place count 3156 transition count 6656
Iterating global reduction 0 with 150 rules applied. Total rules applied 6888 place count 3156 transition count 6656
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7038 place count 3006 transition count 6506
Iterating global reduction 0 with 150 rules applied. Total rules applied 7188 place count 3006 transition count 6506
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7338 place count 2856 transition count 6356
Iterating global reduction 0 with 150 rules applied. Total rules applied 7488 place count 2856 transition count 6356
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 7638 place count 2706 transition count 6206
Iterating global reduction 0 with 150 rules applied. Total rules applied 7788 place count 2706 transition count 6206
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 7888 place count 2606 transition count 6106
Iterating global reduction 0 with 100 rules applied. Total rules applied 7988 place count 2606 transition count 6106
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 8088 place count 2506 transition count 6006
Iterating global reduction 0 with 100 rules applied. Total rules applied 8188 place count 2506 transition count 6006
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 8238 place count 2456 transition count 5956
Iterating global reduction 0 with 50 rules applied. Total rules applied 8288 place count 2456 transition count 5956
Applied a total of 8288 rules in 4505 ms. Remains 2456 /6600 variables (removed 4144) and now considering 5956/10100 (removed 4144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10885210684593805885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15604544550411421871.kers'
[2026-05-23 18:14:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10885210684593805885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15604544550411421871.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 5956 rows 2456 cols 11912 entries
Finished phase 1 with 2406 SingleSign rule and 0 generalized
[2026-05-23 18:14:52] [INFO ] Computed 50 invariants in 25 ms
Computed 50 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-15604544550411421871.kers
Total runtime 32 ms.
[2026-05-23 18:14:52] [INFO ] Implicit Places using invariants in 651 ms returned []
[2026-05-23 18:14:52] [INFO ] Invariant cache hit.
[2026-05-23 18:14:55] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
Running 4156 sub problems to find dead transitions.
[2026-05-23 18:14:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2406/8412 variables, and 0 constraints, problems are : Problem set: 0 solved, 4156 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2456 constraints, PredecessorRefiner: 4156/4156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4156 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2406/8412 variables, and 0 constraints, problems are : Problem set: 0 solved, 4156 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/2456 constraints, PredecessorRefiner: 0/4156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62323ms problems are : Problem set: 0 solved, 4156 unsolved
Search for dead transitions found 0 dead transitions in 62334ms
Starting structural reductions in LTL mode, iteration 1 : 2456/6600 places, 5956/10100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70478 ms. Remains : 2456/6600 places, 5956/10100 transitions.
[2026-05-23 18:15:58] [INFO ] Flatten gal took : 67 ms
[2026-05-23 18:15:58] [INFO ] Flatten gal took : 72 ms
[2026-05-23 18:15:58] [INFO ] Input system was already deterministic with 5956 transitions.
[2026-05-23 18:15:58] [INFO ] Flatten gal took : 60 ms
[2026-05-23 18:15:58] [INFO ] Flatten gal took : 63 ms
[2026-05-23 18:15:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2528884116395191546.gal : 18 ms
[2026-05-23 18:15:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16445156783308240782.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/CTLFireability2528884116395191546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16445156783308240782.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,3.64692e+84,15.9035,88712,2,4863,5,38566,6,0,15783,20828,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 18:16:28] [INFO ] Flatten gal took : 61 ms
[2026-05-23 18:16:28] [INFO ] Applying decomposition
[2026-05-23 18:16:28] [INFO ] Flatten gal took : 64 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/graph15925314174023771718.txt' '-o' '/tmp/graph15925314174023771718.bin' '-w' '/tmp/graph15925314174023771718.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15925314174023771718.bin' '-l' '-1' '-v' '-w' '/tmp/graph15925314174023771718.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:16:28] [INFO ] Decomposing Gal with order
[2026-05-23 18:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:16:29] [INFO ] Removed a total of 1912 redundant transitions.
[2026-05-23 18:16:29] [INFO ] Flatten gal took : 129 ms
[2026-05-23 18:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1067 labels/synchronizations in 13 ms.
[2026-05-23 18:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7488761264405558992.gal : 25 ms
[2026-05-23 18:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5493495943140153635.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/CTLFireability7488761264405558992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5493495943140153635.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,3.64692e+84,2.16277,31344,222,25,1360,813,790,804,149,1294,0


Converting to forward existential form...Done !
original formula: AF(((i23.u466.TrainState_3_1_34==1) + (AF(((EG((i33.u131.TrainState_16_2_7==1)) * (i4.u290.TrainState_27_1_25==0)) * AF((i46.u275.TrainSt...214
=> equivalent forward existential formula: [FwdG(Init,!(((i23.u466.TrainState_3_1_34==1) + (!(EG(!(((EG((i33.u131.TrainState_16_2_7==1)) * (i4.u290.TrainSt...271
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,0,3.52779,52472,1,0,110964,1226,3112,120098,569,2896,55249
FORMULA BART-PT-050-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-23 18:16:33] [INFO ] Flatten gal took : 269 ms
[2026-05-23 18:16:34] [INFO ] Flatten gal took : 277 ms
[2026-05-23 18:16:34] [INFO ] Applying decomposition
[2026-05-23 18:16:34] [INFO ] Flatten gal took : 277 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/graph13006025619900974337.txt' '-o' '/tmp/graph13006025619900974337.bin' '-w' '/tmp/graph13006025619900974337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13006025619900974337.bin' '-l' '-1' '-v' '-w' '/tmp/graph13006025619900974337.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:16:35] [INFO ] Decomposing Gal with order
[2026-05-23 18:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:16:39] [INFO ] Removed a total of 856 redundant transitions.
[2026-05-23 18:16:39] [INFO ] Flatten gal took : 534 ms
[2026-05-23 18:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2026-05-23 18:17:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14148818937206438475.gal : 53 ms
[2026-05-23 18:17:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5066740395769190782.ctl : 117 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/CTLFireability14148818937206438475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5066740395769190782.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 4 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.06831e+106,13.1939,76156,1793,75,35443,3355,4855,34081,286,2959,0


Converting to forward existential form...Done !
original formula: (AF((AG(((((((((((((((i39.i0.u1869.TrainState_31_3_35==1)||(i29.i0.u905.TrainState_33_2_19==1))||((i27.i6.u1684.TrainState_18_3_30==1)||(...892168
=> equivalent forward existential formula: [FwdG((Init * !(EG(((((((((((((((i39.i0.u1869.TrainState_31_3_35==0)&&(i29.i0.u905.TrainState_33_2_19==0))&&((i2...892234
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 0,1,56.9845,1019856,1,0,1.62129e+06,229061,111057,6.94916e+06,7797,306343,1634502
FORMULA BART-PT-050-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(AG(EF(((((((((((((i4.i0.u107.TrainState_12_0_0==1)||(i24.i0.u165.TrainState_23_0_0==1))||((i18.i0.u138.TrainState_47_0_0==1)||(i29.i0...288456
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U ((((((((((((i4.i0.u107.TrainState_12_0_0==1)||(i24.i0.u165.TrainState_23_0_0...4390101
(forward)formula 1,1,148.308,1096160,1,0,1.80072e+06,243320,113265,7.20425e+06,7797,352088,1862557
FORMULA BART-PT-050-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AF((EX(((((((((((((((((i39.i0.u1869.TrainState_31_3_35==1)||(i29.i0.u905.TrainState_33_2_19==1))||((i27.i6.u1684.TrainState_18_3_30==1...567719
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((EX(((((((((((((((((i39.i0.u1869.TrainState_31_3_35==1)||(i29.i0.u905.TrainState_33_2_19==1))|...567768
Fast SCC detection found an SCC at level 1
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
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
(forward)formula 2,1,194.874,1934096,1,0,3.14702e+06,253869,117284,1.29831e+07,7823,392612,3162607
FORMULA BART-PT-050-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((((((A(((((((((i16.i0.u31.TrainState_15_1_1==1)||(i5.i0.u3.TrainState_17_1_1==1))||((i6.i0.u5.TrainState_19_1_1==1)||(i48.i11.u33....713788
=> equivalent forward existential formula: ((((((((([((FwdU(Init,TRUE) * !(EG(!(EX(!(EX(!(((((((((((((((i39.i0.u1869.TrainState_31_3_35==1)||(i29.i0.u905.T...1402916
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
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
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,1,1048.03,2753748,1,0,4.72478e+06,817504,61752,1.57972e+07,3327,3.08789e+06,1864770
FORMULA BART-PT-050-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2899201 ms.

BK_STOP 1779561296119

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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