Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366100282.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 7.8K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 201K 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 ASLink-PT-01a-CTLFireability-2024-00
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-01
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-02
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-03
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-04
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-05
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-06
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-07
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-08
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-09
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-10
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-11
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-12
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-13
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-14
FORMULA_NAME ASLink-PT-01a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779470092135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 17:14:53] [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-22 17:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:14:53] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-05-22 17:14:53] [INFO ] Transformed 431 places.
[2026-05-22 17:14:53] [INFO ] Transformed 735 transitions.
[2026-05-22 17:14:53] [INFO ] Found NUPN structural information;
[2026-05-22 17:14:54] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 143 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 422 transition count 725
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 421 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 421 transition count 724
Applied a total of 14 rules in 73 ms. Remains 421 /431 variables (removed 10) and now considering 724/728 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1330609019863851357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5215439403808140891.kers'
[2026-05-22 17:14:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1330609019863851357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5215439403808140891.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 724 rows 421 cols 2761 entries
Finished phase 1 with 144 SingleSign rule and 204 generalized
[2026-05-22 17:14:54] [INFO ] Computed 73 invariants in 3 ms
Computed 73 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5215439403808140891.kers
Total runtime 4 ms.
[2026-05-22 17:14:54] [INFO ] Implicit Places using invariants in 766 ms returned [1, 19, 20, 23, 70, 199, 204, 221, 260, 282, 283, 301, 309, 317, 323, 335, 341, 349, 355, 361]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 802 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/431 places, 724/728 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 391 transition count 714
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 391 transition count 714
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 385 transition count 708
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 385 transition count 708
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 382 transition count 705
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 382 transition count 705
Applied a total of 38 rules in 51 ms. Remains 382 /401 variables (removed 19) and now considering 705/724 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12321509841573441267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4581914642098416629.kers'
[2026-05-22 17:14:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12321509841573441267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4581914642098416629.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 705 rows 382 cols 2632 entries
Finished phase 1 with 179 SingleSign rule and 150 generalized
[2026-05-22 17:14:55] [INFO ] Computed 53 invariants in 3 ms
Computed 53 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4581914642098416629.kers
Total runtime 4 ms.
[2026-05-22 17:14:55] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-22 17:14:55] [INFO ] Invariant cache hit.
[2026-05-22 17:14:56] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 382/431 places, 705/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1933 ms. Remains : 382/431 places, 705/728 transitions.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 705/705 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2026-05-22 17:14:56] [INFO ] Invariant cache hit.
[2026-05-22 17:14:56] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-22 17:14:56] [INFO ] Invariant cache hit.
[2026-05-22 17:14:56] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2026-05-22 17:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (OVERLAPS) 1/382 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1087 variables, and 58 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (OVERLAPS) 1/382 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Problem TDEAD677 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 5/58 constraints. Problems are: Problem set: 1 solved, 703 unsolved
Problem TDEAD546 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD671 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 13/71 constraints. Problems are: Problem set: 15 solved, 689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1087 variables, and 71 constraints, problems are : Problem set: 15 solved, 689 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 0/704 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 15 solved, 689 unsolved
Search for dead transitions found 15 dead transitions in 60548ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 382/382 places, 690/705 transitions.
Applied a total of 0 rules in 7 ms. Remains 382 /382 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61557 ms. Remains : 382/382 places, 690/705 transitions.
Support contains 143 out of 382 places after structural reductions.
[2026-05-22 17:15:58] [INFO ] Flatten gal took : 182 ms
[2026-05-22 17:15:58] [INFO ] Flatten gal took : 66 ms
[2026-05-22 17:15:58] [INFO ] Input system was already deterministic with 690 transitions.
RANDOM walk for 40000 steps (799 resets) in 2058 ms. (19 steps per ms) remains 59/110 properties
BEST_FIRST walk for 4003 steps (32 resets) in 87 ms. (45 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 53 ms. (74 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (30 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 90 ms. (43 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (31 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (33 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (25 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (29 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (22 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (26 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (26 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (23 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (25 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (29 resets) in 22 ms. (173 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (26 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (23 resets) in 34 ms. (114 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4002 steps (29 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (33 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (24 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (24 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (27 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (30 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (25 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (29 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (24 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (29 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (29 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (27 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (25 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (25 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (27 resets) in 22 ms. (173 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (28 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (33 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (27 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (21 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (36 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (27 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (31 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (23 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (25 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (24 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (22 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (27 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (30 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (20 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (24 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9757991686071585462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8847449559623326521.kers'
[2026-05-22 17:15:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9757991686071585462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8847449559623326521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 690 rows 382 cols 2572 entries
Finished phase 1 with 177 SingleSign rule and 150 generalized
[2026-05-22 17:15:59] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8847449559623326521.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 55/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 41/179 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp97 is UNSAT
At refinement iteration 5 (OVERLAPS) 196/375 variables, 40/51 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/52 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 2/54 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/54 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 7/382 variables, 4/58 constraints. Problems are: Problem set: 6 solved, 52 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1072 variables, and 58 constraints, problems are : Problem set: 6 solved, 52 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 47/119 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 52/171 variables, 6/11 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 200/371 variables, 38/49 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/49 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 11/382 variables, 6/55 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 3/58 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 2/60 constraints. Problems are: Problem set: 6 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/61 constraints. Problems are: Problem set: 6 solved, 52 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1072 variables, and 61 constraints, problems are : Problem set: 6 solved, 52 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/382 constraints, PredecessorRefiner: 0/58 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10077ms problems are : Problem set: 6 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 382 transition count 658
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 350 transition count 655
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 347 transition count 655
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 70 place count 347 transition count 627
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 137 place count 308 transition count 627
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 142 place count 308 transition count 622
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 147 place count 303 transition count 622
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 152 place count 298 transition count 617
Iterating global reduction 5 with 5 rules applied. Total rules applied 157 place count 298 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 162 place count 297 transition count 613
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 165 place count 294 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 167 place count 292 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 292 transition count 611
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 205 place count 274 transition count 593
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 206 place count 273 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 207 place count 273 transition count 592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 208 place count 272 transition count 591
Iterating global reduction 7 with 1 rules applied. Total rules applied 209 place count 272 transition count 591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 210 place count 271 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 271 transition count 590
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 271 transition count 588
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 215 place count 269 transition count 588
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 217 place count 269 transition count 588
Applied a total of 217 rules in 118 ms. Remains 269 /382 variables (removed 113) and now considering 588/690 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 269/382 places, 588/690 transitions.
RANDOM walk for 40000 steps (832 resets) in 518 ms. (77 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (36 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (37 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (39 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (48 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (31 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (38 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (39 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (29 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (43 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (32 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (37 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (37 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (48 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (35 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (29 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (38 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (33 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (39 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (39 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (43 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (36 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (21 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (45 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (31 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (40 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (36 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (38 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (39 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (38 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (30 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (41 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
Interrupted probabilistic random walk after 236871 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :7 out of 52
Probabilistic random walk after 236871 steps, saw 80898 distinct states, run finished after 3006 ms. (steps per millisecond=78 ) properties seen :7
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-875637881443171143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6050751721719758797.kers'
[2026-05-22 17:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-875637881443171143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6050751721719758797.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 588 rows 266 cols 2323 entries
Finished phase 1 with 79 SingleSign rule and 147 generalized
[2026-05-22 17:16:13] [INFO ] Computed 43 invariants in 2 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6050751721719758797.kers
Total runtime 3 ms.
[2026-05-22 17:16:13] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 13/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 110/264 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 5/269 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 588/857 variables, 269/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/857 variables, 11/324 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/857 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/857 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 324 constraints, problems are : Problem set: 0 solved, 45 unsolved in 6149 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 269/269 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 13/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 110/264 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 5/269 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp105 is UNSAT
After SMT solving in domain Int declared 857/857 variables, and 313 constraints, problems are : Problem set: 45 solved, 0 unsolved in 4389 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 269/269 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10593ms problems are : Problem set: 45 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
FORMULA ASLink-PT-01a-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 17:16:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-22 17:16:24] [INFO ] Flatten gal took : 67 ms
FORMULA ASLink-PT-01a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 17:16:24] [INFO ] Flatten gal took : 52 ms
[2026-05-22 17:16:24] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 45 out of 382 places (down from 53) after GAL structural reductions.
FORMULA ASLink-PT-01a-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 690/690 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 378 transition count 686
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 378 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 378 transition count 685
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 375 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 375 transition count 682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 374 transition count 681
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 374 transition count 681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 373 transition count 680
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 373 transition count 680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 372 transition count 679
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 372 transition count 679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 371 transition count 678
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 371 transition count 678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 370 transition count 677
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 370 transition count 677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 676
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 676
Applied a total of 27 rules in 60 ms. Remains 369 /382 variables (removed 13) and now considering 676/690 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12914929147249969811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6720233056974127920.kers'
[2026-05-22 17:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12914929147249969811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6720233056974127920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 676 rows 369 cols 2526 entries
Finished phase 1 with 170 SingleSign rule and 144 generalized
[2026-05-22 17:16:24] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6720233056974127920.kers
Total runtime 4 ms.
[2026-05-22 17:16:24] [INFO ] Implicit Places using invariants in 453 ms returned [29, 30, 48, 209, 214, 215, 250, 254, 272, 305, 318]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 469 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 358/382 places, 676/690 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 356 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 356 transition count 674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 354 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 354 transition count 672
Applied a total of 8 rules in 17 ms. Remains 354 /358 variables (removed 4) and now considering 672/676 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5890100532415995846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9484728435609193234.kers'
[2026-05-22 17:16:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5890100532415995846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9484728435609193234.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 354 cols 2421 entries
Finished phase 1 with 222 SingleSign rule and 88 generalized
[2026-05-22 17:16:24] [INFO ] Computed 44 invariants in 3 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9484728435609193234.kers
Total runtime 4 ms.
[2026-05-22 17:16:25] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-22 17:16:25] [INFO ] Invariant cache hit.
[2026-05-22 17:16:25] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 354/382 places, 672/690 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1594 ms. Remains : 354/382 places, 672/690 transitions.
[2026-05-22 17:16:26] [INFO ] Flatten gal took : 22 ms
[2026-05-22 17:16:26] [INFO ] Flatten gal took : 21 ms
[2026-05-22 17:16:26] [INFO ] Input system was already deterministic with 672 transitions.
[2026-05-22 17:16:26] [INFO ] Flatten gal took : 34 ms
[2026-05-22 17:16:26] [INFO ] Flatten gal took : 33 ms
[2026-05-22 17:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9242921873007260467.gal : 19 ms
[2026-05-22 17:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9998954516332659849.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9242921873007260467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9998954516332659849.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58935e+08,6.96257,182756,2,36835,5,481785,6,0,2090,547180,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 17:16:56] [INFO ] Flatten gal took : 40 ms
[2026-05-22 17:16:56] [INFO ] Applying decomposition
[2026-05-22 17:16:56] [INFO ] Flatten gal took : 18 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/graph5858758706449868150.txt' '-o' '/tmp/graph5858758706449868150.bin' '-w' '/tmp/graph5858758706449868150.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5858758706449868150.bin' '-l' '-1' '-v' '-w' '/tmp/graph5858758706449868150.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:16:56] [INFO ] Decomposing Gal with order
[2026-05-22 17:16:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:16:56] [INFO ] Removed a total of 1154 redundant transitions.
[2026-05-22 17:16:56] [INFO ] Flatten gal took : 104 ms
[2026-05-22 17:16:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 19 ms.
[2026-05-22 17:16:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8542601112390233864.gal : 9 ms
[2026-05-22 17:16:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11810671193878421959.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/CTLFireability8542601112390233864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11810671193878421959.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.58935e+08,1.2654,49068,1946,260,75323,9510,1258,151524,155,55457,0


Converting to forward existential form...Done !
original formula: AX((AG(((i8.u109.p292!=1)||(i8.u109.p384!=1))) + (EF(((i0.u4.p13==0)||(i0.u24.p84==0))) * EF(((i9.i2.u98.p268==1)&&(i9.i1.u108.p383==1)))...158
=> equivalent forward existential formula: [(FwdU((EY(Init) * !((E(TRUE U ((i0.u4.p13==0)||(i0.u24.p84==0))) * E(TRUE U ((i9.i2.u98.p268==1)&&(i9.i1.u108.p...227
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t275, t571, t592, t642, i3.i2.t5, i4.t4, i4.i0.t0, i5.i1.u39.t64, i5.i2.u47.t...404
(forward)formula 0,1,2.1948,52796,1,0,75323,9510,8387,172902,682,55457,357873
FORMULA ASLink-PT-01a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 690/690 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 378 transition count 686
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 378 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 378 transition count 685
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 375 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 375 transition count 682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 374 transition count 681
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 374 transition count 681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 373 transition count 680
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 373 transition count 680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 372 transition count 679
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 372 transition count 679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 371 transition count 678
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 371 transition count 678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 370 transition count 677
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 370 transition count 677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 676
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 676
Applied a total of 27 rules in 52 ms. Remains 369 /382 variables (removed 13) and now considering 676/690 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8833275931544499584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1429482867009887722.kers'
[2026-05-22 17:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8833275931544499584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1429482867009887722.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 676 rows 369 cols 2526 entries
Finished phase 1 with 170 SingleSign rule and 144 generalized
[2026-05-22 17:16:59] [INFO ] Computed 55 invariants in 10 ms
Computed 55 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1429482867009887722.kers
Total runtime 12 ms.
[2026-05-22 17:16:59] [INFO ] Implicit Places using invariants in 431 ms returned [29, 30, 48, 215, 250, 254, 272, 273, 305]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 433 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 360/382 places, 676/690 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 359 transition count 675
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 358 transition count 674
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 358 transition count 674
Applied a total of 4 rules in 13 ms. Remains 358 /360 variables (removed 2) and now considering 674/676 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17181151819703039760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9350214273276560415.kers'
[2026-05-22 17:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17181151819703039760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9350214273276560415.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 358 cols 2440 entries
Finished phase 1 with 217 SingleSign rule and 95 generalized
[2026-05-22 17:16:59] [INFO ] Computed 46 invariants in 2 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9350214273276560415.kers
Total runtime 4 ms.
[2026-05-22 17:16:59] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-22 17:16:59] [INFO ] Invariant cache hit.
[2026-05-22 17:17:00] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 358/382 places, 674/690 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1544 ms. Remains : 358/382 places, 674/690 transitions.
[2026-05-22 17:17:00] [INFO ] Flatten gal took : 19 ms
[2026-05-22 17:17:00] [INFO ] Flatten gal took : 16 ms
[2026-05-22 17:17:00] [INFO ] Input system was already deterministic with 674 transitions.
[2026-05-22 17:17:00] [INFO ] Flatten gal took : 16 ms
[2026-05-22 17:17:00] [INFO ] Flatten gal took : 41 ms
[2026-05-22 17:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7680562874596268847.gal : 4 ms
[2026-05-22 17:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13114400525527247282.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/CTLFireability7680562874596268847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13114400525527247282.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,1.58935e+08,6.66161,163348,2,43180,5,453004,6,0,2108,480431,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 17:17:30] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:17:30] [INFO ] Applying decomposition
[2026-05-22 17:17:30] [INFO ] Flatten gal took : 13 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/graph2240353958446048775.txt' '-o' '/tmp/graph2240353958446048775.bin' '-w' '/tmp/graph2240353958446048775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2240353958446048775.bin' '-l' '-1' '-v' '-w' '/tmp/graph2240353958446048775.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:17:30] [INFO ] Decomposing Gal with order
[2026-05-22 17:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:17:30] [INFO ] Removed a total of 1159 redundant transitions.
[2026-05-22 17:17:31] [INFO ] Flatten gal took : 35 ms
[2026-05-22 17:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 16 ms.
[2026-05-22 17:17:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13346362841048615361.gal : 6 ms
[2026-05-22 17:17:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5080500438806156856.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/CTLFireability13346362841048615361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5080500438806156856.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.58935e+08,2.30655,92828,2899,274,146589,10657,1242,340654,152,64048,0


Converting to forward existential form...Done !
original formula: ((EG((((i5.u27.p93==1)&&(i5.u69.p222==1))||((((i1.u12.p39==0)||(i1.u83.p259==0))&&((i1.u13.p42==0)||(i1.u78.p245==0)))&&((i2.u28.p178==1)...340
=> equivalent forward existential formula: [(FwdU((Init * !((EG((((i5.u27.p93==1)&&(i5.u69.p222==1))||((((i1.u12.p39==0)||(i1.u83.p259==0))&&((i1.u13.p42==...536
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t276, t277, t573, t594, t647, i2.t0, i3.u38.t64, i3.u47.t54, i3.u54.t44, i4.u...433
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 690/690 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 378 transition count 686
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 378 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 378 transition count 685
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 375 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 375 transition count 682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 374 transition count 681
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 374 transition count 681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 373 transition count 680
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 373 transition count 680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 372 transition count 679
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 372 transition count 679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 371 transition count 678
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 371 transition count 678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 370 transition count 677
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 370 transition count 677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 676
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 676
Applied a total of 27 rules in 44 ms. Remains 369 /382 variables (removed 13) and now considering 676/690 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3087701024531988322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5904543512017066990.kers'
[2026-05-22 17:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3087701024531988322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5904543512017066990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 676 rows 369 cols 2526 entries
Finished phase 1 with 170 SingleSign rule and 144 generalized
[2026-05-22 17:18:01] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5904543512017066990.kers
Total runtime 14 ms.
[2026-05-22 17:18:01] [INFO ] Implicit Places using invariants in 365 ms returned [29, 30, 48, 209, 214, 215, 250, 254, 273, 305, 318]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 368 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 358/382 places, 676/690 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 356 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 356 transition count 674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 354 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 354 transition count 672
Applied a total of 8 rules in 14 ms. Remains 354 /358 variables (removed 4) and now considering 672/676 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14141666065213389363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9588068542687610932.kers'
[2026-05-22 17:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14141666065213389363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9588068542687610932.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 354 cols 2424 entries
Finished phase 1 with 222 SingleSign rule and 88 generalized
[2026-05-22 17:18:01] [INFO ] Computed 44 invariants in 3 ms
Computed 44 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9588068542687610932.kers
Total runtime 4 ms.
[2026-05-22 17:18:01] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-22 17:18:01] [INFO ] Invariant cache hit.
[2026-05-22 17:18:02] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 354/382 places, 672/690 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1619 ms. Remains : 354/382 places, 672/690 transitions.
[2026-05-22 17:18:02] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:18:02] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:18:02] [INFO ] Input system was already deterministic with 672 transitions.
[2026-05-22 17:18:02] [INFO ] Flatten gal took : 12 ms
[2026-05-22 17:18:02] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:18:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14977544149845124962.gal : 4 ms
[2026-05-22 17:18:02] [INFO ] Time to serialize properties into /tmp/CTLFireability16306250304917285812.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/CTLFireability14977544149845124962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16306250304917285812.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,1.58935e+08,7.3529,180928,2,36988,5,477598,6,0,2090,542217,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 17:18:32] [INFO ] Flatten gal took : 26 ms
[2026-05-22 17:18:33] [INFO ] Applying decomposition
[2026-05-22 17:18:33] [INFO ] Flatten gal took : 16 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/graph10829361677494130037.txt' '-o' '/tmp/graph10829361677494130037.bin' '-w' '/tmp/graph10829361677494130037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10829361677494130037.bin' '-l' '-1' '-v' '-w' '/tmp/graph10829361677494130037.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:18:33] [INFO ] Decomposing Gal with order
[2026-05-22 17:18:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:18:33] [INFO ] Removed a total of 1155 redundant transitions.
[2026-05-22 17:18:33] [INFO ] Flatten gal took : 40 ms
[2026-05-22 17:18:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 15 ms.
[2026-05-22 17:18:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1335488801848656428.gal : 4 ms
[2026-05-22 17:18:33] [INFO ] Time to serialize properties into /tmp/CTLFireability2763194703391116669.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/CTLFireability1335488801848656428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2763194703391116669.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,1.58935e+08,1.79641,57652,2039,476,94710,10183,1171,193230,183,50841,0


Converting to forward existential form...Done !
original formula: (AG((((AX(((i6.u64.p213==0)||(i6.u86.p278==0))) + ((i2.u19.p52==1)&&(i2.u73.p241==1))) + (((i0.u4.p10==1)&&(i0.u25.p85==1))||((i8.u106.p2...388
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(!(E(TRUE U !((((!(EX(!(((i6.u64.p213==0)||(i6.u86.p278==0))))) + ((i2.u19.p52==1)&&(i2.u73....725
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t276, t571, t592, t642, i1.t5, i3.t4, i3.t0, i5.u37.t64, i5.u47.t54, i5.u54.t44, ...416
(forward)formula 0,1,2.3582,57864,1,0,94710,10183,7882,193230,1002,50841,354565
FORMULA ASLink-PT-01a-CTLFireability-2024-09 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 : 382/382 places, 690/690 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 381 transition count 655
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 347 transition count 654
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 345 transition count 654
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 71 place count 345 transition count 625
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 140 place count 305 transition count 625
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 6 rules applied. Total rules applied 146 place count 304 transition count 620
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 152 place count 298 transition count 620
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 152 place count 298 transition count 615
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 162 place count 293 transition count 615
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 167 place count 288 transition count 610
Iterating global reduction 5 with 5 rules applied. Total rules applied 172 place count 288 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 177 place count 287 transition count 606
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 180 place count 284 transition count 606
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 182 place count 282 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 184 place count 282 transition count 604
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 218 place count 265 transition count 587
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 219 place count 264 transition count 586
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 264 transition count 586
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 221 place count 263 transition count 585
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 263 transition count 585
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 223 place count 262 transition count 584
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 262 transition count 584
Applied a total of 224 rules in 112 ms. Remains 262 /382 variables (removed 120) and now considering 584/690 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18125211830128815928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2225870085056406841.kers'
[2026-05-22 17:18:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18125211830128815928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2225870085056406841.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 14 ms.
// Phase 1: matrix 584 rows 261 cols 2290 entries
Finished phase 1 with 80 SingleSign rule and 142 generalized
[2026-05-22 17:18:35] [INFO ] Computed 40 invariants in 17 ms
Computed 40 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2225870085056406841.kers
Total runtime 18 ms.
[2026-05-22 17:18:35] [INFO ] Implicit Places using invariants in 234 ms returned [20, 21, 39, 103, 112, 119, 141, 176, 180, 198, 199, 220, 232, 253]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 250 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 248/382 places, 584/690 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 248 transition count 564
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 228 transition count 564
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 40 place count 228 transition count 559
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 222 transition count 559
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 63 place count 218 transition count 551
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 71 place count 210 transition count 551
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 78 place count 203 transition count 544
Iterating global reduction 4 with 7 rules applied. Total rules applied 85 place count 203 transition count 544
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 203 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 88 place count 203 transition count 540
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 202 transition count 540
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 92 place count 200 transition count 538
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 200 transition count 538
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 199 transition count 537
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 199 transition count 537
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 116 place count 189 transition count 527
Applied a total of 116 rules in 44 ms. Remains 189 /248 variables (removed 59) and now considering 527/584 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5941321398097407438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10284057745869761064.kers'
[2026-05-22 17:18:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5941321398097407438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10284057745869761064.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 527 rows 188 cols 2073 entries
Finished phase 1 with 85 SingleSign rule and 83 generalized
[2026-05-22 17:18:36] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10284057745869761064.kers
Total runtime 3 ms.
[2026-05-22 17:18:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-22 17:18:36] [INFO ] Invariant cache hit.
[2026-05-22 17:18:36] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 189/382 places, 527/690 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1197 ms. Remains : 189/382 places, 527/690 transitions.
[2026-05-22 17:18:36] [INFO ] Flatten gal took : 25 ms
[2026-05-22 17:18:36] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:18:36] [INFO ] Input system was already deterministic with 527 transitions.
[2026-05-22 17:18:36] [INFO ] Flatten gal took : 10 ms
[2026-05-22 17:18:36] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2511194290484913350.gal : 3 ms
[2026-05-22 17:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4368821495966198555.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/CTLFireability2511194290484913350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4368821495966198555.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,603054,4.6744,108740,2,21134,5,218906,6,0,1286,248846,0


Converting to forward existential form...Done !
original formula: EF(AG((p93!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p93!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t437, t440, t475, t476, t488, t492, t493, t494, t495, t496, t497, t498, t499, t500, t501, t50...338
Detected timeout of ITS tools.
[2026-05-22 17:19:07] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:19:07] [INFO ] Applying decomposition
[2026-05-22 17:19:07] [INFO ] Flatten gal took : 25 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/graph15818821652964677083.txt' '-o' '/tmp/graph15818821652964677083.bin' '-w' '/tmp/graph15818821652964677083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15818821652964677083.bin' '-l' '-1' '-v' '-w' '/tmp/graph15818821652964677083.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:19:07] [INFO ] Decomposing Gal with order
[2026-05-22 17:19:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:19:07] [INFO ] Removed a total of 1105 redundant transitions.
[2026-05-22 17:19:07] [INFO ] Flatten gal took : 23 ms
[2026-05-22 17:19:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 6 ms.
[2026-05-22 17:19:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8663204537920828116.gal : 3 ms
[2026-05-22 17:19:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9338316488819988573.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/CTLFireability8663204537920828116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9338316488819988573.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,603054,2.97237,89236,1368,1017,79238,33758,850,605853,174,151659,0


Converting to forward existential form...Done !
original formula: EF(AG((i2.u23.p93!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i2.u23.p93!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t437, t440, t505, t506, t507, t508, t509, u56.t500, u56.t501, u56.t502, u56.t503, u56.t517, u...434
(forward)formula 0,1,7.26667,185636,1,0,160846,57517,5764,1.41219e+06,1183,214524,608252
FORMULA ASLink-PT-01a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 690/690 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 378 transition count 686
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 378 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 378 transition count 685
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 375 transition count 682
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 375 transition count 682
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 374 transition count 681
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 374 transition count 681
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 373 transition count 680
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 373 transition count 680
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 372 transition count 679
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 372 transition count 679
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 371 transition count 678
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 371 transition count 678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 370 transition count 677
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 370 transition count 677
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 369 transition count 676
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 369 transition count 676
Applied a total of 27 rules in 115 ms. Remains 369 /382 variables (removed 13) and now considering 676/690 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18418643026890256366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3170732141178144821.kers'
[2026-05-22 17:19:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18418643026890256366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3170732141178144821.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 676 rows 369 cols 2526 entries
Finished phase 1 with 170 SingleSign rule and 144 generalized
[2026-05-22 17:19:14] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3170732141178144821.kers
Total runtime 5 ms.
[2026-05-22 17:19:14] [INFO ] Implicit Places using invariants in 364 ms returned [29, 30, 209, 214, 215, 250, 254, 272, 273, 305, 318]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 366 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 358/382 places, 676/690 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 356 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 356 transition count 674
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 354 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 354 transition count 672
Applied a total of 8 rules in 13 ms. Remains 354 /358 variables (removed 4) and now considering 672/676 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12991111093463318872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13539161269020882945.kers'
[2026-05-22 17:19:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12991111093463318872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13539161269020882945.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 354 cols 2431 entries
Finished phase 1 with 212 SingleSign rule and 98 generalized
[2026-05-22 17:19:14] [INFO ] Computed 44 invariants in 3 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13539161269020882945.kers
Total runtime 4 ms.
[2026-05-22 17:19:15] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-22 17:19:15] [INFO ] Invariant cache hit.
[2026-05-22 17:19:16] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 354/382 places, 672/690 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1745 ms. Remains : 354/382 places, 672/690 transitions.
[2026-05-22 17:19:16] [INFO ] Flatten gal took : 32 ms
[2026-05-22 17:19:16] [INFO ] Flatten gal took : 22 ms
[2026-05-22 17:19:16] [INFO ] Input system was already deterministic with 672 transitions.
[2026-05-22 17:19:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 17:19:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 17:19:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9753853557208640304.gal : 3 ms
[2026-05-22 17:19:16] [INFO ] Time to serialize properties into /tmp/CTLFireability551657821702007814.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/CTLFireability9753853557208640304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability551657821702007814.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58935e+08,7.53848,177200,2,38227,5,475478,6,0,2090,525761,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 17:19:46] [INFO ] Flatten gal took : 28 ms
[2026-05-22 17:19:46] [INFO ] Applying decomposition
[2026-05-22 17:19:46] [INFO ] Flatten gal took : 15 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/graph17929984185631109750.txt' '-o' '/tmp/graph17929984185631109750.bin' '-w' '/tmp/graph17929984185631109750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17929984185631109750.bin' '-l' '-1' '-v' '-w' '/tmp/graph17929984185631109750.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:19:46] [INFO ] Decomposing Gal with order
[2026-05-22 17:19:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:19:46] [INFO ] Removed a total of 1149 redundant transitions.
[2026-05-22 17:19:46] [INFO ] Flatten gal took : 45 ms
[2026-05-22 17:19:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2026-05-22 17:19:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13511928912967866594.gal : 4 ms
[2026-05-22 17:19:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13282946617735325836.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/CTLFireability13511928912967866594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13282946617735325836.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58935e+08,2.39664,74064,2344,500,100716,26277,1207,321027,190,101637,0


Converting to forward existential form...Done !
original formula: AX(EF(((EX(TRUE) * (i4.u21.p54==1)) * (i4.u21.p128==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((EX(TRUE) * (i4.u21.p54==1)) * (i4.u21.p128==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t275, t276, t277, t571, t592, t645, i1.t5, i4.u40.t64, i4.u47.t54, i4.u52.t44, i5...424
(forward)formula 0,1,4.14003,80744,1,0,101669,26277,8508,321027,1146,101637,581489
FORMULA ASLink-PT-01a-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 690/690 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 379 transition count 687
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 379 transition count 687
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 376 transition count 684
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 376 transition count 684
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 375 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 375 transition count 683
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 374 transition count 682
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 374 transition count 682
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 373 transition count 681
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 373 transition count 681
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 372 transition count 680
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 372 transition count 680
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 371 transition count 679
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 371 transition count 679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 370 transition count 678
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 370 transition count 678
Applied a total of 24 rules in 53 ms. Remains 370 /382 variables (removed 12) and now considering 678/690 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5861775153816644416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9750844744604172647.kers'
[2026-05-22 17:19:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5861775153816644416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9750844744604172647.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 678 rows 370 cols 2532 entries
Finished phase 1 with 171 SingleSign rule and 144 generalized
[2026-05-22 17:19:50] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9750844744604172647.kers
Total runtime 5 ms.
[2026-05-22 17:19:51] [INFO ] Implicit Places using invariants in 321 ms returned [29, 30, 48, 209, 215, 250, 254, 272, 273, 305, 318]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 334 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 359/382 places, 678/690 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 357 transition count 676
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 357 transition count 676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 355 transition count 674
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 355 transition count 674
Applied a total of 8 rules in 15 ms. Remains 355 /359 variables (removed 4) and now considering 674/678 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18205870403953466893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6650298582856335531.kers'
[2026-05-22 17:19:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18205870403953466893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6650298582856335531.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 355 cols 2433 entries
Finished phase 1 with 218 SingleSign rule and 93 generalized
[2026-05-22 17:19:51] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6650298582856335531.kers
Total runtime 3 ms.
[2026-05-22 17:19:51] [INFO ] Implicit Places using invariants in 343 ms returned []
[2026-05-22 17:19:51] [INFO ] Invariant cache hit.
[2026-05-22 17:19:52] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 355/382 places, 674/690 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1529 ms. Remains : 355/382 places, 674/690 transitions.
[2026-05-22 17:19:52] [INFO ] Flatten gal took : 16 ms
[2026-05-22 17:19:52] [INFO ] Flatten gal took : 14 ms
[2026-05-22 17:19:52] [INFO ] Input system was already deterministic with 674 transitions.
[2026-05-22 17:19:52] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:19:52] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10494073316596290069.gal : 3 ms
[2026-05-22 17:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13599232694388393044.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/CTLFireability10494073316596290069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599232694388393044.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,1.6064e+08,9.65665,193148,2,47076,5,550264,6,0,2096,591012,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 17:20:22] [INFO ] Flatten gal took : 15 ms
[2026-05-22 17:20:22] [INFO ] Applying decomposition
[2026-05-22 17:20:22] [INFO ] Flatten gal took : 12 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/graph17303949974660283728.txt' '-o' '/tmp/graph17303949974660283728.bin' '-w' '/tmp/graph17303949974660283728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17303949974660283728.bin' '-l' '-1' '-v' '-w' '/tmp/graph17303949974660283728.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:20:22] [INFO ] Decomposing Gal with order
[2026-05-22 17:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:20:22] [INFO ] Removed a total of 1163 redundant transitions.
[2026-05-22 17:20:22] [INFO ] Flatten gal took : 39 ms
[2026-05-22 17:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2026-05-22 17:20:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4566723101614136957.gal : 4 ms
[2026-05-22 17:20:22] [INFO ] Time to serialize properties into /tmp/CTLFireability18046844316407545921.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/CTLFireability4566723101614136957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18046844316407545921.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.6064e+08,1.79937,60688,2138,448,98972,9918,1220,204686,181,47966,0


Converting to forward existential form...Done !
original formula: AF((EG(((i2.u16.p45==1)&&(i2.u73.p238==1))) + ((EX((i5.i0.u28.p96!=1)) * AG((((i7.u123.p425!=1)||(i7.u124.p428!=1))||(i7.u125.p430!=1))))...207
=> equivalent forward existential formula: [FwdG(Init,!((EG(((i2.u16.p45==1)&&(i2.u73.p238==1))) + ((EX((i5.i0.u28.p96!=1)) * !(E(TRUE U !((((i7.u123.p425!...270
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t278, t573, t594, t644, i1.i2.t5, i4.i0.u38.t65, i4.i1.u46.t55, i4.i2.u53.t45, i5...407
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 8
Detected timeout of ITS tools.
[2026-05-22 17:20:52] [INFO ] Flatten gal took : 12 ms
[2026-05-22 17:20:52] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:20:52] [INFO ] Applying decomposition
[2026-05-22 17:20:52] [INFO ] Flatten gal took : 11 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/graph1337103925546350490.txt' '-o' '/tmp/graph1337103925546350490.bin' '-w' '/tmp/graph1337103925546350490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1337103925546350490.bin' '-l' '-1' '-v' '-w' '/tmp/graph1337103925546350490.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:20:52] [INFO ] Decomposing Gal with order
[2026-05-22 17:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:20:52] [INFO ] Removed a total of 1150 redundant transitions.
[2026-05-22 17:20:52] [INFO ] Flatten gal took : 42 ms
[2026-05-22 17:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 6 ms.
[2026-05-22 17:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2801961832235822545.gal : 5 ms
[2026-05-22 17:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6257667514533846447.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/CTLFireability2801961832235822545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6257667514533846447.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 2 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.8021e+08,3.07351,115448,2999,613,147134,13886,1410,601670,240,86535,0


Converting to forward existential form...Done !
original formula: ((EG((((i4.i1.u27.p93==1)&&(i4.i1.u59.p222==1))||((((i0.i1.u11.p39==0)||(i0.i1.u76.p259==0))&&((i0.i1.u12.p42==0)||(i0.i0.u70.p245==0)))&...357
=> equivalent forward existential formula: [(FwdU((Init * !((EG((((i4.i1.u27.p93==1)&&(i4.i1.u59.p222==1))||((((i0.i1.u11.p39==0)||(i0.i1.u76.p259==0))&&((...565
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t10, t283, t284, t610, t660, i2.i0.u34.t68, i2.i1.u41.t58, i2.i2.u47.t48, i4....390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,25.7624,650120,1,0,976489,17939,9732,3.13463e+06,1300,86535,2299222
FORMULA ASLink-PT-01a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((EG(((i0.i0.u13.p45==1)&&(i0.i0.u67.p238==1))) + ((EX((i5.u28.p96!=1)) * AG((((i7.u111.p425!=1)||(i7.u112.p428!=1))||(i7.u113.p430!=1)...207
=> equivalent forward existential formula: [FwdG(Init,!((EG(((i0.i0.u13.p45==1)&&(i0.i0.u67.p238==1))) + ((EX((i5.u28.p96!=1)) * !(E(TRUE U !((((i7.u111.p4...270
(forward)formula 1,0,220.665,2206380,1,0,3.25767e+06,23013,3222,1.23993e+07,539,141529,1092426
FORMULA ASLink-PT-01a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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

BK_STOP 1779470674258

--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r002-oct2-177944366100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;