Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700426.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CO4-PT-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 332K 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 CO4-PT-19-CTLFireability-2024-00
FORMULA_NAME CO4-PT-19-CTLFireability-2024-01
FORMULA_NAME CO4-PT-19-CTLFireability-2024-02
FORMULA_NAME CO4-PT-19-CTLFireability-2024-03
FORMULA_NAME CO4-PT-19-CTLFireability-2024-04
FORMULA_NAME CO4-PT-19-CTLFireability-2024-05
FORMULA_NAME CO4-PT-19-CTLFireability-2024-06
FORMULA_NAME CO4-PT-19-CTLFireability-2024-07
FORMULA_NAME CO4-PT-19-CTLFireability-2024-08
FORMULA_NAME CO4-PT-19-CTLFireability-2024-09
FORMULA_NAME CO4-PT-19-CTLFireability-2024-10
FORMULA_NAME CO4-PT-19-CTLFireability-2024-11
FORMULA_NAME CO4-PT-19-CTLFireability-2024-12
FORMULA_NAME CO4-PT-19-CTLFireability-2024-13
FORMULA_NAME CO4-PT-19-CTLFireability-2024-14
FORMULA_NAME CO4-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779526186768

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 08:49:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:49:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:49:48] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2026-05-23 08:49:48] [INFO ] Transformed 1174 places.
[2026-05-23 08:49:48] [INFO ] Transformed 1447 transitions.
[2026-05-23 08:49:48] [INFO ] Found NUPN structural information;
[2026-05-23 08:49:48] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 201 places in 17 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 155 places :
Symmetric choice reduction at 1 with 155 rule applications. Total rules 188 place count 793 transition count 1008
Iterating global reduction 1 with 155 rules applied. Total rules applied 343 place count 793 transition count 1008
Discarding 122 places :
Symmetric choice reduction at 1 with 122 rule applications. Total rules 465 place count 671 transition count 885
Iterating global reduction 1 with 122 rules applied. Total rules applied 587 place count 671 transition count 885
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 594 place count 671 transition count 878
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 651 place count 614 transition count 816
Iterating global reduction 2 with 57 rules applied. Total rules applied 708 place count 614 transition count 816
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 710 place count 614 transition count 814
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 740 place count 584 transition count 784
Iterating global reduction 3 with 30 rules applied. Total rules applied 770 place count 584 transition count 784
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 774 place count 584 transition count 780
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 787 place count 571 transition count 767
Iterating global reduction 4 with 13 rules applied. Total rules applied 800 place count 571 transition count 767
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 805 place count 566 transition count 762
Iterating global reduction 4 with 5 rules applied. Total rules applied 810 place count 566 transition count 762
Applied a total of 810 rules in 262 ms. Remains 566 /973 variables (removed 407) and now considering 762/1173 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7580505627994008648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14385573514243065094.kers'
[2026-05-23 08:49:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7580505627994008648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14385573514243065094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 762 rows 566 cols 1964 entries
Finished phase 1 with 559 SingleSign rule and 0 generalized
[2026-05-23 08:49:48] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-14385573514243065094.kers
Total runtime 14 ms.
[2026-05-23 08:49:49] [INFO ] Implicit Places using invariants in 428 ms returned [6, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 460 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 564/973 places, 762/1173 transitions.
Applied a total of 0 rules in 9 ms. Remains 564 /564 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 745 ms. Remains : 564/973 places, 762/1173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Applied a total of 0 rules in 9 ms. Remains 564 /564 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9255343802033473017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7149067044399652290.kers'
[2026-05-23 08:49:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9255343802033473017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7149067044399652290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 762 rows 564 cols 1949 entries
Finished phase 1 with 559 SingleSign rule and 0 generalized
[2026-05-23 08:49:49] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7149067044399652290.kers
Total runtime 3 ms.
[2026-05-23 08:49:49] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-23 08:49:49] [INFO ] Invariant cache hit.
[2026-05-23 08:49:49] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2026-05-23 08:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/1326 variables, and 6 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/564 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/563 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (OVERLAPS) 1/564 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 4 (OVERLAPS) 762/1326 variables, 564/570 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1326 variables, 761/1331 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1332 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 564/564 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Finished structural reductions in LTL mode , in 1 iterations and 61178 ms. Remains : 564/564 places, 762/762 transitions.
Support contains 78 out of 564 places after structural reductions.
[2026-05-23 08:50:50] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 08:50:50] [INFO ] Flatten gal took : 72 ms
[2026-05-23 08:50:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-19-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 08:50:50] [INFO ] Flatten gal took : 36 ms
[2026-05-23 08:50:50] [INFO ] Input system was already deterministic with 762 transitions.
Support contains 61 out of 564 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (665 resets) in 2700 ms. (14 steps per ms) remains 28/45 properties
BEST_FIRST walk for 4003 steps (12 resets) in 51 ms. (76 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (10 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
[2026-05-23 08:50:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 14/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 25/80 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 255/335 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 437/772 variables, 186/271 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 380/1152 variables, 190/461 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1152 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 131/1283 variables, 81/542 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1283 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 34/1317 variables, 20/562 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1317 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 8/1325 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1325 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (OVERLAPS) 1/1326 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1326 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (OVERLAPS) 0/1326 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 569 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 564/564 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 14/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 25/80 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 255/335 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 437/772 variables, 186/274 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 25/299 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 380/1152 variables, 190/489 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1152 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 131/1283 variables, 81/570 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1283 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 34/1317 variables, 20/590 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/1326 variables, and 590 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 557/564 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8980ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 762/762 transitions.
Graph (trivial) has 521 edges and 564 vertex of which 3 / 564 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1071 edges and 562 vertex of which 556 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 222 rules applied. Total rules applied 224 place count 556 transition count 528
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 231 rules applied. Total rules applied 455 place count 344 transition count 509
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 473 place count 327 transition count 508
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 473 place count 327 transition count 469
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 551 place count 288 transition count 469
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 559 place count 280 transition count 460
Iterating global reduction 3 with 8 rules applied. Total rules applied 567 place count 280 transition count 460
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 569 place count 280 transition count 458
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 569 place count 280 transition count 456
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 573 place count 278 transition count 456
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 575 place count 276 transition count 453
Iterating global reduction 4 with 2 rules applied. Total rules applied 577 place count 276 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 578 place count 276 transition count 452
Performed 80 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 5 with 160 rules applied. Total rules applied 738 place count 196 transition count 354
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 750 place count 196 transition count 342
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 756 place count 190 transition count 333
Iterating global reduction 6 with 6 rules applied. Total rules applied 762 place count 190 transition count 333
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 836 place count 153 transition count 380
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 851 place count 153 transition count 365
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 869 place count 135 transition count 293
Iterating global reduction 7 with 18 rules applied. Total rules applied 887 place count 135 transition count 293
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 897 place count 135 transition count 283
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 898 place count 134 transition count 277
Iterating global reduction 8 with 1 rules applied. Total rules applied 899 place count 134 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 900 place count 134 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 907 place count 134 transition count 269
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 918 place count 134 transition count 258
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 930 place count 123 transition count 257
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 933 place count 123 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 934 place count 123 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 935 place count 122 transition count 255
Applied a total of 935 rules in 137 ms. Remains 122 /564 variables (removed 442) and now considering 255/762 (removed 507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 122/564 places, 255/762 transitions.
RANDOM walk for 40000 steps (1280 resets) in 497 ms. (80 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40004 steps (204 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2026-05-23 08:51:01] [INFO ] Flow matrix only has 239 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-848739945904880698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15448429935955660310.kers'
[2026-05-23 08:51:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-848739945904880698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15448429935955660310.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 239 rows 120 cols 833 entries
Finished phase 1 with 115 SingleSign rule and 1 generalized
[2026-05-23 08:51:01] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15448429935955660310.kers
Total runtime 1 ms.
[2026-05-23 08:51:01] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/90 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 206/296 variables, 90/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/340 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/354 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/360 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/361 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/361 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/90 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 206/296 variables, 90/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/340 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/354 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/360 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/360 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/361 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/361 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/361 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 6 ms.
[2026-05-23 08:51:01] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:51:01] [INFO ] Flatten gal took : 24 ms
[2026-05-23 08:51:01] [INFO ] Input system was already deterministic with 762 transitions.
Computed a total of 18 stabilizing places and 21 stable transitions
Graph (complete) has 1074 edges and 564 vertex of which 559 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 533 transition count 729
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 533 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 533 transition count 727
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 82 place count 515 transition count 708
Iterating global reduction 1 with 18 rules applied. Total rules applied 100 place count 515 transition count 708
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 515 transition count 705
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 507 transition count 697
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 507 transition count 697
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 507 transition count 696
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 504 transition count 693
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 504 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 503 transition count 692
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 503 transition count 692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 502 transition count 691
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 502 transition count 691
Applied a total of 130 rules in 64 ms. Remains 502 /564 variables (removed 62) and now considering 691/762 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3413679282371574674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8946940384589234941.kers'
[2026-05-23 08:51:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3413679282371574674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8946940384589234941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 691 rows 502 cols 1785 entries
Finished phase 1 with 497 SingleSign rule and 0 generalized
[2026-05-23 08:51:01] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8946940384589234941.kers
Total runtime 4 ms.
[2026-05-23 08:51:01] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-23 08:51:01] [INFO ] Invariant cache hit.
[2026-05-23 08:51:02] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2026-05-23 08:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 691/1193 variables, 502/507 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1193/1193 variables, and 507 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1193 variables, 502/508 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1193 variables, 690/1198 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1193/1193 variables, and 1198 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 502/564 places, 691/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 502/564 places, 691/762 transitions.
[2026-05-23 08:52:02] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:52:02] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:52:02] [INFO ] Input system was already deterministic with 691 transitions.
[2026-05-23 08:52:02] [INFO ] Flatten gal took : 33 ms
[2026-05-23 08:52:02] [INFO ] Flatten gal took : 33 ms
[2026-05-23 08:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8625358577934930165.gal : 29 ms
[2026-05-23 08:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18126347304754980131.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8625358577934930165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18126347304754980131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.25625e+11,12.3424,336484,2,26064,5,938924,6,0,2693,1.7361e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:52:32] [INFO ] Flatten gal took : 36 ms
[2026-05-23 08:52:32] [INFO ] Applying decomposition
[2026-05-23 08:52:32] [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/graph2154020282260737236.txt' '-o' '/tmp/graph2154020282260737236.bin' '-w' '/tmp/graph2154020282260737236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2154020282260737236.bin' '-l' '-1' '-v' '-w' '/tmp/graph2154020282260737236.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:52:32] [INFO ] Decomposing Gal with order
[2026-05-23 08:52:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:52:32] [INFO ] Removed a total of 408 redundant transitions.
[2026-05-23 08:52:32] [INFO ] Flatten gal took : 85 ms
[2026-05-23 08:52:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 15 ms.
[2026-05-23 08:52:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12639977698699808833.gal : 12 ms
[2026-05-23 08:52:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9450902294278174615.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/CTLFireability12639977698699808833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9450902294278174615.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,7.25625e+11,1.14482,42296,1529,157,64986,2343,1231,223035,104,10143,0


Converting to forward existential form...Done !
original formula: AF(AX(((((i20.u185.p1134==1)||(i10.i0.i1.u111.p699==1))||((i0.u6.p126==1)||(i11.u96.p781==1))) + ((((i6.u53.p360==1)&&(i11.u164.p955==1))...325
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((((i20.u185.p1134==1)||(i10.i0.i1.u111.p699==1))||((i0.u6.p126==1)||(i11.u96.p781==1))) + (...394
Reverse transition relation is NOT exact ! Due to transitions t24, t50, t86, t95, t96, t140, t186, t226, t234, t271, t359, t368, t447, t561, t562, t599, t6...1154
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 528 transition count 723
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 528 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 528 transition count 721
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 504 transition count 696
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 504 transition count 696
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 127 place count 504 transition count 691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 137 place count 494 transition count 681
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 494 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 494 transition count 680
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 490 transition count 676
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 490 transition count 676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 157 place count 490 transition count 675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 489 transition count 674
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 489 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 488 transition count 673
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 488 transition count 673
Applied a total of 161 rules in 54 ms. Remains 488 /564 variables (removed 76) and now considering 673/762 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6538677806990740712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11235250486867963266.kers'
[2026-05-23 08:53:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6538677806990740712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11235250486867963266.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 673 rows 488 cols 1734 entries
Finished phase 1 with 483 SingleSign rule and 0 generalized
[2026-05-23 08:53:03] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11235250486867963266.kers
Total runtime 4 ms.
[2026-05-23 08:53:03] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-23 08:53:03] [INFO ] Invariant cache hit.
[2026-05-23 08:53:03] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2026-05-23 08:53:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 672 unsolved
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30093ms
Starting structural reductions in LTL mode, iteration 1 : 488/564 places, 673/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30743 ms. Remains : 488/564 places, 673/762 transitions.
[2026-05-23 08:53:33] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:53:33] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:53:33] [INFO ] Input system was already deterministic with 673 transitions.
[2026-05-23 08:53:33] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:53:33] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:53:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5711395398384762471.gal : 4 ms
[2026-05-23 08:53:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14287334652308869974.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/CTLFireability5711395398384762471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14287334652308869974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.81899e+11,10.624,298092,2,24489,5,859565,6,0,2619,1.53478e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:54:03] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:54:03] [INFO ] Applying decomposition
[2026-05-23 08:54:03] [INFO ] Flatten gal took : 10 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/graph16295718119890013231.txt' '-o' '/tmp/graph16295718119890013231.bin' '-w' '/tmp/graph16295718119890013231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16295718119890013231.bin' '-l' '-1' '-v' '-w' '/tmp/graph16295718119890013231.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:54:04] [INFO ] Decomposing Gal with order
[2026-05-23 08:54:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:54:04] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-23 08:54:04] [INFO ] Flatten gal took : 51 ms
[2026-05-23 08:54:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 13 ms.
[2026-05-23 08:54:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15215906060832403365.gal : 9 ms
[2026-05-23 08:54:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6707121311619320029.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/CTLFireability15215906060832403365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6707121311619320029.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.81899e+11,0.411078,21308,1332,105,31388,776,1210,73924,84,3145,0


Converting to forward existential form...Done !
original formula: AG((EG(AX(EF((i8.u71.p465==0)))) * (!(A(((AX((i17.i1.i1.u166.p949==1)) * (i16.u149.p865==1)) * (i6.i2.i0.u62.p418==1)) U (i13.i0.i1.u127....243
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(EX(!(E(TRUE U (i8.u71.p465==0))))))))] = FALSE * [(((FwdU(Init,TRUE) * !(EX((((i15.i...425
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t77, t86, t87, t131, t177, t215, t223, t259, t359, t403, t449, t489, t520, t548, t5...1007
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 529 transition count 724
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 529 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 529 transition count 722
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 94 place count 507 transition count 700
Iterating global reduction 1 with 22 rules applied. Total rules applied 116 place count 507 transition count 700
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 507 transition count 694
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 131 place count 498 transition count 685
Iterating global reduction 2 with 9 rules applied. Total rules applied 140 place count 498 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 498 transition count 684
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 494 transition count 680
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 494 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 494 transition count 679
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 493 transition count 678
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 493 transition count 678
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 492 transition count 677
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 492 transition count 677
Applied a total of 154 rules in 51 ms. Remains 492 /564 variables (removed 72) and now considering 677/762 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9427584167236957982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3646914080836216614.kers'
[2026-05-23 08:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9427584167236957982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3646914080836216614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 677 rows 492 cols 1750 entries
Finished phase 1 with 487 SingleSign rule and 0 generalized
[2026-05-23 08:54:34] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3646914080836216614.kers
Total runtime 3 ms.
[2026-05-23 08:54:34] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 08:54:34] [INFO ] Invariant cache hit.
[2026-05-23 08:54:34] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 676 sub problems to find dead transitions.
[2026-05-23 08:54:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 676 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Starting structural reductions in LTL mode, iteration 1 : 492/564 places, 677/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30618 ms. Remains : 492/564 places, 677/762 transitions.
[2026-05-23 08:55:04] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:55:04] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:55:04] [INFO ] Input system was already deterministic with 677 transitions.
[2026-05-23 08:55:04] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:55:04] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13206363335217941906.gal : 3 ms
[2026-05-23 08:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability419277378161373196.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/CTLFireability13206363335217941906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability419277378161373196.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,5.57858e+11,16.3175,339588,2,25608,5,929656,6,0,2639,1.76149e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:55:35] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:55:35] [INFO ] Applying decomposition
[2026-05-23 08:55:35] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph392805119809996816.txt' '-o' '/tmp/graph392805119809996816.bin' '-w' '/tmp/graph392805119809996816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph392805119809996816.bin' '-l' '-1' '-v' '-w' '/tmp/graph392805119809996816.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:55:35] [INFO ] Decomposing Gal with order
[2026-05-23 08:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:55:35] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-23 08:55:35] [INFO ] Flatten gal took : 24 ms
[2026-05-23 08:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-23 08:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9135352555466566476.gal : 5 ms
[2026-05-23 08:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability113313343880719669.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/CTLFireability9135352555466566476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability113313343880719669.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.57858e+11,0.613068,26088,1268,96,40957,1138,1157,99356,94,4192,0


Converting to forward existential form...Done !
original formula: !(A(!(((A(EF((i10.i0.i1.u92.p615==1)) U AG((i13.u106.p728==1))) * EX((i11.u96.p634==1))) * (AG((i19.u147.p864==1)) * EG((i0.u5.p127==1)))...207
=> equivalent forward existential formula: ([((FwdU(Init,!(E((i19.u157.p953!=1) U !(E(TRUE U !((i11.u99.p927==1))))))) * !(!(((!((E(!(!(E(TRUE U !((i13.u10...547
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t77, t86, t87, t133, t179, t217, t261, t304, t316, t351, t360, t438, t450, t522, t5...1070
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 532 transition count 728
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 532 transition count 728
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 66 place count 532 transition count 726
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 87 place count 511 transition count 704
Iterating global reduction 1 with 21 rules applied. Total rules applied 108 place count 511 transition count 704
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 113 place count 511 transition count 699
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 120 place count 504 transition count 692
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 504 transition count 692
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 504 transition count 691
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 501 transition count 688
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 501 transition count 688
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 500 transition count 687
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 500 transition count 687
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 499 transition count 686
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 499 transition count 686
Applied a total of 138 rules in 54 ms. Remains 499 /564 variables (removed 65) and now considering 686/762 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8965866595785667929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4887654844050009467.kers'
[2026-05-23 08:56:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8965866595785667929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4887654844050009467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 686 rows 499 cols 1764 entries
Finished phase 1 with 494 SingleSign rule and 0 generalized
[2026-05-23 08:56:05] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4887654844050009467.kers
Total runtime 3 ms.
[2026-05-23 08:56:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 08:56:05] [INFO ] Invariant cache hit.
[2026-05-23 08:56:05] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2026-05-23 08:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 686/1185 variables, 499/504 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 504 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 686/1185 variables, 499/506 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1185 variables, 685/1191 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1185/1185 variables, and 1191 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 499/564 places, 686/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60603 ms. Remains : 499/564 places, 686/762 transitions.
[2026-05-23 08:57:05] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:57:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:57:05] [INFO ] Input system was already deterministic with 686 transitions.
[2026-05-23 08:57:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:57:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10910426120358585345.gal : 3 ms
[2026-05-23 08:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1490312151764303792.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/CTLFireability10910426120358585345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1490312151764303792.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.15088e+11,12.7133,315552,2,24742,5,895764,6,0,2676,1.64496e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:57:35] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:57:35] [INFO ] Applying decomposition
[2026-05-23 08:57:35] [INFO ] Flatten gal took : 8 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/graph12673896565961396920.txt' '-o' '/tmp/graph12673896565961396920.bin' '-w' '/tmp/graph12673896565961396920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12673896565961396920.bin' '-l' '-1' '-v' '-w' '/tmp/graph12673896565961396920.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:57:36] [INFO ] Decomposing Gal with order
[2026-05-23 08:57:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:57:36] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-23 08:57:36] [INFO ] Flatten gal took : 23 ms
[2026-05-23 08:57:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 5 ms.
[2026-05-23 08:57:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4323902836378597521.gal : 5 ms
[2026-05-23 08:57:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5415965628548636436.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/CTLFireability4323902836378597521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5415965628548636436.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,7.15088e+11,2.76628,86948,2860,130,130479,2596,1197,557604,89,17063,0


Converting to forward existential form...Done !
original formula: A(EX(AG((i20.u178.p1081!=1))) U (EG(!((EX(((i5.i1.i1.u57.p383==1)&&(i8.u75.p532==1))) + (i13.u116.p732!=1)))) + AG((EG(((i19.u176.p1025==...220
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!((EX(((i5.i1.i1.u57.p383==1)&&(i8.u75.p532==1))) + (i13.u116.p732!=1)))) + !(E(TRUE U !((E...683
Reverse transition relation is NOT exact ! Due to transitions t25, t57, t84, t93, t94, t138, t184, t222, t266, t307, t319, t356, t366, t410, t444, t456, t4...1081
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 528 transition count 723
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 528 transition count 723
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 528 transition count 721
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 504 transition count 696
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 504 transition count 696
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 128 place count 504 transition count 690
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 137 place count 495 transition count 681
Iterating global reduction 2 with 9 rules applied. Total rules applied 146 place count 495 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 495 transition count 680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 492 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 492 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 492 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 491 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 491 transition count 675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 490 transition count 674
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 490 transition count 674
Applied a total of 158 rules in 60 ms. Remains 490 /564 variables (removed 74) and now considering 674/762 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-914702746207667001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7944646446526080627.kers'
[2026-05-23 08:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-914702746207667001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7944646446526080627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 490 cols 1736 entries
Finished phase 1 with 485 SingleSign rule and 0 generalized
[2026-05-23 08:58:06] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7944646446526080627.kers
Total runtime 4 ms.
[2026-05-23 08:58:06] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-23 08:58:06] [INFO ] Invariant cache hit.
[2026-05-23 08:58:06] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2026-05-23 08:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 673 unsolved
SMT process timed out in 30095ms, After SMT, problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
Starting structural reductions in LTL mode, iteration 1 : 490/564 places, 674/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30681 ms. Remains : 490/564 places, 674/762 transitions.
[2026-05-23 08:58:36] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:58:36] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:58:36] [INFO ] Input system was already deterministic with 674 transitions.
[2026-05-23 08:58:36] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:58:36] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:58:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10539388018274890246.gal : 3 ms
[2026-05-23 08:58:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5664216105073365344.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/CTLFireability10539388018274890246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5664216105073365344.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.56043e+11,11.312,303560,2,25288,5,876894,6,0,2628,1.55739e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:59:07] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:59:07] [INFO ] Applying decomposition
[2026-05-23 08:59:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15084881297680695868.txt' '-o' '/tmp/graph15084881297680695868.bin' '-w' '/tmp/graph15084881297680695868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15084881297680695868.bin' '-l' '-1' '-v' '-w' '/tmp/graph15084881297680695868.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:59:07] [INFO ] Decomposing Gal with order
[2026-05-23 08:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:59:07] [INFO ] Removed a total of 405 redundant transitions.
[2026-05-23 08:59:07] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2026-05-23 08:59:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15825789296847969721.gal : 5 ms
[2026-05-23 08:59:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16677599552231203528.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/CTLFireability15825789296847969721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16677599552231203528.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,5.56043e+11,0.482311,22804,1344,106,33308,918,1121,81936,88,3829,0


Converting to forward existential form...Done !
original formula: EF(EX(EG((i7.u62.p410==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(i7.u62.p410==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,1.29228,51156,1,0,76318,1501,4983,283491,340,6180,143563
FORMULA CO4-PT-19-CTLFireability-2024-05 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 : 564/564 places, 762/762 transitions.
Graph (trivial) has 595 edges and 564 vertex of which 3 / 564 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 562 vertex of which 557 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 556 transition count 500
Reduce places removed 253 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 1 with 259 rules applied. Total rules applied 514 place count 303 transition count 494
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 519 place count 300 transition count 492
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 521 place count 298 transition count 492
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 521 place count 298 transition count 453
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 599 place count 259 transition count 453
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 613 place count 245 transition count 436
Iterating global reduction 4 with 14 rules applied. Total rules applied 627 place count 245 transition count 436
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 627 place count 245 transition count 433
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 633 place count 242 transition count 433
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 638 place count 237 transition count 426
Iterating global reduction 4 with 5 rules applied. Total rules applied 643 place count 237 transition count 426
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 647 place count 237 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 648 place count 236 transition count 422
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 718 place count 201 transition count 386
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 12 rules applied. Total rules applied 730 place count 201 transition count 374
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 736 place count 197 transition count 372
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 744 place count 189 transition count 360
Iterating global reduction 8 with 8 rules applied. Total rules applied 752 place count 189 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 778 place count 189 transition count 334
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 8 with 16 rules applied. Total rules applied 794 place count 189 transition count 318
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 810 place count 173 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 810 place count 173 transition count 316
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 814 place count 171 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 816 place count 170 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 818 place count 168 transition count 313
Applied a total of 818 rules in 90 ms. Remains 168 /564 variables (removed 396) and now considering 313/762 (removed 449) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9030549428883324015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-455074013898587538.kers'
[2026-05-23 08:59:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9030549428883324015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-455074013898587538.kers]
Normalized transition count is 312 out of 313 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 168 cols 937 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-23 08:59:08] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-455074013898587538.kers
Total runtime 2 ms.
[2026-05-23 08:59:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 08:59:08] [INFO ] Invariant cache hit.
[2026-05-23 08:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:59:08] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-23 08:59:08] [INFO ] Redundant transitions in 14 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-23 08:59:08] [INFO ] Invariant cache hit.
[2026-05-23 08:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 312/480 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/481 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 174 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20215 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 312/480 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 300/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/481 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50282ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 50282ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/564 places, 313/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50592 ms. Remains : 168/564 places, 313/762 transitions.
[2026-05-23 08:59:59] [INFO ] Flatten gal took : 12 ms
[2026-05-23 08:59:59] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:59:59] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-23 08:59:59] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:59:59] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:59:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10977162436763539881.gal : 1 ms
[2026-05-23 08:59:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13999506544213531939.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/CTLFireability10977162436763539881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13999506544213531939.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.1044e+08,0.237164,13300,2,2397,5,39023,6,0,970,34896,0


Converting to forward existential form...Done !
original formula: EG(A(AF((p460==1)) U (AG((((p843==1)&&(p969==1))&&(p1069==1))) * (p625==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((!(E(TRUE U !((((p843==1)&&(p969==1))&&(p1069==1))))) * (p625==1))) U (!(!(EG(!((p460==1))))) ...317
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t22, t39, t52, t61, t63, t75, t91, t96, t175, t211, t215, t238, t272, t278, t282, t28...282
Detected timeout of ITS tools.
[2026-05-23 09:00:29] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:00:29] [INFO ] Applying decomposition
[2026-05-23 09:00:29] [INFO ] Flatten gal took : 5 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/graph9813646145961738714.txt' '-o' '/tmp/graph9813646145961738714.bin' '-w' '/tmp/graph9813646145961738714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9813646145961738714.bin' '-l' '-1' '-v' '-w' '/tmp/graph9813646145961738714.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:00:29] [INFO ] Decomposing Gal with order
[2026-05-23 09:00:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:00:29] [INFO ] Removed a total of 264 redundant transitions.
[2026-05-23 09:00:29] [INFO ] Flatten gal took : 31 ms
[2026-05-23 09:00:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 4 ms.
[2026-05-23 09:00:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17717272727336511548.gal : 2 ms
[2026-05-23 09:00:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13329849392178186507.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/CTLFireability17717272727336511548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13329849392178186507.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,2.1044e+08,0.055335,5848,145,68,2473,660,610,3481,134,1662,0


Converting to forward existential form...Done !
original formula: EG(A(AF((i2.i1.u26.p460==1)) U (AG((((i7.u46.p843==1)&&(i9.u58.p969==1))&&(i9.u59.p1069==1))) * (i4.u28.p625==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((!(E(TRUE U !((((i7.u46.p843==1)&&(i9.u58.p969==1))&&(i9.u59.p1069==1))))) * (i4.u28.p625==1))...411
Reverse transition relation is NOT exact ! Due to transitions t273, t289, t290, i0.i1.u4.t96, i0.i3.u19.t75, i1.i1.u11.t175, i1.i3.u7.t91, i2.i1.u25.t61, i...413
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,4.67532,159464,1,0,243330,5731,3536,939097,704,38205,182619
FORMULA CO4-PT-19-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 529 transition count 724
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 529 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 529 transition count 722
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 96 place count 505 transition count 697
Iterating global reduction 1 with 24 rules applied. Total rules applied 120 place count 505 transition count 697
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 126 place count 505 transition count 691
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 135 place count 496 transition count 682
Iterating global reduction 2 with 9 rules applied. Total rules applied 144 place count 496 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 496 transition count 681
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 492 transition count 677
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 492 transition count 677
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 492 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 491 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 491 transition count 675
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 490 transition count 674
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 490 transition count 674
Applied a total of 158 rules in 63 ms. Remains 490 /564 variables (removed 74) and now considering 674/762 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2450351657214102629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1824105086442711830.kers'
[2026-05-23 09:00:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2450351657214102629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1824105086442711830.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 674 rows 490 cols 1736 entries
Finished phase 1 with 485 SingleSign rule and 0 generalized
[2026-05-23 09:00:34] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1824105086442711830.kers
Total runtime 4 ms.
[2026-05-23 09:00:34] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-23 09:00:34] [INFO ] Invariant cache hit.
[2026-05-23 09:00:34] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 673 sub problems to find dead transitions.
[2026-05-23 09:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 673 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 673 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 673 unsolved
SMT process timed out in 30110ms, After SMT, problems are : Problem set: 0 solved, 673 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Starting structural reductions in LTL mode, iteration 1 : 490/564 places, 674/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30576 ms. Remains : 490/564 places, 674/762 transitions.
[2026-05-23 09:01:04] [INFO ] Flatten gal took : 10 ms
[2026-05-23 09:01:04] [INFO ] Flatten gal took : 9 ms
[2026-05-23 09:01:04] [INFO ] Input system was already deterministic with 674 transitions.
[2026-05-23 09:01:04] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:01:04] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12735448621556400030.gal : 2 ms
[2026-05-23 09:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14338591899908158376.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/CTLFireability12735448621556400030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14338591899908158376.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,5.55055e+11,12.327,309596,2,24934,5,880704,6,0,2628,1.59571e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:01:34] [INFO ] Flatten gal took : 11 ms
[2026-05-23 09:01:34] [INFO ] Applying decomposition
[2026-05-23 09:01:34] [INFO ] Flatten gal took : 8 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/graph8914279632398342020.txt' '-o' '/tmp/graph8914279632398342020.bin' '-w' '/tmp/graph8914279632398342020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8914279632398342020.bin' '-l' '-1' '-v' '-w' '/tmp/graph8914279632398342020.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:01:34] [INFO ] Decomposing Gal with order
[2026-05-23 09:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:01:34] [INFO ] Removed a total of 410 redundant transitions.
[2026-05-23 09:01:34] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-23 09:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11394261225662778472.gal : 5 ms
[2026-05-23 09:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13432784808922701904.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/CTLFireability11394261225662778472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13432784808922701904.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,5.55055e+11,1.11873,45240,1868,108,68841,1304,1027,268276,81,7522,0


Converting to forward existential form...Done !
original formula: (AF(((i10.u89.p575==1)||(((i5.u58.p386==1)&&(i2.u30.p274==1))&&((i10.u172.p955==0)||(i7.u174.p961==0))))) + AG(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((i10.u89.p575==1)||(((i5.u58.p386==1)&&(i2.u30.p274==1))&&((i10.u172.p955==0)||(i7.u174...202
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t87, t88, t132, t166, t178, t260, t313, t348, t357, t436, t448, t479, t547, t5...1012
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 533 transition count 729
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 533 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 533 transition count 727
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 87 place count 510 transition count 703
Iterating global reduction 1 with 23 rules applied. Total rules applied 110 place count 510 transition count 703
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 116 place count 510 transition count 697
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 125 place count 501 transition count 688
Iterating global reduction 2 with 9 rules applied. Total rules applied 134 place count 501 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 501 transition count 687
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 498 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 498 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 498 transition count 683
Applied a total of 142 rules in 38 ms. Remains 498 /564 variables (removed 66) and now considering 683/762 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3851699537608405872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17098806929704797521.kers'
[2026-05-23 09:02:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3851699537608405872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17098806929704797521.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 683 rows 498 cols 1758 entries
Finished phase 1 with 493 SingleSign rule and 0 generalized
[2026-05-23 09:02:04] [INFO ] Computed 5 invariants in 7 ms
Computed 5 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17098806929704797521.kers
Total runtime 8 ms.
[2026-05-23 09:02:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-23 09:02:05] [INFO ] Invariant cache hit.
[2026-05-23 09:02:05] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 682 sub problems to find dead transitions.
[2026-05-23 09:02:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 682 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 683/1181 variables, 498/503 constraints. Problems are: Problem set: 0 solved, 682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/1181 variables, and 503 constraints, problems are : Problem set: 0 solved, 682 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 682/682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 4 (OVERLAPS) 683/1181 variables, 498/505 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 682/1187 constraints. Problems are: Problem set: 0 solved, 682 unsolved
SMT process timed out in 60123ms, After SMT, problems are : Problem set: 0 solved, 682 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 498/564 places, 683/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 498/564 places, 683/762 transitions.
[2026-05-23 09:03:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:03:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:03:05] [INFO ] Input system was already deterministic with 683 transitions.
[2026-05-23 09:03:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:03:05] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:03:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10743554616139209046.gal : 3 ms
[2026-05-23 09:03:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12201543260995305886.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/CTLFireability10743554616139209046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12201543260995305886.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,5.75918e+11,13.5943,320856,2,25492,5,901101,6,0,2669,1.65468e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 09:03:35] [INFO ] Flatten gal took : 17 ms
[2026-05-23 09:03:35] [INFO ] Applying decomposition
[2026-05-23 09:03:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16029613105209289426.txt' '-o' '/tmp/graph16029613105209289426.bin' '-w' '/tmp/graph16029613105209289426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16029613105209289426.bin' '-l' '-1' '-v' '-w' '/tmp/graph16029613105209289426.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:03:35] [INFO ] Decomposing Gal with order
[2026-05-23 09:03:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:03:35] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-23 09:03:35] [INFO ] Flatten gal took : 20 ms
[2026-05-23 09:03:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2026-05-23 09:03:35] [INFO ] Time to serialize gal into /tmp/CTLFireability555712134749311450.gal : 5 ms
[2026-05-23 09:03:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11450915539634668200.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/CTLFireability555712134749311450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11450915539634668200.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,5.75918e+11,2.29201,77652,1754,109,121535,1621,1282,523339,86,10017,0


Converting to forward existential form...Done !
original formula: ((EG((i19.u191.p1171==0)) * EF(((AF(((i11.i1.i0.u93.p604==0)||(i0.i1.i1.u41.p321==0))) + !(A(((i5.i1.i1.u59.p383==1)&&(i11.i0.i0.u170.p95...415
=> equivalent forward existential formula: (([(Init * !(EG((i19.u191.p1171==0))))] = FALSE * [(Init * !(E(TRUE U ((!(EG(!(((i11.i1.i0.u93.p604==0)||(i0.i1....619
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t87, t88, t132, t178, t216, t261, t306, t318, t353, t452, t555, t556, t592, t5...1142
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,17.3494,423108,1,0,537396,1988,8868,3.45668e+06,434,10017,629848
FORMULA CO4-PT-19-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Graph (trivial) has 604 edges and 564 vertex of which 3 / 564 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 562 vertex of which 557 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 556 transition count 494
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 1 with 266 rules applied. Total rules applied 527 place count 297 transition count 487
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 530 place count 294 transition count 487
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 530 place count 294 transition count 447
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 610 place count 254 transition count 447
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 624 place count 240 transition count 430
Iterating global reduction 3 with 14 rules applied. Total rules applied 638 place count 240 transition count 430
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 638 place count 240 transition count 427
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 644 place count 237 transition count 427
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 649 place count 232 transition count 420
Iterating global reduction 3 with 5 rules applied. Total rules applied 654 place count 232 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 658 place count 232 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 659 place count 231 transition count 416
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 733 place count 194 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 12 rules applied. Total rules applied 745 place count 194 transition count 366
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 751 place count 190 transition count 364
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 759 place count 182 transition count 352
Iterating global reduction 7 with 8 rules applied. Total rules applied 767 place count 182 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 769 place count 181 transition count 351
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 770 place count 180 transition count 349
Iterating global reduction 7 with 1 rules applied. Total rules applied 771 place count 180 transition count 349
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 772 place count 179 transition count 347
Iterating global reduction 7 with 1 rules applied. Total rules applied 773 place count 179 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 774 place count 179 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 800 place count 179 transition count 320
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 8 with 16 rules applied. Total rules applied 816 place count 179 transition count 304
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 832 place count 163 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 832 place count 163 transition count 302
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 836 place count 161 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 838 place count 160 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 840 place count 158 transition count 299
Applied a total of 840 rules in 66 ms. Remains 158 /564 variables (removed 406) and now considering 299/762 (removed 463) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13068925796831218630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16178483025205809664.kers'
[2026-05-23 09:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13068925796831218630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16178483025205809664.kers]
Normalized transition count is 298 out of 299 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 158 cols 795 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-23 09:03:53] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16178483025205809664.kers
Total runtime 1 ms.
[2026-05-23 09:03:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 09:03:53] [INFO ] Invariant cache hit.
[2026-05-23 09:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:03:53] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2026-05-23 09:03:53] [INFO ] Redundant transitions in 8 ms returned []
Running 279 sub problems to find dead transitions.
[2026-05-23 09:03:53] [INFO ] Invariant cache hit.
[2026-05-23 09:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 298/456 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 1/457 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 164 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17099 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 298/456 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 279/442 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 1/457 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 443 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47149ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 47150ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/564 places, 299/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47420 ms. Remains : 158/564 places, 299/762 transitions.
[2026-05-23 09:04:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:04:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:04:40] [INFO ] Input system was already deterministic with 299 transitions.
[2026-05-23 09:04:40] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:04:40] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:04:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17934811333922460392.gal : 2 ms
[2026-05-23 09:04:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11480075617266126306.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17934811333922460392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11480075617266126306.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 21465 steps (1686 resets) in 74 ms. (286 steps per ms) remains 0/1 properties
FORMULA CO4-PT-19-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 564/564 places, 762/762 transitions.
Graph (trivial) has 574 edges and 564 vertex of which 3 / 564 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 562 vertex of which 557 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 557 transition count 511
Reduce places removed 243 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 247 rules applied. Total rules applied 492 place count 314 transition count 507
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 503 place count 313 transition count 497
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 513 place count 303 transition count 497
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 513 place count 303 transition count 458
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 591 place count 264 transition count 458
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 605 place count 250 transition count 442
Iterating global reduction 4 with 14 rules applied. Total rules applied 619 place count 250 transition count 442
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 619 place count 250 transition count 439
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 625 place count 247 transition count 439
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 631 place count 241 transition count 430
Iterating global reduction 4 with 6 rules applied. Total rules applied 637 place count 241 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 642 place count 241 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 643 place count 240 transition count 425
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 715 place count 204 transition count 388
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
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 6 with 10 rules applied. Total rules applied 725 place count 204 transition count 378
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 729 place count 201 transition count 377
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 736 place count 194 transition count 367
Iterating global reduction 8 with 7 rules applied. Total rules applied 743 place count 194 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 769 place count 194 transition count 341
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 8 with 15 rules applied. Total rules applied 784 place count 194 transition count 326
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 16 rules applied. Total rules applied 800 place count 179 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 801 place count 178 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 801 place count 178 transition count 322
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 807 place count 175 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 809 place count 174 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 810 place count 174 transition count 320
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 811 place count 174 transition count 320
Applied a total of 811 rules in 59 ms. Remains 174 /564 variables (removed 390) and now considering 320/762 (removed 442) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17185449318143019766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2897255541670272263.kers'
[2026-05-23 09:04:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17185449318143019766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2897255541670272263.kers]
Normalized transition count is 319 out of 320 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 174 cols 974 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 09:04:40] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2897255541670272263.kers
Total runtime 2 ms.
[2026-05-23 09:04:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 09:04:40] [INFO ] Invariant cache hit.
[2026-05-23 09:04:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-23 09:04:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2026-05-23 09:04:40] [INFO ] Redundant transitions in 3 ms returned []
Running 319 sub problems to find dead transitions.
[2026-05-23 09:04:40] [INFO ] Invariant cache hit.
[2026-05-23 09:04:40] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 319/493 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 12/191 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 1/494 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (OVERLAPS) 0/494 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 192 constraints, problems are : Problem set: 0 solved, 319 unsolved in 18053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 319/493 variables, 174/179 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 12/191 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 319/510 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 1/494 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 511 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 174/174 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48112ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 48113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 174/564 places, 320/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48396 ms. Remains : 174/564 places, 320/762 transitions.
[2026-05-23 09:05:29] [INFO ] Flatten gal took : 6 ms
[2026-05-23 09:05:29] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:05:29] [INFO ] Input system was already deterministic with 320 transitions.
[2026-05-23 09:05:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:05:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:05:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3069532363853755792.gal : 1 ms
[2026-05-23 09:05:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15852936142759466683.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/CTLFireability3069532363853755792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15852936142759466683.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,2.34856e+08,0.241922,12996,2,1985,5,38388,6,0,1003,33800,0


Converting to forward existential form...Done !
original formula: EG(!(E(!(((E((((p852==1)&&(p969==1))&&(p1069==1)) U (p597==1)) * (p423!=1)) * (p0==1))) U A((((!(((p804==1)&&(p969==1))&&(p1161==1)))&&(p...210
=> equivalent forward existential formula: [FwdG(Init,!(E(!(((E((((p852==1)&&(p969==1))&&(p1069==1)) U (p597==1)) * (p423!=1)) * (p0==1))) U !((E(!((!(E(TR...372
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t22, t40, t61, t72, t87, t92, t196, t213, t217, t240, t266, t267, t279, t283, t29...288
(forward)formula 0,1,28.8457,830592,1,0,609,5.7184e+06,676,317,7937,4.46243e+06,822
FORMULA CO4-PT-19-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 09:05:58] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:05:58] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:05:58] [INFO ] Applying decomposition
[2026-05-23 09:05:58] [INFO ] Flatten gal took : 8 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/graph17933842145443240162.txt' '-o' '/tmp/graph17933842145443240162.bin' '-w' '/tmp/graph17933842145443240162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17933842145443240162.bin' '-l' '-1' '-v' '-w' '/tmp/graph17933842145443240162.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:05:58] [INFO ] Decomposing Gal with order
[2026-05-23 09:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:05:58] [INFO ] Removed a total of 437 redundant transitions.
[2026-05-23 09:05:58] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 8 ms.
[2026-05-23 09:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1575198325300957578.gal : 6 ms
[2026-05-23 09:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4296124254263018014.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/CTLFireability1575198325300957578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4296124254263018014.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 5 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.53771e+12,7.38552,273948,3526,158,394590,5045,1419,2.22125e+06,120,35645,0


Converting to forward existential form...Done !
original formula: AF(AX(((((i19.u214.p1134==1)||(i8.i0.i1.u130.p699==1))||((i0.u6.p126==1)||(i9.u151.p781==1))) + ((((i5.u54.p360==1)&&(i9.u115.p955==1)) +...328
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((((i19.u214.p1134==1)||(i8.i0.i1.u130.p699==1))||((i0.u6.p126==1)||(i9.u151.p781==1))) + ((...397
Reverse transition relation is NOT exact ! Due to transitions t30, t56, t97, t108, t109, t155, t202, t294, t327, t346, t369, t395, t411, t460, t508, t543, ...1615
Detected timeout of ITS tools.
[2026-05-23 09:31:24] [INFO ] Applying decomposition
[2026-05-23 09:31:24] [INFO ] Flatten gal took : 149 ms
[2026-05-23 09:31:24] [INFO ] Decomposing Gal with order
[2026-05-23 09:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:31:25] [INFO ] Removed a total of 262 redundant transitions.
[2026-05-23 09:31:25] [INFO ] Flatten gal took : 244 ms
[2026-05-23 09:31:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 277 labels/synchronizations in 1320 ms.
[2026-05-23 09:31:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5332206099870787509.gal : 49 ms
[2026-05-23 09:31:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14276338064212857177.ctl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5332206099870787509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14276338064212857177.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 5 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.53771e+12,10.5632,260892,916,5059,162471,379437,310,740354,1685,2.14184e+06,0


Converting to forward existential form...Done !
original formula: AF(AX(((((i0.i1.i1.i1.u17.p1134==1)||(i0.i1.i0.i1.u11.p699==1))||((i0.i0.i0.u5.p126==1)||(i0.i1.i0.i1.u11.p781==1))) + ((((i0.i0.i0.u5.p3...395
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((((i0.i1.i1.i1.u17.p1134==1)||(i0.i1.i0.i1.u11.p699==1))||((i0.i0.i0.u5.p126==1)||(i0.i1.i0...464
Reverse transition relation is NOT exact ! Due to transitions i0.t620, i0.t608, i0.t155, i0.i0.i0.t411, i0.i0.i0.u5.t0, i0.i0.i0.u5.t6, i0.i0.i0.u5.t425, i...2335

BK_TIME_CONFINEMENT_REACHED

--------------------
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="CO4-PT-19"
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 CO4-PT-19, 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 r066-tall-177946967700426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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