About the Execution of ITS-Tools for BART-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3511.707 | 1285606.00 | 1481100.00 | 3994.10 | FTTTFTFTFFTFTFFT | normal |
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-177946788100250.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BART-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100250
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 46M
-rw-r--r-- 1 mcc users 1.3M Mar 5 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.5M Mar 5 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Mar 5 09:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 562K Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 680K Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3M Mar 5 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.1M Mar 5 09:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Mar 5 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5M Mar 5 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 242K Mar 15 07:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BART-PT-020-CTLFireability-2024-00
FORMULA_NAME BART-PT-020-CTLFireability-2024-01
FORMULA_NAME BART-PT-020-CTLFireability-2024-02
FORMULA_NAME BART-PT-020-CTLFireability-2024-03
FORMULA_NAME BART-PT-020-CTLFireability-2024-04
FORMULA_NAME BART-PT-020-CTLFireability-2024-05
FORMULA_NAME BART-PT-020-CTLFireability-2024-06
FORMULA_NAME BART-PT-020-CTLFireability-2024-07
FORMULA_NAME BART-PT-020-CTLFireability-2024-08
FORMULA_NAME BART-PT-020-CTLFireability-2024-09
FORMULA_NAME BART-PT-020-CTLFireability-2024-10
FORMULA_NAME BART-PT-020-CTLFireability-2024-11
FORMULA_NAME BART-PT-020-CTLFireability-2024-12
FORMULA_NAME BART-PT-020-CTLFireability-2024-13
FORMULA_NAME BART-PT-020-CTLFireability-2024-14
FORMULA_NAME BART-PT-020-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779551892142
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-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 15:58:14] [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 15:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:58:15] [INFO ] Load time of PNML (sax parser for PT used): 698 ms
[2026-05-23 15:58:15] [INFO ] Transformed 2850 places.
[2026-05-23 15:58:15] [INFO ] Transformed 4040 transitions.
[2026-05-23 15:58:15] [INFO ] Found NUPN structural information;
[2026-05-23 15:58:15] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 983 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 282 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 2640 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 39 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (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-7277088783063751036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17197876084663371755.kers'
[2026-05-23 15:58:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7277088783063751036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17197876084663371755.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4040 rows 2640 cols 8080 entries
Finished phase 1 with 2620 SingleSign rule and 0 generalized
[2026-05-23 15:58:16] [INFO ] Computed 20 invariants in 24 ms
Computed 20 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-17197876084663371755.kers
Total runtime 31 ms.
[2026-05-23 15:58:19] [INFO ] Implicit Places using invariants in 3011 ms returned []
[2026-05-23 15:58:19] [INFO ] Invariant cache hit.
[2026-05-23 15:58:23] [INFO ] Implicit Places using invariants and state equation in 4011 ms returned []
Implicit Place search using SMT with State Equation took 7080 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 15:58:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30157 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30118 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62367ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 62434ms
Finished structural reductions in LTL mode , in 1 iterations and 69656 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 30 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2026-05-23 15:59:26] [INFO ] Invariant cache hit.
[2026-05-23 15:59:27] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2026-05-23 15:59:27] [INFO ] Invariant cache hit.
[2026-05-23 15:59:30] [INFO ] Implicit Places using invariants and state equation in 3069 ms returned []
Implicit Place search using SMT with State Equation took 4234 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4267 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2640 out of 2640 places after structural reductions.
[2026-05-23 15:59:31] [INFO ] Flatten gal took : 415 ms
[2026-05-23 15:59:32] [INFO ] Flatten gal took : 346 ms
[2026-05-23 15:59:33] [INFO ] Input system was already deterministic with 4040 transitions.
Reduction of identical properties reduced properties to check from 81 to 71
RANDOM walk for 40000 steps (8 resets) in 3464 ms. (11 steps per ms) remains 9/71 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4990 ms. (8 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4509 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
[2026-05-23 15:59:37] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp17 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1366 variables, 1366/1366 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1366 variables, 0/1366 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 2 (OVERLAPS) 1274/2640 variables, 20/1386 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1274/2660 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 654/660 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 654/665 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/660 variables, 0/665 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1010/1670 variables, 660/1325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1670 variables, 3/1328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1670 variables, 0/1328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1670 variables, 0/1328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1670/6680 variables, and 1328 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2240 ms.
Refiners :[Domain max(s): 660/2640 constraints, Positive P Invariants (semi-flows): 5/20 constraints, State Equation: 660/2640 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7322ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 3 properties in 114 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-23 15:59:45] [INFO ] Flatten gal took : 232 ms
[2026-05-23 15:59:46] [INFO ] Flatten gal took : 228 ms
[2026-05-23 15:59:47] [INFO ] Input system was already deterministic with 4040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 1616 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1741429064621318909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4897751746667314284.kers'
[2026-05-23 15:59:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1741429064621318909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4897751746667314284.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2380 rows 980 cols 4760 entries
Finished phase 1 with 960 SingleSign rule and 0 generalized
[2026-05-23 15:59:49] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4897751746667314284.kers
Total runtime 13 ms.
[2026-05-23 15:59:49] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-23 15:59:49] [INFO ] Invariant cache hit.
[2026-05-23 15:59:50] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:59:50] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60773ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60783ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63921 ms. Remains : 980/2640 places, 2380/4040 transitions.
[2026-05-23 16:00:51] [INFO ] Flatten gal took : 62 ms
[2026-05-23 16:00:51] [INFO ] Flatten gal took : 55 ms
[2026-05-23 16:00:51] [INFO ] Input system was already deterministic with 2380 transitions.
[2026-05-23 16:00:51] [INFO ] Flatten gal took : 54 ms
[2026-05-23 16:00:51] [INFO ] Flatten gal took : 56 ms
[2026-05-23 16:00:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7550316745970150236.gal : 42 ms
[2026-05-23 16:00:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17901730073732233909.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/CTLFireability7550316745970150236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17901730073732233909.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36681e+33,2.51506,22296,2,1946,5,15308,6,0,6303,8251,0
Converting to forward existential form...Done !
original formula: AF(EX(AG(EX(((((((TrainState_10_0_0==0)&&(TrainState_9_0_0==0))&&((TrainState_13_0_0==0)&&(TrainState_8_0_0==0)))&&(((TrainState_4_0_0==0...541
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(EX(((((((TrainState_10_0_0==0)&&(TrainState_9_0_0==0))&&((TrainState_13_0_0==0)&&(T...598
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,15.2427,177964,1,0,8,996639,18,2,28123,43682,11
FORMULA BART-PT-020-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 9 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (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-15562039003188248693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8923052837461491770.kers'
[2026-05-23 16:01:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15562039003188248693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8923052837461491770.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4040 rows 2640 cols 8080 entries
Finished phase 1 with 2620 SingleSign rule and 0 generalized
[2026-05-23 16:01:07] [INFO ] Computed 20 invariants in 19 ms
Computed 20 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-8923052837461491770.kers
Total runtime 22 ms.
[2026-05-23 16:01:08] [INFO ] Implicit Places using invariants in 808 ms returned []
[2026-05-23 16:01:08] [INFO ] Invariant cache hit.
[2026-05-23 16:01:10] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3472 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 16:01:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30076 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30102 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61596ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61607ms
Finished structural reductions in LTL mode , in 1 iterations and 65101 ms. Remains : 2640/2640 places, 4040/4040 transitions.
[2026-05-23 16:02:12] [INFO ] Flatten gal took : 91 ms
[2026-05-23 16:02:12] [INFO ] Flatten gal took : 128 ms
[2026-05-23 16:02:13] [INFO ] Input system was already deterministic with 4040 transitions.
[2026-05-23 16:02:13] [INFO ] Flatten gal took : 117 ms
[2026-05-23 16:02:13] [INFO ] Flatten gal took : 117 ms
[2026-05-23 16:02:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16860638498947937208.gal : 27 ms
[2026-05-23 16:02:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16886173380499710274.ctl : 51 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/CTLFireability16860638498947937208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16886173380499710274.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 16:02:43] [INFO ] Flatten gal took : 77 ms
[2026-05-23 16:02:43] [INFO ] Applying decomposition
[2026-05-23 16:02:43] [INFO ] Flatten gal took : 79 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/graph8642249064388409552.txt' '-o' '/tmp/graph8642249064388409552.bin' '-w' '/tmp/graph8642249064388409552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8642249064388409552.bin' '-l' '-1' '-v' '-w' '/tmp/graph8642249064388409552.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:02:44] [INFO ] Decomposing Gal with order
[2026-05-23 16:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:02:45] [INFO ] Removed a total of 239 redundant transitions.
[2026-05-23 16:02:45] [INFO ] Flatten gal took : 501 ms
[2026-05-23 16:02:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2026-05-23 16:02:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8436017060624918235.gal : 47 ms
[2026-05-23 16:02:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14588998855879550308.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/CTLFireability8436017060624918235.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14588998855879550308.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,2.57916e+42,2.18408,31184,723,75,13711,2842,2269,12983,234,2066,0
Converting to forward existential form...Done !
original formula: EG(E(((EX((((((((((i1.i1.u117.TrainState_8_3_9==1)||(i11.i0.u21.TrainState_1_2_5==1))||((i1.i0.u76.TrainState_8_3_7==1)||(i1.i0.u130.Trai...390538
=> equivalent forward existential formula: [FwdG(Init,E(((EX((((((((((i1.i1.u117.TrainState_8_3_9==1)||(i11.i0.u21.TrainState_1_2_5==1))||((i1.i0.u76.Train...390581
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
(forward)formula 0,1,7.44853,79416,1,0,116371,30085,39468,262406,3039,96205,162634
FORMULA BART-PT-020-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 15 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2026-05-23 16:02:56] [INFO ] Invariant cache hit.
[2026-05-23 16:02:57] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2026-05-23 16:02:57] [INFO ] Invariant cache hit.
[2026-05-23 16:03:00] [INFO ] Implicit Places using invariants and state equation in 3581 ms returned []
Implicit Place search using SMT with State Equation took 4650 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4669 ms. Remains : 2640/2640 places, 4040/4040 transitions.
[2026-05-23 16:03:01] [INFO ] Flatten gal took : 118 ms
[2026-05-23 16:03:01] [INFO ] Flatten gal took : 138 ms
[2026-05-23 16:03:01] [INFO ] Input system was already deterministic with 4040 transitions.
[2026-05-23 16:03:01] [INFO ] Flatten gal took : 129 ms
[2026-05-23 16:03:01] [INFO ] Flatten gal took : 96 ms
[2026-05-23 16:03:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1601834203681719966.gal : 16 ms
[2026-05-23 16:03:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4986508828972260885.ctl : 20 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/CTLFireability1601834203681719966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4986508828972260885.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 16:03:32] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:03:32] [INFO ] Applying decomposition
[2026-05-23 16:03:32] [INFO ] Flatten gal took : 92 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/graph4447326348117616878.txt' '-o' '/tmp/graph4447326348117616878.bin' '-w' '/tmp/graph4447326348117616878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4447326348117616878.bin' '-l' '-1' '-v' '-w' '/tmp/graph4447326348117616878.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:03:32] [INFO ] Decomposing Gal with order
[2026-05-23 16:03:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:03:33] [INFO ] Removed a total of 302 redundant transitions.
[2026-05-23 16:03:33] [INFO ] Flatten gal took : 209 ms
[2026-05-23 16:03:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2026-05-23 16:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability4528931984349471922.gal : 27 ms
[2026-05-23 16:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17276580133157813572.ctl : 22 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/CTLFireability4528931984349471922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17276580133157813572.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,2.57916e+42,2.05786,31380,713,75,14205,2966,2555,14318,240,2429,0
Converting to forward existential form...Done !
original formula: ((EX(EG((EG((((((((((i2.i0.u223.TrainState_8_3_9==0)&&(i5.i0.u73.TrainState_1_2_5==0))&&((i2.i2.u84.TrainState_8_3_7==0)&&(i2.i0.u98.Trai...403150
=> equivalent forward existential formula: ([(FwdU((((((((((((FwdU((Init * !((EX(EG((EG((((((((((i2.i0.u223.TrainState_8_3_9==0)&&(i5.i0.u73.TrainState_1_2...1474121
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 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
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 11 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2026-05-23 16:04:07] [INFO ] Invariant cache hit.
[2026-05-23 16:04:08] [INFO ] Implicit Places using invariants in 929 ms returned []
[2026-05-23 16:04:08] [INFO ] Invariant cache hit.
[2026-05-23 16:04:11] [INFO ] Implicit Places using invariants and state equation in 2746 ms returned []
Implicit Place search using SMT with State Equation took 3684 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3697 ms. Remains : 2640/2640 places, 4040/4040 transitions.
[2026-05-23 16:04:11] [INFO ] Flatten gal took : 47 ms
[2026-05-23 16:04:11] [INFO ] Flatten gal took : 61 ms
[2026-05-23 16:04:11] [INFO ] Input system was already deterministic with 4040 transitions.
[2026-05-23 16:04:11] [INFO ] Flatten gal took : 59 ms
[2026-05-23 16:04:11] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:04:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3826018306113388201.gal : 13 ms
[2026-05-23 16:04:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2959473903640747414.ctl : 9 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/CTLFireability3826018306113388201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2959473903640747414.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 16:04:41] [INFO ] Flatten gal took : 58 ms
[2026-05-23 16:04:41] [INFO ] Applying decomposition
[2026-05-23 16:04:41] [INFO ] Flatten gal took : 60 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/graph8733436557544235817.txt' '-o' '/tmp/graph8733436557544235817.bin' '-w' '/tmp/graph8733436557544235817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8733436557544235817.bin' '-l' '-1' '-v' '-w' '/tmp/graph8733436557544235817.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:04:41] [INFO ] Decomposing Gal with order
[2026-05-23 16:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:04:42] [INFO ] Removed a total of 338 redundant transitions.
[2026-05-23 16:04:42] [INFO ] Flatten gal took : 255 ms
[2026-05-23 16:04:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 16 ms.
[2026-05-23 16:04:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2966115541088052251.gal : 25 ms
[2026-05-23 16:04:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10525858946479111016.ctl : 14 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/CTLFireability2966115541088052251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10525858946479111016.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,2.57916e+42,2.10998,31048,825,75,16931,3229,2692,16483,256,2777,0
Converting to forward existential form...Done !
original formula: AF(((EX(EX(((((((((((((i10.i0.u812.TrainState_6_1_31==0)&&(i10.i10.u796.TrainState_6_2_35==0))&&((i12.i11.u833.TrainState_15_2_37==0)&&(i...191368
=> equivalent forward existential formula: [FwdG(Init,!(((EX(EX(((((((((((((i10.i0.u812.TrainState_6_1_31==0)&&(i10.i10.u796.TrainState_6_2_35==0))&&((i12....191425
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
(forward)formula 0,1,6.14876,97984,1,0,112961,208524,39365,265272,3489,256385,132287
FORMULA BART-PT-020-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 520 Post agglomeration using F-continuation condition.Transition count delta: 520
Iterating post reduction 1 with 580 rules applied. Total rules applied 640 place count 2580 transition count 3460
Reduce places removed 520 places and 0 transitions.
Iterating post reduction 2 with 520 rules applied. Total rules applied 1160 place count 2060 transition count 3460
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1180 place count 2040 transition count 3440
Iterating global reduction 3 with 20 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1360 place count 1960 transition count 3360
Applied a total of 1360 rules in 685 ms. Remains 1960 /2640 variables (removed 680) and now considering 3360/4040 (removed 680) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2416868599746798715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13326969196359844814.kers'
[2026-05-23 16:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2416868599746798715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13326969196359844814.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3360 rows 1960 cols 6720 entries
Finished phase 1 with 1940 SingleSign rule and 0 generalized
[2026-05-23 16:04:51] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13326969196359844814.kers
Total runtime 18 ms.
[2026-05-23 16:04:51] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-23 16:04:51] [INFO ] Invariant cache hit.
[2026-05-23 16:04:54] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2026-05-23 16:04:54] [INFO ] Redundant transitions in 382 ms returned []
Running 2640 sub problems to find dead transitions.
[2026-05-23 16:04:54] [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 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 2640/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2640 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61093ms problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 61099ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1960/2640 places, 3360/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65061 ms. Remains : 1960/2640 places, 3360/4040 transitions.
[2026-05-23 16:05:55] [INFO ] Flatten gal took : 56 ms
[2026-05-23 16:05:55] [INFO ] Flatten gal took : 78 ms
[2026-05-23 16:05:55] [INFO ] Input system was already deterministic with 3360 transitions.
[2026-05-23 16:05:56] [INFO ] Flatten gal took : 72 ms
[2026-05-23 16:05:56] [INFO ] Flatten gal took : 74 ms
[2026-05-23 16:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14600748918734249546.gal : 16 ms
[2026-05-23 16:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability4900936816413397334.ctl : 8 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/CTLFireability14600748918734249546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4900936816413397334.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 16:06:26] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:06:26] [INFO ] Applying decomposition
[2026-05-23 16:06:26] [INFO ] Flatten gal took : 68 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/graph15189986449289887967.txt' '-o' '/tmp/graph15189986449289887967.bin' '-w' '/tmp/graph15189986449289887967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15189986449289887967.bin' '-l' '-1' '-v' '-w' '/tmp/graph15189986449289887967.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:06:26] [INFO ] Decomposing Gal with order
[2026-05-23 16:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:06:27] [INFO ] Removed a total of 339 redundant transitions.
[2026-05-23 16:06:27] [INFO ] Flatten gal took : 175 ms
[2026-05-23 16:06:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2026-05-23 16:06:27] [INFO ] Time to serialize gal into /tmp/CTLFireability2929972473352369180.gal : 19 ms
[2026-05-23 16:06:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12763475131862298776.ctl : 8 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/CTLFireability2929972473352369180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12763475131862298776.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.67608e+39,1.64241,23548,959,89,8977,4636,1994,6629,379,4884,0
Converting to forward existential form...Done !
original formula: !(A(((((((((((!((!(AG(((((((((((((i15.u212.TrainState_6_1_7==1)||(i16.u42.TrainState_9_1_27==1))||((i1.u35.TrainState_2_1_9==1)||(i1.u35....166189
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((E(((((((((((((i15.u212.TrainState_6_1_7==1)||(i16.u42.TrainState_9_1_27==1))||((i1.u...309146
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 9 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (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-12770969774784109645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-479967025258141469.kers'
[2026-05-23 16:06:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12770969774784109645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-479967025258141469.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4040 rows 2640 cols 8080 entries
Finished phase 1 with 2620 SingleSign rule and 0 generalized
[2026-05-23 16:06:57] [INFO ] Computed 20 invariants in 19 ms
Computed 20 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-479967025258141469.kers
Total runtime 23 ms.
[2026-05-23 16:06:58] [INFO ] Implicit Places using invariants in 825 ms returned []
[2026-05-23 16:06:58] [INFO ] Invariant cache hit.
[2026-05-23 16:07:00] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 3556 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 16:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30123 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30108 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61622ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61628ms
Finished structural reductions in LTL mode , in 1 iterations and 65203 ms. Remains : 2640/2640 places, 4040/4040 transitions.
[2026-05-23 16:08:02] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:08:02] [INFO ] Flatten gal took : 104 ms
[2026-05-23 16:08:03] [INFO ] Input system was already deterministic with 4040 transitions.
[2026-05-23 16:08:03] [INFO ] Flatten gal took : 100 ms
[2026-05-23 16:08:03] [INFO ] Flatten gal took : 88 ms
[2026-05-23 16:08:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10085721255701431670.gal : 14 ms
[2026-05-23 16:08:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1577952544645302480.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/CTLFireability10085721255701431670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1577952544645302480.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 16:08:33] [INFO ] Flatten gal took : 67 ms
[2026-05-23 16:08:33] [INFO ] Applying decomposition
[2026-05-23 16:08:33] [INFO ] Flatten gal took : 59 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/graph16030756313147538459.txt' '-o' '/tmp/graph16030756313147538459.bin' '-w' '/tmp/graph16030756313147538459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16030756313147538459.bin' '-l' '-1' '-v' '-w' '/tmp/graph16030756313147538459.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:08:33] [INFO ] Decomposing Gal with order
[2026-05-23 16:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:08:34] [INFO ] Removed a total of 245 redundant transitions.
[2026-05-23 16:08:34] [INFO ] Flatten gal took : 135 ms
[2026-05-23 16:08:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-23 16:08:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2965667624337052076.gal : 21 ms
[2026-05-23 16:08:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3187136793531596096.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/CTLFireability2965667624337052076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3187136793531596096.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,2.57916e+42,2.53158,31144,755,75,15085,2892,2484,14196,232,2244,0
Converting to forward existential form...Done !
original formula: EF((((((((((i13.i1.u121.TrainState_8_3_9==1)||(i2.i0.u29.TrainState_1_2_5==1))||((i13.i1.u41.TrainState_8_3_7==1)||(i13.i1.u127.TrainStat...235360
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((((((((i13.i1.u121.TrainState_8_3_9==1)||(i2.i0.u29.TrainState_1_2_5==1))||((i13.i1.u41.Tr...766521
(forward)formula 0,1,2.59663,34456,1,0,15085,2892,3198,14196,241,2244,1246
FORMULA BART-PT-020-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 15 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2026-05-23 16:08:38] [INFO ] Invariant cache hit.
[2026-05-23 16:08:40] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2026-05-23 16:08:40] [INFO ] Invariant cache hit.
[2026-05-23 16:08:42] [INFO ] Implicit Places using invariants and state equation in 2754 ms returned []
Implicit Place search using SMT with State Equation took 3888 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3906 ms. Remains : 2640/2640 places, 4040/4040 transitions.
[2026-05-23 16:08:42] [INFO ] Flatten gal took : 49 ms
[2026-05-23 16:08:43] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:08:43] [INFO ] Input system was already deterministic with 4040 transitions.
[2026-05-23 16:08:43] [INFO ] Flatten gal took : 99 ms
[2026-05-23 16:08:43] [INFO ] Flatten gal took : 129 ms
[2026-05-23 16:08:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16878605452342044007.gal : 20 ms
[2026-05-23 16:08:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10693219791153273737.ctl : 23 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/CTLFireability16878605452342044007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10693219791153273737.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 16:09:13] [INFO ] Flatten gal took : 80 ms
[2026-05-23 16:09:13] [INFO ] Applying decomposition
[2026-05-23 16:09:13] [INFO ] Flatten gal took : 82 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/graph14870601286061894225.txt' '-o' '/tmp/graph14870601286061894225.bin' '-w' '/tmp/graph14870601286061894225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14870601286061894225.bin' '-l' '-1' '-v' '-w' '/tmp/graph14870601286061894225.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:09:13] [INFO ] Decomposing Gal with order
[2026-05-23 16:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:09:14] [INFO ] Removed a total of 365 redundant transitions.
[2026-05-23 16:09:14] [INFO ] Flatten gal took : 247 ms
[2026-05-23 16:09:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2026-05-23 16:09:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6047070202567435340.gal : 22 ms
[2026-05-23 16:09:19] [INFO ] Time to serialize properties into /tmp/CTLFireability6078384663195278826.ctl : 27 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/CTLFireability6047070202567435340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6078384663195278826.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,2.57916e+42,2.11651,31552,823,75,17141,2996,2704,16608,245,2503,0
Converting to forward existential form...Done !
original formula: E(AF((AX(((((((i9.i0.u26.TrainState_13_1_1==1)||(i10.i0.u5.TrainState_14_1_1==1))||((i14.i0.u6.TrainState_15_1_1==1)||(i17.i0.u16.TrainSt...526701
=> equivalent forward existential formula: ((([(FwdU(((((((FwdU(Init,!(EG(!((!(EX(!(((((((i9.i0.u26.TrainState_13_1_1==1)||(i10.i0.u5.TrainState_14_1_1==1)...1760184
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 2640 transition count 4020
Reduce places removed 20 places and 0 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 1 with 180 rules applied. Total rules applied 200 place count 2620 transition count 3860
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 360 place count 2460 transition count 3860
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 360 place count 2460 transition count 3840
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 400 place count 2440 transition count 3840
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 1 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 960 place count 2160 transition count 3560
Applied a total of 960 rules in 298 ms. Remains 2160 /2640 variables (removed 480) and now considering 3560/4040 (removed 480) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4725541926358340699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5867744855202537724.kers'
[2026-05-23 16:09:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4725541926358340699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5867744855202537724.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3560 rows 2160 cols 7120 entries
Finished phase 1 with 2140 SingleSign rule and 0 generalized
[2026-05-23 16:09:49] [INFO ] Computed 20 invariants in 26 ms
Computed 20 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-5867744855202537724.kers
Total runtime 44 ms.
[2026-05-23 16:09:50] [INFO ] Implicit Places using invariants in 858 ms returned []
[2026-05-23 16:09:50] [INFO ] Invariant cache hit.
[2026-05-23 16:09:52] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
[2026-05-23 16:09:53] [INFO ] Redundant transitions in 276 ms returned []
Running 2840 sub problems to find dead transitions.
[2026-05-23 16:09:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2140 variables, 2140/2140 constraints. Problems are: Problem set: 0 solved, 2840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2140/5720 variables, and 2140 constraints, problems are : Problem set: 0 solved, 2840 unsolved in 30059 ms.
Refiners :[Domain max(s): 2140/2160 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 2840/2840 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2140 variables, 2140/2140 constraints. Problems are: Problem set: 0 solved, 2840 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2140/5720 variables, and 2140 constraints, problems are : Problem set: 0 solved, 2840 unsolved in 30061 ms.
Refiners :[Domain max(s): 2140/2160 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2160 constraints, PredecessorRefiner: 0/2840 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61030ms problems are : Problem set: 0 solved, 2840 unsolved
Search for dead transitions found 0 dead transitions in 61034ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2160/2640 places, 3560/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64602 ms. Remains : 2160/2640 places, 3560/4040 transitions.
[2026-05-23 16:10:54] [INFO ] Flatten gal took : 40 ms
[2026-05-23 16:10:54] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:10:54] [INFO ] Input system was already deterministic with 3560 transitions.
[2026-05-23 16:10:54] [INFO ] Flatten gal took : 73 ms
[2026-05-23 16:10:54] [INFO ] Flatten gal took : 74 ms
[2026-05-23 16:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14754182678552311459.gal : 17 ms
[2026-05-23 16:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13003187149595610861.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14754182678552311459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13003187149595610861.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.66096e+40,8.46186,51268,2,4301,5,51371,6,0,12203,44117,0
Converting to forward existential form...Done !
original formula: (EF(((((((((((AF(((((((((((((TrainState_6_1_31==0)&&(TrainState_6_2_35==0))&&((TrainState_15_2_37==0)&&(TrainState_3_1_28==0)))&&(((Train...88063
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((((((((((!(EG(!(((((((((((((TrainState_6_1_31==0)&&(TrainState_6_2_35==0))&&((TrainState...88064
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:11:24] [INFO ] Flatten gal took : 44 ms
[2026-05-23 16:11:24] [INFO ] Applying decomposition
[2026-05-23 16:11:24] [INFO ] Flatten gal took : 44 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/graph5042679567568903779.txt' '-o' '/tmp/graph5042679567568903779.bin' '-w' '/tmp/graph5042679567568903779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5042679567568903779.bin' '-l' '-1' '-v' '-w' '/tmp/graph5042679567568903779.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:11:24] [INFO ] Decomposing Gal with order
[2026-05-23 16:11:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:11:25] [INFO ] Removed a total of 595 redundant transitions.
[2026-05-23 16:11:25] [INFO ] Flatten gal took : 135 ms
[2026-05-23 16:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2026-05-23 16:11:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5154501531629570195.gal : 20 ms
[2026-05-23 16:11:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7213872539995065130.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/CTLFireability5154501531629570195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7213872539995065130.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.66096e+40,1.53839,26200,707,83,15889,6158,2116,17304,343,6708,0
Converting to forward existential form...Done !
original formula: (EF(((((((((((AF(((((((((((((i16.i0.u12.TrainState_6_1_31==0)&&(i16.i3.u557.TrainState_6_2_35==0))&&((i15.i2.u635.TrainState_15_2_37==0)&...123244
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((((((((((!(EG(!(((((((((((((i16.i0.u12.TrainState_6_1_31==0)&&(i16.i3.u557.TrainState_6_...123305
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 638 places :
Symmetric choice reduction at 0 with 638 rule applications. Total rules 638 place count 2002 transition count 3402
Iterating global reduction 0 with 638 rules applied. Total rules applied 1276 place count 2002 transition count 3402
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 1814 place count 1464 transition count 2864
Iterating global reduction 0 with 538 rules applied. Total rules applied 2352 place count 1464 transition count 2864
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2432 place count 1384 transition count 2784
Iterating global reduction 0 with 80 rules applied. Total rules applied 2512 place count 1384 transition count 2784
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2572 place count 1324 transition count 2724
Iterating global reduction 0 with 60 rules applied. Total rules applied 2632 place count 1324 transition count 2724
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2692 place count 1264 transition count 2664
Iterating global reduction 0 with 60 rules applied. Total rules applied 2752 place count 1264 transition count 2664
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2812 place count 1204 transition count 2604
Iterating global reduction 0 with 60 rules applied. Total rules applied 2872 place count 1204 transition count 2604
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2932 place count 1144 transition count 2544
Iterating global reduction 0 with 60 rules applied. Total rules applied 2992 place count 1144 transition count 2544
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3052 place count 1084 transition count 2484
Iterating global reduction 0 with 60 rules applied. Total rules applied 3112 place count 1084 transition count 2484
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3152 place count 1044 transition count 2444
Iterating global reduction 0 with 40 rules applied. Total rules applied 3192 place count 1044 transition count 2444
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3231 place count 1005 transition count 2405
Iterating global reduction 0 with 39 rules applied. Total rules applied 3270 place count 1005 transition count 2405
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3289 place count 986 transition count 2386
Iterating global reduction 0 with 19 rules applied. Total rules applied 3308 place count 986 transition count 2386
Applied a total of 3308 rules in 811 ms. Remains 986 /2640 variables (removed 1654) and now considering 2386/4040 (removed 1654) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7161012019710712202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17091201277560575766.kers'
[2026-05-23 16:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7161012019710712202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17091201277560575766.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2386 rows 986 cols 4772 entries
Finished phase 1 with 966 SingleSign rule and 0 generalized
[2026-05-23 16:11:56] [INFO ] Computed 20 invariants in 13 ms
Computed 20 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-17091201277560575766.kers
Total runtime 18 ms.
[2026-05-23 16:11:57] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-23 16:11:57] [INFO ] Invariant cache hit.
[2026-05-23 16:11:58] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2026-05-23 16:11:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 966/3372 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 1666/1666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1666 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 966/3372 variables, and 0 constraints, problems are : Problem set: 0 solved, 1666 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/986 constraints, PredecessorRefiner: 0/1666 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60484ms problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Starting structural reductions in LTL mode, iteration 1 : 986/2640 places, 2386/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62761 ms. Remains : 986/2640 places, 2386/4040 transitions.
[2026-05-23 16:12:58] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:12:58] [INFO ] Flatten gal took : 43 ms
[2026-05-23 16:12:58] [INFO ] Input system was already deterministic with 2386 transitions.
[2026-05-23 16:12:58] [INFO ] Flatten gal took : 42 ms
[2026-05-23 16:12:58] [INFO ] Flatten gal took : 43 ms
[2026-05-23 16:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3015927514120983170.gal : 11 ms
[2026-05-23 16:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1961610165420531760.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/CTLFireability3015927514120983170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1961610165420531760.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,7.17028e+33,2.62139,22536,2,1953,5,15438,6,0,6333,8345,0
Converting to forward existential form...Done !
original formula: AX((AF((TrainState_14_4_33==1)) * A((EF(((TrainState_9_1_38==1)&&(TrainState_6_4_32==1))) * (TrainState_15_1_15==1)) U (AG(((TrainState_1...224
=> equivalent forward existential formula: ([FwdG(EY(Init),!((TrainState_14_4_33==1)))] = FALSE * ([FwdG(((FwdU(EY(Init),!((!(E(TRUE U !(((TrainState_18_1_...563
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,18.6126,290012,1,0,203,1.63606e+06,29,192,26310,1.06326e+06,202
FORMULA BART-PT-020-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3055 place count 1083 transition count 2483
Iterating global reduction 0 with 59 rules applied. Total rules applied 3114 place count 1083 transition count 2483
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3153 place count 1044 transition count 2444
Iterating global reduction 0 with 39 rules applied. Total rules applied 3192 place count 1044 transition count 2444
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3231 place count 1005 transition count 2405
Iterating global reduction 0 with 39 rules applied. Total rules applied 3270 place count 1005 transition count 2405
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3289 place count 986 transition count 2386
Iterating global reduction 0 with 19 rules applied. Total rules applied 3308 place count 986 transition count 2386
Applied a total of 3308 rules in 858 ms. Remains 986 /2640 variables (removed 1654) and now considering 2386/4040 (removed 1654) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7483741573737573991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-762916491782560315.kers'
[2026-05-23 16:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7483741573737573991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-762916491782560315.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2386 rows 986 cols 4772 entries
Finished phase 1 with 966 SingleSign rule and 0 generalized
[2026-05-23 16:13:18] [INFO ] Computed 20 invariants in 14 ms
Computed 20 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-762916491782560315.kers
Total runtime 16 ms.
[2026-05-23 16:13:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 16:13:18] [INFO ] Invariant cache hit.
[2026-05-23 16:13:19] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 986/2640 places, 2386/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2307 ms. Remains : 986/2640 places, 2386/4040 transitions.
[2026-05-23 16:13:20] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:13:20] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:13:20] [INFO ] Input system was already deterministic with 2386 transitions.
[2026-05-23 16:13:20] [INFO ] Flatten gal took : 26 ms
[2026-05-23 16:13:20] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5983296730135955931.gal : 8 ms
[2026-05-23 16:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2477744625761110439.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/CTLFireability5983296730135955931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2477744625761110439.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,7.14641e+33,2.45081,22504,2,1953,5,15497,6,0,6333,8414,0
Converting to forward existential form...Done !
original formula: EX(((TrainState_1_4_20==1) * ((E(EG((TrainState_9_1_37==1)) U EX((TrainState_2_0_0==1))) + (TrainState_17_1_8==1)) + (TrainState_9_0_0==1...159
=> equivalent forward existential formula: (([(EY(FwdU((EY(Init) * (TrainState_1_4_20==1)),EG((TrainState_9_1_37==1)))) * (TrainState_2_0_0==1))] != FALSE ...307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,10.5666,158956,1,0,13,977084,26,1,24374,20641,11
FORMULA BART-PT-020-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3936 edges and 2640 vertex of which 2359 / 2640 are part of one of the 18 SCC in 7 ms
Free SCC test removed 2341 places
Ensure Unique test removed 3590 transitions
Reduce isomorphic transitions removed 3590 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 287 transition count 311
Reduce places removed 128 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 135 rules applied. Total rules applied 275 place count 159 transition count 304
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 285 place count 152 transition count 301
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 285 place count 152 transition count 291
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 305 place count 142 transition count 291
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 317 place count 130 transition count 279
Iterating global reduction 3 with 12 rules applied. Total rules applied 329 place count 130 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 331 place count 130 transition count 277
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 339 place count 122 transition count 269
Iterating global reduction 4 with 8 rules applied. Total rules applied 347 place count 122 transition count 269
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 353 place count 116 transition count 263
Iterating global reduction 4 with 6 rules applied. Total rules applied 359 place count 116 transition count 263
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 365 place count 110 transition count 257
Iterating global reduction 4 with 6 rules applied. Total rules applied 371 place count 110 transition count 257
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 375 place count 106 transition count 253
Iterating global reduction 4 with 4 rules applied. Total rules applied 379 place count 106 transition count 253
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 383 place count 102 transition count 249
Iterating global reduction 4 with 4 rules applied. Total rules applied 387 place count 102 transition count 249
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 389 place count 100 transition count 247
Iterating global reduction 4 with 2 rules applied. Total rules applied 391 place count 100 transition count 247
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 415 place count 88 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 419 place count 88 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 423 place count 86 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 427 place count 86 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 431 place count 84 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 434 place count 84 transition count 220
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 436 place count 83 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 438 place count 83 transition count 217
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 440 place count 82 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 442 place count 82 transition count 214
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 444 place count 81 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 446 place count 81 transition count 211
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 448 place count 80 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 450 place count 80 transition count 208
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 452 place count 79 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 454 place count 79 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 92 transitions
Redundant transition composition rules discarded 92 transitions
Iterating global reduction 12 with 92 rules applied. Total rules applied 546 place count 79 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 12 with 27 rules applied. Total rules applied 573 place count 79 transition count 86
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 28 rules applied. Total rules applied 601 place count 52 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 602 place count 51 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 602 place count 51 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 604 place count 50 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 15 with 14 rules applied. Total rules applied 618 place count 50 transition count 70
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 15 with 13 rules applied. Total rules applied 631 place count 50 transition count 57
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 14 rules applied. Total rules applied 645 place count 37 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 646 place count 36 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 18 with 7 rules applied. Total rules applied 653 place count 36 transition count 49
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 18 with 6 rules applied. Total rules applied 659 place count 36 transition count 43
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 7 rules applied. Total rules applied 666 place count 30 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 667 place count 29 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 671 place count 29 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 21 with 2 rules applied. Total rules applied 673 place count 29 transition count 36
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 22 with 3 rules applied. Total rules applied 676 place count 27 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 677 place count 26 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 677 place count 26 transition count 34
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 679 place count 25 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 681 place count 25 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 1 rules applied. Total rules applied 682 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 683 place count 24 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 683 place count 24 transition count 30
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 685 place count 23 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 686 place count 23 transition count 30
Applied a total of 686 rules in 104 ms. Remains 23 /2640 variables (removed 2617) and now considering 30/4040 (removed 4010) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8085275277096482129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2991168318571795311.kers'
[2026-05-23 16:13:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8085275277096482129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2991168318571795311.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 29 rows 19 cols 50 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-23 16:13:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2991168318571795311.kers
Total runtime 2 ms.
[2026-05-23 16:13:30] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 16:13:30] [INFO ] Invariant cache hit.
[2026-05-23 16:13:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-23 16:13:30] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-23 16:13:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 8/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/53 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 8/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/53 variables, and 47 constraints, problems are : Problem set: 0 solved, 16 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 557ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/2640 places, 30/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 734 ms. Remains : 23/2640 places, 30/4040 transitions.
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:13:31] [INFO ] Input system was already deterministic with 30 transitions.
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:13:31] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11697246951346584918.gal : 1 ms
[2026-05-23 16:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9700547743138443186.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/CTLFireability11697246951346584918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9700547743138443186.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,2880,0.006497,3900,2,51,5,227,5,0,123,140,0
Converting to forward existential form...Done !
original formula: A(!(AG((TrainState_7_1_14==1))) U E(((!((!(E((TrainState_8_2_9==1) U (TrainState_4_0_0==1))) * !(A((TrainState_15_1_35==1) U (TrainState_...402
=> equivalent forward existential formula: [((Init * !(EG(!(E(((!((!(E((TrainState_8_2_9==1) U (TrainState_4_0_0==1))) * !(!((E(!((TrainState_6_1_9==1)) U ...1456
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 27/0/3
Hit Full ! (commute/partial/dont) 27/0/3
(forward)formula 0,1,0.044761,4640,1,0,27,1405,72,14,560,1147,29
FORMULA BART-PT-020-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 634 places :
Symmetric choice reduction at 0 with 634 rule applications. Total rules 634 place count 2006 transition count 3406
Iterating global reduction 0 with 634 rules applied. Total rules applied 1268 place count 2006 transition count 3406
Discarding 533 places :
Symmetric choice reduction at 0 with 533 rule applications. Total rules 1801 place count 1473 transition count 2873
Iterating global reduction 0 with 533 rules applied. Total rules applied 2334 place count 1473 transition count 2873
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2414 place count 1393 transition count 2793
Iterating global reduction 0 with 80 rules applied. Total rules applied 2494 place count 1393 transition count 2793
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2554 place count 1333 transition count 2733
Iterating global reduction 0 with 60 rules applied. Total rules applied 2614 place count 1333 transition count 2733
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2673 place count 1274 transition count 2674
Iterating global reduction 0 with 59 rules applied. Total rules applied 2732 place count 1274 transition count 2674
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2791 place count 1215 transition count 2615
Iterating global reduction 0 with 59 rules applied. Total rules applied 2850 place count 1215 transition count 2615
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 2908 place count 1157 transition count 2557
Iterating global reduction 0 with 58 rules applied. Total rules applied 2966 place count 1157 transition count 2557
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 3023 place count 1100 transition count 2500
Iterating global reduction 0 with 57 rules applied. Total rules applied 3080 place count 1100 transition count 2500
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3118 place count 1062 transition count 2462
Iterating global reduction 0 with 38 rules applied. Total rules applied 3156 place count 1062 transition count 2462
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 3192 place count 1026 transition count 2426
Iterating global reduction 0 with 36 rules applied. Total rules applied 3228 place count 1026 transition count 2426
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 3246 place count 1008 transition count 2408
Iterating global reduction 0 with 18 rules applied. Total rules applied 3264 place count 1008 transition count 2408
Applied a total of 3264 rules in 892 ms. Remains 1008 /2640 variables (removed 1632) and now considering 2408/4040 (removed 1632) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12011848924933741867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6311764113260686637.kers'
[2026-05-23 16:13:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12011848924933741867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6311764113260686637.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2408 rows 1008 cols 4816 entries
Finished phase 1 with 988 SingleSign rule and 0 generalized
[2026-05-23 16:13:32] [INFO ] Computed 20 invariants in 14 ms
Computed 20 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6311764113260686637.kers
Total runtime 17 ms.
[2026-05-23 16:13:32] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-23 16:13:32] [INFO ] Invariant cache hit.
[2026-05-23 16:13:34] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Running 1688 sub problems to find dead transitions.
[2026-05-23 16:13:34] [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 988/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1008 constraints, PredecessorRefiner: 0/1688 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60581ms problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 60583ms
Starting structural reductions in LTL mode, iteration 1 : 1008/2640 places, 2408/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63063 ms. Remains : 1008/2640 places, 2408/4040 transitions.
[2026-05-23 16:14:34] [INFO ] Flatten gal took : 42 ms
[2026-05-23 16:14:34] [INFO ] Flatten gal took : 42 ms
[2026-05-23 16:14:34] [INFO ] Input system was already deterministic with 2408 transitions.
[2026-05-23 16:14:34] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:14:34] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17181988880380973071.gal : 12 ms
[2026-05-23 16:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10251004804035920978.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/CTLFireability17181988880380973071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10251004804035920978.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 16:15:05] [INFO ] Flatten gal took : 27 ms
[2026-05-23 16:15:05] [INFO ] Applying decomposition
[2026-05-23 16:15:05] [INFO ] Flatten gal took : 28 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/graph377245173318873900.txt' '-o' '/tmp/graph377245173318873900.bin' '-w' '/tmp/graph377245173318873900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph377245173318873900.bin' '-l' '-1' '-v' '-w' '/tmp/graph377245173318873900.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:15:05] [INFO ] Decomposing Gal with order
[2026-05-23 16:15:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:15:05] [INFO ] Removed a total of 794 redundant transitions.
[2026-05-23 16:15:05] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:15:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 402 labels/synchronizations in 8 ms.
[2026-05-23 16:15:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8949202127135609445.gal : 11 ms
[2026-05-23 16:15:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11420264990017312506.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/CTLFireability8949202127135609445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11420264990017312506.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.09849e+34,0.433294,15064,224,25,1538,726,743,1006,133,1152,0
Converting to forward existential form...Done !
original formula: AG((((E(((AF((i5.u52.TrainState_15_0_0==1)) + (i5.u218.TrainState_15_2_39==1)) + ((EF((i10.u36.TrainState_4_1_7==1)) * (i8.u216.TrainStat...749
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((E(((!(EG(!((i5.u52.TrainState_15_0_0==1)))) + (i5.u218.TrainState_15_2_39==1)) + (...891
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
(forward)formula 0,0,0.659948,15344,1,0,12487,3145,5064,20901,651,4681,28088
FORMULA BART-PT-020-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 746 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6421545131803259029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12119557895462194596.kers'
[2026-05-23 16:15:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6421545131803259029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12119557895462194596.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2380 rows 980 cols 4760 entries
Finished phase 1 with 960 SingleSign rule and 0 generalized
[2026-05-23 16:15:06] [INFO ] Computed 20 invariants in 10 ms
Computed 20 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12119557895462194596.kers
Total runtime 13 ms.
[2026-05-23 16:15:07] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-23 16:15:07] [INFO ] Invariant cache hit.
[2026-05-23 16:15:08] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 16:15:08] [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 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60703ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62858 ms. Remains : 980/2640 places, 2380/4040 transitions.
[2026-05-23 16:16:08] [INFO ] Flatten gal took : 42 ms
[2026-05-23 16:16:08] [INFO ] Flatten gal took : 43 ms
[2026-05-23 16:16:09] [INFO ] Input system was already deterministic with 2380 transitions.
[2026-05-23 16:16:09] [INFO ] Flatten gal took : 41 ms
[2026-05-23 16:16:09] [INFO ] Flatten gal took : 43 ms
[2026-05-23 16:16:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12841182690149871.gal : 13 ms
[2026-05-23 16:16:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3270989675290815150.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/CTLFireability12841182690149871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3270989675290815150.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.36681e+33,2.47178,22380,2,1946,5,15308,6,0,6303,8251,0
Converting to forward existential form...Done !
original formula: E((TrainState_15_1_32==1) U ((TrainState_8_1_26==1) + !(AX((((TrainState_3_0_0==1) * AG((TrainState_10_0_0==1))) + (TrainState_12_0_0==1)...160
=> equivalent forward existential formula: ([(FwdU(Init,(TrainState_15_1_32==1)) * (TrainState_8_1_26==1))] != FALSE + ([((EY(FwdU(Init,(TrainState_15_1_32...353
Hit Full ! (commute/partial/dont) 2376/0/4
(forward)formula 0,1,5.89248,31272,1,0,18,33855,22,7,11157,22161,10
FORMULA BART-PT-020-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3946 edges and 2640 vertex of which 2348 / 2640 are part of one of the 18 SCC in 4 ms
Free SCC test removed 2330 places
Ensure Unique test removed 3577 transitions
Reduce isomorphic transitions removed 3577 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 298 transition count 311
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 296 place count 157 transition count 309
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 301 place count 156 transition count 305
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 307 place count 153 transition count 302
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 307 place count 153 transition count 292
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 327 place count 143 transition count 292
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 341 place count 129 transition count 278
Iterating global reduction 4 with 14 rules applied. Total rules applied 355 place count 129 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 359 place count 129 transition count 274
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 367 place count 121 transition count 266
Iterating global reduction 5 with 8 rules applied. Total rules applied 375 place count 121 transition count 266
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 381 place count 115 transition count 260
Iterating global reduction 5 with 6 rules applied. Total rules applied 387 place count 115 transition count 260
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 393 place count 109 transition count 254
Iterating global reduction 5 with 6 rules applied. Total rules applied 399 place count 109 transition count 254
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 403 place count 105 transition count 250
Iterating global reduction 5 with 4 rules applied. Total rules applied 407 place count 105 transition count 250
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 411 place count 101 transition count 246
Iterating global reduction 5 with 4 rules applied. Total rules applied 415 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 417 place count 99 transition count 244
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 99 transition count 244
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 443 place count 87 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 447 place count 87 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 451 place count 85 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 455 place count 85 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 459 place count 83 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 463 place count 83 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 467 place count 81 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 471 place count 81 transition count 210
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 475 place count 79 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 479 place count 79 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 483 place count 77 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 487 place count 77 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 491 place count 75 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 495 place count 75 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 499 place count 73 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 503 place count 73 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 507 place count 71 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 511 place count 71 transition count 180
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 515 place count 69 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 519 place count 69 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 523 place count 67 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 527 place count 67 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 531 place count 65 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 535 place count 65 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 539 place count 63 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 543 place count 63 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 547 place count 61 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 551 place count 61 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 555 place count 59 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 559 place count 59 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 563 place count 57 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 567 place count 57 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 571 place count 55 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 575 place count 55 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 579 place count 53 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 583 place count 53 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 587 place count 51 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 591 place count 51 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 595 place count 49 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 599 place count 49 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 603 place count 47 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 607 place count 47 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 611 place count 45 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 615 place count 45 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 619 place count 43 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 623 place count 43 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 627 place count 41 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 631 place count 41 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 29 with 4 rules applied. Total rules applied 635 place count 39 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 639 place count 39 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 4 rules applied. Total rules applied 643 place count 37 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 647 place count 37 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 651 place count 35 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 655 place count 35 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 659 place count 33 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 663 place count 33 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 667 place count 31 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 671 place count 31 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 4 rules applied. Total rules applied 675 place count 29 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 679 place count 29 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 4 rules applied. Total rules applied 683 place count 27 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 687 place count 27 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 4 rules applied. Total rules applied 691 place count 25 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 695 place count 25 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 699 place count 23 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 703 place count 23 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 4 rules applied. Total rules applied 707 place count 21 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 38 with 6 rules applied. Total rules applied 713 place count 21 transition count 28
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 717 place count 19 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 40 with 6 rules applied. Total rules applied 723 place count 19 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 40 with 3 Pre rules applied. Total rules applied 723 place count 19 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 40 with 6 rules applied. Total rules applied 729 place count 16 transition count 17
Applied a total of 729 rules in 77 ms. Remains 16 /2640 variables (removed 2624) and now considering 17/4040 (removed 4023) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9471146006555132681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17235395674375467264.kers'
[2026-05-23 16:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9471146006555132681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17235395674375467264.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 16 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 16:16:15] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17235395674375467264.kers
Total runtime 0 ms.
[2026-05-23 16:16:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 16:16:15] [INFO ] Invariant cache hit.
[2026-05-23 16:16:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-23 16:16:15] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-23 16:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/32 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/32 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 16/32 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 32 constraints, problems are : Problem set: 0 solved, 8 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 377ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/2640 places, 17/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 574 ms. Remains : 16/2640 places, 17/4040 transitions.
[2026-05-23 16:16:15] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:15] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:15] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-23 16:16:15] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:16:15] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:16:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4160788292126397002.gal : 0 ms
[2026-05-23 16:16:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17784683649222570163.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/CTLFireability4160788292126397002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17784683649222570163.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,256,0.00568,3828,2,37,5,131,5,0,82,82,0
Converting to forward existential form...Done !
original formula: E((TrainState_17_1_29==1) U A(EF((!(((TrainState_10_0_0==1)&&(TrainState_7_4_27==1))) * (A((TrainState_15_1_12==1) U (TrainState_3_0_0==1...271
=> equivalent forward existential formula: [((FwdU(Init,(TrainState_17_1_29==1)) * !(EG(!((!(E(TRUE U !((TrainState_13_1_4==1)))) * (TrainState_12_4_19==1)...570
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/0/3
(forward)formula 0,0,0.019544,4384,1,0,14,773,32,3,354,528,18
FORMULA BART-PT-020-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3953 edges and 2640 vertex of which 2364 / 2640 are part of one of the 18 SCC in 2 ms
Free SCC test removed 2346 places
Ensure Unique test removed 3600 transitions
Reduce isomorphic transitions removed 3600 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 280 transition count 295
Reduce places removed 132 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 134 rules applied. Total rules applied 280 place count 148 transition count 293
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 283 place count 146 transition count 292
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 283 place count 146 transition count 282
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 303 place count 136 transition count 282
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 316 place count 123 transition count 269
Iterating global reduction 3 with 13 rules applied. Total rules applied 329 place count 123 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 332 place count 123 transition count 266
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 340 place count 115 transition count 258
Iterating global reduction 4 with 8 rules applied. Total rules applied 348 place count 115 transition count 258
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 354 place count 109 transition count 252
Iterating global reduction 4 with 6 rules applied. Total rules applied 360 place count 109 transition count 252
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 366 place count 103 transition count 246
Iterating global reduction 4 with 6 rules applied. Total rules applied 372 place count 103 transition count 246
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 376 place count 99 transition count 242
Iterating global reduction 4 with 4 rules applied. Total rules applied 380 place count 99 transition count 242
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 384 place count 95 transition count 238
Iterating global reduction 4 with 4 rules applied. Total rules applied 388 place count 95 transition count 238
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 390 place count 93 transition count 236
Iterating global reduction 4 with 2 rules applied. Total rules applied 392 place count 93 transition count 236
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 416 place count 81 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 420 place count 81 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 424 place count 79 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 428 place count 79 transition count 214
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 432 place count 77 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 436 place count 77 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 440 place count 75 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 444 place count 75 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 448 place count 73 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 452 place count 73 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 456 place count 71 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 460 place count 71 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 464 place count 69 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 468 place count 69 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 472 place count 67 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 476 place count 67 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 480 place count 65 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 484 place count 65 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 488 place count 63 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 492 place count 63 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 496 place count 61 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 500 place count 61 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 504 place count 59 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 508 place count 59 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 512 place count 57 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 516 place count 57 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 520 place count 55 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 524 place count 55 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 528 place count 53 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 532 place count 53 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 536 place count 51 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 540 place count 51 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 544 place count 49 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 548 place count 49 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 552 place count 47 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 556 place count 47 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 560 place count 45 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 564 place count 45 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 568 place count 43 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 572 place count 43 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 576 place count 41 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 580 place count 41 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 584 place count 39 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 588 place count 39 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 592 place count 37 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 596 place count 37 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 600 place count 35 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 604 place count 35 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 608 place count 33 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 612 place count 33 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 29 with 4 rules applied. Total rules applied 616 place count 31 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 620 place count 31 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 4 rules applied. Total rules applied 624 place count 29 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 628 place count 29 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 632 place count 27 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 636 place count 27 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 640 place count 25 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 644 place count 25 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 648 place count 23 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 652 place count 23 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 4 rules applied. Total rules applied 656 place count 21 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 660 place count 21 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 4 rules applied. Total rules applied 664 place count 19 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 668 place count 19 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 4 rules applied. Total rules applied 672 place count 17 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 676 place count 17 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 680 place count 15 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 37 with 6 rules applied. Total rules applied 686 place count 15 transition count 20
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 690 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 39 with 4 rules applied. Total rules applied 694 place count 13 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 39 with 1 Pre rules applied. Total rules applied 694 place count 13 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 39 with 2 rules applied. Total rules applied 696 place count 12 transition count 13
Applied a total of 696 rules in 87 ms. Remains 12 /2640 variables (removed 2628) and now considering 13/4040 (removed 4027) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4048179258408041916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6342555287507358970.kers'
[2026-05-23 16:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4048179258408041916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6342555287507358970.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 15 ms.
// Phase 1: matrix 12 rows 6 cols 12 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 16:16:15] [INFO ] Computed 6 invariants in 15 ms
Computed 6 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6342555287507358970.kers
Total runtime 16 ms.
[2026-05-23 16:16:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 16:16:15] [INFO ] Invariant cache hit.
[2026-05-23 16:16:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-23 16:16:15] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 16:16:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 24 constraints, problems are : Problem set: 0 solved, 6 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 286ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/2640 places, 13/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 468 ms. Remains : 12/2640 places, 13/4040 transitions.
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:16] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:16:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14703782123287972775.gal : 0 ms
[2026-05-23 16:16:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1458090900094795307.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/CTLFireability14703782123287972775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1458090900094795307.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,64,0.004618,3792,2,22,5,84,5,0,62,51,0
Converting to forward existential form...Done !
original formula: AF(((TrainState_14_4_29==1) + (EG(((TrainState_8_1_8==1)&&(TrainState_18_1_34==1))) * !(A(((TrainState_16_0_0==1)&&(TrainState_17_0_0==1)...186
=> equivalent forward existential formula: [FwdG(Init,!(((TrainState_14_4_29==1) + (EG(((TrainState_8_1_8==1)&&(TrainState_18_1_34==1))) * !(!((E(!((TrainS...304
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/0/3
(forward)formula 0,0,0.01329,4356,1,0,20,517,35,13,266,553,24
FORMULA BART-PT-020-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4026 edges and 2640 vertex of which 2629 / 2640 are part of one of the 20 SCC in 2 ms
Free SCC test removed 2609 places
Ensure Unique test removed 4002 transitions
Reduce isomorphic transitions removed 4002 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 16 transition count 23
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 15 transition count 20
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 25 place count 12 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 12 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 12 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 10 transition count 11
Applied a total of 34 rules in 16 ms. Remains 10 /2640 variables (removed 2630) and now considering 11/4040 (removed 4029) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4303537677269877056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13956832703444836739.kers'
[2026-05-23 16:16:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4303537677269877056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13956832703444836739.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 10 rows 5 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-23 16:16:16] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13956832703444836739.kers
Total runtime 0 ms.
[2026-05-23 16:16:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-23 16:16:16] [INFO ] Invariant cache hit.
[2026-05-23 16:16:16] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-23 16:16:16] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-23 16:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 25 constraints, problems are : Problem set: 0 solved, 5 unsolved in 121 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/20 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 30 constraints, problems are : Problem set: 0 solved, 5 unsolved in 126 ms.
Refiners :[Domain max(s): 10/10 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/2640 places, 11/4040 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 346 ms. Remains : 10/2640 places, 11/4040 transitions.
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:16] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:16:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13082409220547833340.gal : 1 ms
[2026-05-23 16:16:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3285111566708199716.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/CTLFireability13082409220547833340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3285111566708199716.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,32,0.005007,3788,2,28,5,92,5,0,52,58,0
Converting to forward existential form...Done !
original formula: E(((!(A(AF((TrainState_1_1_22==1)) U (TrainState_13_2_31==1))) * (TrainState_6_3_30==1)) * (TrainState_3_3_18==1)) U EG((TrainState_16_1_...163
=> equivalent forward existential formula: [FwdG(FwdU(Init,((!(!((E(!((TrainState_13_2_31==1)) U (!(!(EG(!((TrainState_1_1_22==1))))) * !((TrainState_13_2_...288
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 8/0/3
Hit Full ! (commute/partial/dont) 8/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.014313,4348,1,0,14,347,41,6,240,282,20
FORMULA BART-PT-020-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2026-05-23 16:16:16] [INFO ] Flatten gal took : 210 ms
[2026-05-23 16:16:17] [INFO ] Flatten gal took : 230 ms
[2026-05-23 16:16:17] [INFO ] Applying decomposition
[2026-05-23 16:16:17] [INFO ] Flatten gal took : 190 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/graph16500865526124470948.txt' '-o' '/tmp/graph16500865526124470948.bin' '-w' '/tmp/graph16500865526124470948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16500865526124470948.bin' '-l' '-1' '-v' '-w' '/tmp/graph16500865526124470948.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:16:18] [INFO ] Decomposing Gal with order
[2026-05-23 16:16:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:16:18] [INFO ] Removed a total of 306 redundant transitions.
[2026-05-23 16:16:18] [INFO ] Flatten gal took : 264 ms
[2026-05-23 16:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2026-05-23 16:16:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2707949601563567212.gal : 20 ms
[2026-05-23 16:16:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16040643386416820413.ctl : 55 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/CTLFireability2707949601563567212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16040643386416820413.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,2.57916e+42,2.58091,32804,709,75,15094,2989,2511,14993,239,2343,0
Converting to forward existential form...Done !
original formula: ((EX(EG((EG((((((((((i19.i11.u115.TrainState_8_3_9==0)&&(i18.i7.u19.TrainState_1_2_5==0))&&((i19.i0.u166.TrainState_8_3_7==0)&&(i19.i11.u...403598
=> equivalent forward existential formula: ([(FwdU((((((((((((FwdU((Init * !((EX(EG((EG((((((((((i19.i11.u115.TrainState_8_3_9==0)&&(i18.i7.u19.TrainState_...1475801
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 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
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
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
(forward)formula 0,1,49.7239,984804,1,0,1.39725e+06,314967,45195,6.30453e+06,3313,698142,1355193
FORMULA BART-PT-020-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(A(((((((((((!((!(AG(((((((((((((i2.i0.u47.TrainState_6_1_7==1)||(i12.i0.u550.TrainState_9_1_27==1))||((i0.i0.u44.TrainState_2_1_9==1)||...180972
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((E(((((((((((((i2.i0.u47.TrainState_6_1_7==1)||(i12.i0.u550.TrainState_9_1_27==1))||(...336621
(forward)formula 1,0,153.103,2136032,1,0,3.56377e+06,639814,45569,1.35708e+07,3313,1.93107e+06,2220586
FORMULA BART-PT-020-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(AF((AX(((((((i16.i1.u3.TrainState_13_1_1==1)||(i17.i4.u4.TrainState_14_1_1==1))||((i6.i1.u14.TrainState_15_1_1==1)||(i8.i0.u15.TrainSta...527977
=> equivalent forward existential formula: ((([(FwdU(((((((FwdU(Init,!(EG(!((!(EX(!(((((((i16.i1.u3.TrainState_13_1_1==1)||(i17.i4.u4.TrainState_14_1_1==1)...1764755
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
(forward)formula 2,0,166.623,2193168,1,0,3.67498e+06,669941,47909,1.38752e+07,3518,2.01738e+06,2356987
FORMULA BART-PT-020-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EF(((((((((((AF(((((((((((((i2.i0.u47.TrainState_6_1_31==0)&&(i2.i6.u804.TrainState_6_2_35==0))&&((i6.i11.u818.TrainState_15_2_37==0)&&(...125511
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((((((((((!(EG(!(((((((((((((i2.i0.u47.TrainState_6_1_31==0)&&(i2.i6.u804.TrainState_6_2_...125572
(forward)formula 3,1,187.461,2201828,1,0,3.68747e+06,670872,10539,1.38945e+07,781,2.01905e+06,38011
FORMULA BART-PT-020-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 1283152 ms.
BK_STOP 1779553177748
--------------------
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-020"
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-020, 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-177946788100250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-020.tgz
mv BART-PT-020 execution
cd execution
if [ "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 '
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 ;