About the Execution of ITS-Tools for ErlangenMainframeV1-PT-bP01C01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 530.987 | 142599.00 | 179569.00 | 800.80 | FTFTFFTFFFFTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499000050.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 ErlangenMainframeV1-PT-bP01C01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499000050
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 14K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 52K May 26 18:17 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 ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1780259771295
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 20:36:13] [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-31 20:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:36:13] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-31 20:36:13] [INFO ] Transformed 173 places.
[2026-05-31 20:36:13] [INFO ] Transformed 219 transitions.
[2026-05-31 20:36:13] [INFO ] Found NUPN structural information;
[2026-05-31 20:36:13] [INFO ] Parsed PT model containing 173 places and 219 transitions and 608 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 77 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 219/219 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 148 transition count 194
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 148 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 144 transition count 190
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 144 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 143 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 143 transition count 189
Applied a total of 60 rules in 50 ms. Remains 143 /173 variables (removed 30) and now considering 189/219 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13772410321444675314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15060001313821814649.kers'
[2026-05-31 20:36:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13772410321444675314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15060001313821814649.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 143 cols 548 entries
Finished phase 1 with 132 SingleSign rule and 3 generalized
[2026-05-31 20:36:13] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15060001313821814649.kers
Total runtime 4 ms.
[2026-05-31 20:36:14] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-31 20:36:14] [INFO ] Invariant cache hit.
[2026-05-31 20:36:14] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2026-05-31 20:36:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 189/332 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 159 constraints, problems are : Problem set: 0 solved, 188 unsolved in 19016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 189/332 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 188/347 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 360 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49180ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 49202ms
Starting structural reductions in LTL mode, iteration 1 : 143/173 places, 189/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49982 ms. Remains : 143/173 places, 189/219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2026-05-31 20:37:03] [INFO ] Invariant cache hit.
[2026-05-31 20:37:03] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-31 20:37:03] [INFO ] Invariant cache hit.
[2026-05-31 20:37:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 143/143 places, 189/189 transitions.
Support contains 77 out of 143 places after structural reductions.
[2026-05-31 20:37:04] [INFO ] Flatten gal took : 59 ms
[2026-05-31 20:37:04] [INFO ] Flatten gal took : 22 ms
[2026-05-31 20:37:04] [INFO ] Input system was already deterministic with 189 transitions.
Reduction of identical properties reduced properties to check from 67 to 66
RANDOM walk for 40000 steps (8 resets) in 2557 ms. (15 steps per ms) remains 16/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 11/11 properties
[2026-05-31 20:37:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/141 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/143 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 189/332 variables, 143/153 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/332 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 153 constraints, problems are : Problem set: 1 solved, 10 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 126/141 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/143 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 189/332 variables, 143/155 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 10/165 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 165 constraints, problems are : Problem set: 1 solved, 10 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1620ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 117 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=117 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 138 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-31 20:37:07] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:37:07] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:37:07] [INFO ] Input system was already deterministic with 189 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Graph (trivial) has 124 edges and 143 vertex of which 10 / 143 are part of one of the 4 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 136 transition count 144
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 49 rules applied. Total rules applied 87 place count 99 transition count 132
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 94 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 93 transition count 131
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 94 place count 93 transition count 123
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 110 place count 85 transition count 123
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 126 place count 69 transition count 107
Iterating global reduction 4 with 16 rules applied. Total rules applied 142 place count 69 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 69 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 144 place count 69 transition count 102
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 150 place count 66 transition count 102
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 65 transition count 100
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 65 transition count 100
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 178 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 51 transition count 86
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 50 transition count 86
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 49 transition count 84
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 49 transition count 84
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 48 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 48 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 47 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 46 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 45 transition count 78
Applied a total of 191 rules in 73 ms. Remains 45 /143 variables (removed 98) and now considering 78/189 (removed 111) transitions.
[2026-05-31 20:37:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17699639458980948723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5953593846656903885.kers'
[2026-05-31 20:37:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17699639458980948723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5953593846656903885.kers]
Normalized transition count is 74 out of 75 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 44 cols 285 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-31 20:37:07] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5953593846656903885.kers
Total runtime 1 ms.
[2026-05-31 20:37:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-31 20:37:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-31 20:37:07] [INFO ] Invariant cache hit.
[2026-05-31 20:37:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:37:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-31 20:37:07] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-31 20:37:07] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2026-05-31 20:37:07] [INFO ] Invariant cache hit.
[2026-05-31 20:37:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 74/119 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 53 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2951 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 74/119 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 67/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/120 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 120 constraints, problems are : Problem set: 0 solved, 67 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5912ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 5914ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/143 places, 78/189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6127 ms. Remains : 45/143 places, 78/189 transitions.
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 14 ms
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:13] [INFO ] Input system was already deterministic with 78 transitions.
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability9039914346487888543.gal : 6 ms
[2026-05-31 20:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8654104716689195588.ctl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9039914346487888543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8654104716689195588.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,90200,0.038086,4312,2,176,5,1363,6,0,256,1087,0
Converting to forward existential form...Done !
original formula: (AG((((p54==0)||(p59==0))||(p132==0))) + (EF((p99==0)) * EG(AG(((((p75==1)&&(p117==1))&&(p143==1))||(((p94==1)&&(p128==1))&&(p151==1)))))...157
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U (p99==0)) * EG(!(E(TRUE U !(((((p75==1)&&(p117==1))&&(p143==1))||(((p94==1)&&(p128==1...232
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.072477,5092,1,0,9,6399,26,3,1380,3058,10
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 118 transition count 156
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 118 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 110 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 110 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 106 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 103 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 100 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 98 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 98 transition count 125
Applied a total of 90 rules in 48 ms. Remains 98 /143 variables (removed 45) and now considering 125/189 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-681575140020006502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15852478624008331764.kers'
[2026-05-31 20:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-681575140020006502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15852478624008331764.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 98 cols 324 entries
Finished phase 1 with 89 SingleSign rule and 1 generalized
[2026-05-31 20:37:13] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15852478624008331764.kers
Total runtime 2 ms.
[2026-05-31 20:37:13] [INFO ] Implicit Places using invariants in 92 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 125/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 97/143 places, 125/189 transitions.
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:13] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:13] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10179744696486029912.gal : 2 ms
[2026-05-31 20:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability971015592743349791.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/CTLFireability10179744696486029912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability971015592743349791.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.19144e+06,0.061586,5768,2,763,5,7736,6,0,515,7663,0
Converting to forward existential form...Done !
original formula: AG(EX(EX((p107==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(EX((p107==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t15, t23, t65, t75, t83, t85, t101, t104, Intersection with reachable at each step ...213
(forward)formula 0,1,0.308326,12448,1,0,170,42663,266,102,2924,35224,261
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Graph (trivial) has 117 edges and 143 vertex of which 10 / 143 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 136 transition count 149
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 46 rules applied. Total rules applied 79 place count 104 transition count 135
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 86 place count 98 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 97 transition count 134
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 87 place count 97 transition count 123
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 109 place count 86 transition count 123
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 122 place count 73 transition count 110
Iterating global reduction 4 with 13 rules applied. Total rules applied 135 place count 73 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 73 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 136 place count 73 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 142 place count 70 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 69 transition count 97
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 69 transition count 97
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 166 place count 58 transition count 86
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 168 place count 56 transition count 79
Ensure Unique test removed 1 places
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 55 transition count 79
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 54 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 54 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 53 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 53 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 52 transition count 74
Applied a total of 177 rules in 32 ms. Remains 52 /143 variables (removed 91) and now considering 74/189 (removed 115) transitions.
[2026-05-31 20:37:14] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2295010862511776291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4968769674390732180.kers'
[2026-05-31 20:37:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2295010862511776291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4968769674390732180.kers]
Normalized transition count is 70 out of 71 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 52 cols 233 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-31 20:37:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4968769674390732180.kers
Total runtime 0 ms.
[2026-05-31 20:37:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-31 20:37:14] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2026-05-31 20:37:14] [INFO ] Invariant cache hit.
[2026-05-31 20:37:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:37:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2026-05-31 20:37:14] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-31 20:37:14] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2026-05-31 20:37:14] [INFO ] Invariant cache hit.
[2026-05-31 20:37:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 4/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 70/122 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 63 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 4/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 70/122 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 65/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 128 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6454ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/143 places, 74/189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6615 ms. Remains : 52/143 places, 74/189 transitions.
[2026-05-31 20:37:20] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:37:20] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:20] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-31 20:37:20] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:20] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16334328522094872726.gal : 2 ms
[2026-05-31 20:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2085917810365618853.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/CTLFireability16334328522094872726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2085917810365618853.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,433280,0.025429,4628,2,431,5,3043,6,0,280,2452,0
Converting to forward existential form...Done !
original formula: AG(((A(!(((((EG((p28==1)) + (p15==1)) + (p50==1)) * ((((p94==1)&&(p117==1))&&(p143==1))||(((p75==1)&&(p117==1))&&(p143==1)))) * A((((p4==...305
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(EG(E(TRUE U (((p54==1)&&(p59==1))&&(p132==1)))))) * !(!((E(!((((p8==1)&&(p59==1))&&...516
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t18, t20, t22, t30, t39, t59, t70, t72, Intersection with reachable at each step en...209
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.72619,103560,1,0,402,647746,203,230,2072,612142,544
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 119 transition count 165
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 119 transition count 165
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 111 transition count 156
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 111 transition count 156
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 108 transition count 153
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 108 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 107 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 107 transition count 151
Applied a total of 72 rules in 11 ms. Remains 107 /143 variables (removed 36) and now considering 151/189 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11909410752216903656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8034370242356592914.kers'
[2026-05-31 20:37:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11909410752216903656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8034370242356592914.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 107 cols 452 entries
Finished phase 1 with 98 SingleSign rule and 1 generalized
[2026-05-31 20:37:24] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8034370242356592914.kers
Total runtime 1 ms.
[2026-05-31 20:37:24] [INFO ] Implicit Places using invariants in 60 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/143 places, 151/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 106/143 places, 151/189 transitions.
[2026-05-31 20:37:24] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:24] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:24] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-31 20:37:24] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:37:24] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:37:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9824286241039796549.gal : 3 ms
[2026-05-31 20:37:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13742190425186665124.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/CTLFireability9824286241039796549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13742190425186665124.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35285e+07,0.114016,7588,2,1108,5,14991,6,0,577,16938,0
Converting to forward existential form...Done !
original formula: E((EX(!(A((((p94==1)&&(p117==1))&&(p162==1)) U (((p102==1)&&(p54==1))&&((p59==1)&&(p121==1)))))) + (EG((p15==1)) * AF(((p146!=1)||(((p83=...282
=> equivalent forward existential formula: [((FwdU(Init,(EX(!(!((E(!((((p102==1)&&(p54==1))&&((p59==1)&&(p121==1)))) U (!((((p94==1)&&(p117==1))&&(p162==1)...677
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t16, t24, t35, t67, t70, t77, t83, t85, t86, t88, t104, t105, t108, Intersection wi...239
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.15796,31888,1,0,251,153063,357,149,4100,129882,379
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 122 transition count 160
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 122 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 116 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 116 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 113 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 113 transition count 151
Applied a total of 60 rules in 8 ms. Remains 113 /143 variables (removed 30) and now considering 151/189 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10992268305149317568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7356530509708838622.kers'
[2026-05-31 20:37:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10992268305149317568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7356530509708838622.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 113 cols 436 entries
Finished phase 1 with 102 SingleSign rule and 3 generalized
[2026-05-31 20:37:26] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7356530509708838622.kers
Total runtime 1 ms.
[2026-05-31 20:37:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-31 20:37:26] [INFO ] Invariant cache hit.
[2026-05-31 20:37:26] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-31 20:37:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 151/264 variables, 113/126 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 128 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10881 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 151/264 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 150/278 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 280 constraints, problems are : Problem set: 0 solved, 150 unsolved in 16059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26985ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26986ms
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 151/189 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27191 ms. Remains : 113/143 places, 151/189 transitions.
[2026-05-31 20:37:53] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:37:53] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:53] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-31 20:37:53] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:53] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15064867647152345397.gal : 3 ms
[2026-05-31 20:37:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13036297242096641456.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/CTLFireability15064867647152345397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13036297242096641456.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.44985e+07,0.134649,8304,2,1631,5,18963,6,0,605,18417,0
Converting to forward existential form...Done !
original formula: E(!((EF((((p75==1)&&(p117==1))&&(p151==1))) + ((((p71==1) + EG((p152==1))) * (((p13==1)||((p7==1)&&(p65==1)))||(p44!=1))) * (EF((p146==1)...195
=> equivalent forward existential formula: [(FwdU(Init,!((E(TRUE U (((p75==1)&&(p117==1))&&(p151==1))) + ((((p71==1) + EG((p152==1))) * (((p13==1)||((p7==1...259
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t18, t38, t46, t68, t71, t78, t84, t87, t88, t91, t111, t117, t118, Intersection wi...239
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.13043,163280,1,0,418,1.10306e+06,345,234,4074,717558,561
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 119 transition count 157
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 119 transition count 157
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 110 transition count 147
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 110 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 106 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 103 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 103 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 100 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 100 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 98 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 98 transition count 125
Applied a total of 90 rules in 12 ms. Remains 98 /143 variables (removed 45) and now considering 125/189 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6262785121482922417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8544597865373818000.kers'
[2026-05-31 20:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6262785121482922417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8544597865373818000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 98 cols 324 entries
Finished phase 1 with 89 SingleSign rule and 1 generalized
[2026-05-31 20:37:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8544597865373818000.kers
Total runtime 1 ms.
[2026-05-31 20:37:59] [INFO ] Implicit Places using invariants in 55 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/143 places, 125/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 97/143 places, 125/189 transitions.
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:37:59] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7847338550107442648.gal : 1 ms
[2026-05-31 20:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15040160918172405629.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/CTLFireability7847338550107442648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15040160918172405629.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,8.49786e+06,0.095257,6348,2,987,5,10379,6,0,515,10940,0
Converting to forward existential form...Done !
original formula: (EF((EF((p30==1)) + ((p66==1)&&(p120==0)))) * AX(FALSE))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (E(TRUE U (p30==1)) + ((p66==1)&&(p120==0))))))] = FALSE * [(EY(Init) * !(FALSE))] = FALSE)
(forward)formula 0,0,0.102321,6348,1,0,6,10379,7,1,621,10940,1
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 117 transition count 155
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 117 transition count 155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 108 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 108 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 105 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 105 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 103 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 103 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 102 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 102 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 101 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 101 transition count 132
Applied a total of 84 rules in 13 ms. Remains 101 /143 variables (removed 42) and now considering 132/189 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16676647649876755328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8481804503066168194.kers'
[2026-05-31 20:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16676647649876755328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8481804503066168194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 101 cols 354 entries
Finished phase 1 with 92 SingleSign rule and 1 generalized
[2026-05-31 20:37:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8481804503066168194.kers
Total runtime 2 ms.
[2026-05-31 20:37:59] [INFO ] Implicit Places using invariants in 109 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/143 places, 132/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 100/143 places, 132/189 transitions.
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:37:59] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:37:59] [INFO ] Flatten gal took : 19 ms
[2026-05-31 20:37:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11645173757906378077.gal : 2 ms
[2026-05-31 20:37:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4908210387394610415.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/CTLFireability11645173757906378077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4908210387394610415.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01716e+07,0.153234,6368,2,852,5,10175,6,0,534,10732,0
Converting to forward existential form...Done !
original formula: E(!(EF(EX(AG((p22==1))))) U A(!(EX(AF((p150==1)))) U (AF(AX((p25==1))) + !(EF(AG((p68==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U EX(!(E(TRUE U !((p22==1)))))))) * !(EG(!((!(EG(!(!(EX(!((p25==1))))))) + !(E(TRUE U !(E(...385
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t17, t25, t65, t68, t75, t81, t83, t84, t86, t102, t103, t106, Intersection wi...239
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.937361,25604,1,0,220,123877,304,119,3652,101026,318
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 118 transition count 164
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 118 transition count 164
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 110 transition count 155
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 110 transition count 155
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 107 transition count 152
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 107 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 106 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 106 transition count 150
Applied a total of 74 rules in 5 ms. Remains 106 /143 variables (removed 37) and now considering 150/189 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17591554639102448822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6508307739869979580.kers'
[2026-05-31 20:38:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17591554639102448822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6508307739869979580.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 106 cols 450 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-31 20:38:00] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6508307739869979580.kers
Total runtime 1 ms.
[2026-05-31 20:38:00] [INFO ] Implicit Places using invariants in 60 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/143 places, 150/189 transitions.
Applied a total of 0 rules in 0 ms. Remains 105 /105 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 105/143 places, 150/189 transitions.
[2026-05-31 20:38:00] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:00] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:00] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-31 20:38:00] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:00] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:00] [INFO ] Time to serialize gal into /tmp/CTLFireability152433660169688652.gal : 2 ms
[2026-05-31 20:38:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11544119781913453677.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/CTLFireability152433660169688652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11544119781913453677.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30372e+07,0.088093,6760,2,921,5,11987,6,0,572,12430,0
Converting to forward existential form...Done !
original formula: EF((AX((((p170==1)&&(p15==1))||(((p83==1)&&(p109==1))&&(p143==1)))) * EF((((((p4==1)&&(p39==1))&&((p47==1)&&(p59==1)))||(((p4==1)&&(p29==...210
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(!((((p170==1)&&(p15==1))||(((p83==1)&&(p109==1))&&(p143==1))))))),TRUE) * (((((p4...275
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t16, t24, t66, t69, t76, t82, t84, t85, t87, t103, t104, t107, Intersection with re...234
(forward)formula 0,0,0.566973,16028,1,0,204,63456,318,125,3413,49893,308
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 120 transition count 158
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 120 transition count 158
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 112 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 112 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 109 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 109 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 107 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 107 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 105 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 105 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 104 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 104 transition count 134
Applied a total of 78 rules in 9 ms. Remains 104 /143 variables (removed 39) and now considering 134/189 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13514937459262620454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3689911991216952249.kers'
[2026-05-31 20:38:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13514937459262620454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3689911991216952249.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 104 cols 358 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-31 20:38:01] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3689911991216952249.kers
Total runtime 4 ms.
[2026-05-31 20:38:01] [INFO ] Implicit Places using invariants in 131 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/143 places, 134/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 103/143 places, 134/189 transitions.
[2026-05-31 20:38:01] [INFO ] Flatten gal took : 11 ms
[2026-05-31 20:38:01] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:01] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-31 20:38:01] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:01] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:38:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8794743126684998525.gal : 1 ms
[2026-05-31 20:38:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5083692307482459005.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/CTLFireability8794743126684998525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5083692307482459005.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11788e+07,0.095716,6928,2,1049,5,12528,6,0,548,14110,0
Converting to forward existential form...Done !
original formula: AF(AG(((AX((p40==0)) + (p149==0)) + ((p120==0)||((p148==1)&&(p24==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EX(!((p40==0)))) + (p149==0)) + ((p120==0)||((p148==1)&&(p24==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t27, t37, t68, t71, t78, t87, t89, t105, t108, Intersection with reachabl...228
(forward)formula 0,0,6.62943,158524,1,0,444,862780,298,286,3415,940940,500
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 119 transition count 165
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 119 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 112 transition count 157
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 112 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 110 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 110 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 108 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 108 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 106 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 106 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 105 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 105 transition count 140
Applied a total of 76 rules in 12 ms. Remains 105 /143 variables (removed 38) and now considering 140/189 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7114350555944324200.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15712938907408203986.kers'
[2026-05-31 20:38:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7114350555944324200.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15712938907408203986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 105 cols 394 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-31 20:38:08] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15712938907408203986.kers
Total runtime 1 ms.
[2026-05-31 20:38:08] [INFO ] Implicit Places using invariants in 89 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/143 places, 140/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 104/143 places, 140/189 transitions.
[2026-05-31 20:38:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:38:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:38:08] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-31 20:38:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:38:08] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability321188854281753959.gal : 2 ms
[2026-05-31 20:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2665035780162049401.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/CTLFireability321188854281753959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2665035780162049401.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11141e+07,0.123814,6232,2,961,5,9559,6,0,558,9656,0
Converting to forward existential form...Done !
original formula: E((p138==1) U !(((p103==1) + (AX(EF((p127==1))) * AX(!((((p83==1)&&(p128==1))&&(p143==1))))))))
=> equivalent forward existential formula: ([(EY((FwdU(Init,(p138==1)) * !((p103==1)))) * !(E(TRUE U (p127==1))))] != FALSE + [(EY((FwdU(Init,(p138==1)) * ...218
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t15, t25, t57, t68, t78, t86, t88, t104, t107, Intersection with reachable at each ...218
Hit Full ! (commute/partial/dont) 138/0/2
(forward)formula 0,0,3.63714,74116,1,0,223,476993,311,135,3483,295793,334
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 170
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 170
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 116 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 116 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 113 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 113 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 111 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 111 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 109 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 109 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 108 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 108 transition count 143
Applied a total of 70 rules in 5 ms. Remains 108 /143 variables (removed 35) and now considering 143/189 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9312930929919731388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8575849107528678000.kers'
[2026-05-31 20:38:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9312930929919731388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8575849107528678000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 108 cols 400 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-31 20:38:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8575849107528678000.kers
Total runtime 1 ms.
[2026-05-31 20:38:12] [INFO ] Implicit Places using invariants in 84 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/143 places, 143/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 107/143 places, 143/189 transitions.
[2026-05-31 20:38:12] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:12] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:12] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-31 20:38:12] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:38:12] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12145354446330575495.gal : 1 ms
[2026-05-31 20:38:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10422922890057946692.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/CTLFireability12145354446330575495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10422922890057946692.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44182e+07,0.133361,7936,2,1130,5,16083,6,0,573,18588,0
Converting to forward existential form...Done !
original formula: (AG((!(A(AX((p90==1)) U AF((p99==1)))) + !(A((((p94==1)&&(p109==1))&&(p162==1)) U (E((p38==1) U (p66==1)) + ((p122==1)&&(p53==1))))))) * ...213
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(!(!((E(!((E((p38==1) U (p66==1)) + ((p122==1)&&(p53==1)))) U (!((((p94==1)&&(p109==1))&...497
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t14, t17, t22, t26, t30, t34, t69, t72, t74, t80, t82, t89, t91, t107, t110, Inters...248
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.87928,57892,1,0,453,348504,335,249,3622,319844,558
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 123 transition count 169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 123 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 117 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 117 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 115 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 115 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 114 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 114 transition count 158
Applied a total of 58 rules in 9 ms. Remains 114 /143 variables (removed 29) and now considering 158/189 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-714975439291563920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11107242938308150315.kers'
[2026-05-31 20:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-714975439291563920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11107242938308150315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 114 cols 466 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-31 20:38:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11107242938308150315.kers
Total runtime 1 ms.
[2026-05-31 20:38:14] [INFO ] Implicit Places using invariants in 84 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 158/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 113/143 places, 158/189 transitions.
[2026-05-31 20:38:14] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:14] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:14] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-31 20:38:14] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:14] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:38:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13914862404584854360.gal : 2 ms
[2026-05-31 20:38:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14756073672258655537.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/CTLFireability13914862404584854360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14756073672258655537.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.22499e+07,0.274275,9300,2,1602,5,22021,6,0,612,24950,0
Converting to forward existential form...Done !
original formula: E(E(!((EG(E((p21==1) U (p70==1))) * ((((p1==1)||(p157==1))&&((p157==1)||(p116==1))) + EX((p36==1))))) U !(EG(AF((p70==1))))) U ((A(A((A((...288
=> equivalent forward existential formula: [((((FwdU(Init,E(!((EG(E((p21==1) U (p70==1))) * ((((p1==1)||(p157==1))&&((p157==1)||(p116==1))) + EX((p36==1)))...544
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t14, t15, t17, t25, t29, t37, t51, t56, t70, t73, t75, t79, t82, t85, t89, t91, t92, ...278
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.77483,185032,1,0,560,893040,392,357,4176,1.25877e+06,697
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 118 transition count 156
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 118 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 110 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 110 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 107 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 107 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 105 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 105 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 103 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 103 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 102 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 102 transition count 132
Applied a total of 82 rules in 6 ms. Remains 102 /143 variables (removed 41) and now considering 132/189 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1292307251117442684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3101723286291667519.kers'
[2026-05-31 20:38:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1292307251117442684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3101723286291667519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 102 cols 354 entries
Finished phase 1 with 93 SingleSign rule and 1 generalized
[2026-05-31 20:38:22] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3101723286291667519.kers
Total runtime 1 ms.
[2026-05-31 20:38:22] [INFO ] Implicit Places using invariants in 91 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/143 places, 132/189 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 101/143 places, 132/189 transitions.
[2026-05-31 20:38:22] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:38:22] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:38:22] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-31 20:38:22] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:38:22] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:38:22] [INFO ] Time to serialize gal into /tmp/CTLFireability10024047420400894490.gal : 1 ms
[2026-05-31 20:38:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2681198016107430640.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/CTLFireability10024047420400894490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2681198016107430640.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,9.74999e+06,0.133622,6472,2,907,5,10662,6,0,538,11563,0
Converting to forward existential form...Done !
original formula: EF(AX(EG((AF((p149==1)) * E((p165==1) U (p133==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((!(EG(!((p149==1)))) * E((p165==1) U (p133==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t15, t19, t27, t67, t77, t85, t87, t103, t106, Intersection with reachable at ...223
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.24053,32644,1,0,382,181659,298,201,3340,155336,480
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Graph (trivial) has 136 edges and 143 vertex of which 12 / 143 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 136 transition count 141
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 58 rules applied. Total rules applied 99 place count 96 transition count 123
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 111 place count 87 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 84 transition count 120
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 114 place count 84 transition count 112
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 130 place count 76 transition count 112
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 141 place count 65 transition count 93
Iterating global reduction 4 with 11 rules applied. Total rules applied 152 place count 65 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 152 place count 65 transition count 92
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 64 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 62 transition count 84
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 62 transition count 84
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 190 place count 46 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 43 transition count 58
Ensure Unique test removed 1 places
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 42 transition count 58
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 41 transition count 56
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 41 transition count 56
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 40 transition count 54
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 40 transition count 54
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 4 with 2 rules applied. Total rules applied 203 place count 39 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 206 place count 39 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 38 transition count 49
Applied a total of 208 rules in 46 ms. Remains 38 /143 variables (removed 105) and now considering 49/189 (removed 140) transitions.
[2026-05-31 20:38:23] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11329008747541593635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4104905883893135375.kers'
[2026-05-31 20:38:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11329008747541593635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4104905883893135375.kers]
Normalized transition count is 44 out of 45 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 44 rows 37 cols 119 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-31 20:38:23] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4104905883893135375.kers
Total runtime 2 ms.
[2026-05-31 20:38:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-31 20:38:23] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2026-05-31 20:38:23] [INFO ] Invariant cache hit.
[2026-05-31 20:38:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-31 20:38:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-05-31 20:38:23] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-31 20:38:23] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2026-05-31 20:38:23] [INFO ] Invariant cache hit.
[2026-05-31 20:38:23] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/83 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 55 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5176ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5177ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/143 places, 49/189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5340 ms. Remains : 38/143 places, 49/189 transitions.
[2026-05-31 20:38:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:29] [INFO ] Input system was already deterministic with 49 transitions.
[2026-05-31 20:38:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:29] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16853167458202854000.gal : 0 ms
[2026-05-31 20:38:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11375984468045657333.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/CTLFireability16853167458202854000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11375984468045657333.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,18001,0.018202,4104,2,117,5,677,6,0,196,563,0
Converting to forward existential form...Done !
original formula: EG(EF(!(A((AF((p108==1)) * ((p71==1)||(p115==1))) U EF((p0==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(!((E(!(E(TRUE U (p0==1))) U (!((!(EG(!((p108==1)))) * ((p71==1)||(p115==1)))) * !(E(TRUE U...209
Reverse transition relation is NOT exact ! Due to transitions t4, t21, t22, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.072774,5220,1,0,80,5605,131,43,1291,5467,130
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Graph (trivial) has 140 edges and 143 vertex of which 12 / 143 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 135 transition count 139
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 59 rules applied. Total rules applied 101 place count 94 transition count 121
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 111 place count 85 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 84 transition count 120
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 112 place count 84 transition count 111
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 130 place count 75 transition count 111
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 144 place count 61 transition count 89
Iterating global reduction 4 with 14 rules applied. Total rules applied 158 place count 61 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 158 place count 61 transition count 86
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 164 place count 58 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 168 place count 54 transition count 70
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 54 transition count 70
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 198 place count 41 transition count 57
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 201 place count 38 transition count 53
Ensure Unique test removed 1 places
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 37 transition count 53
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 36 transition count 51
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 36 transition count 51
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 208 place count 35 transition count 49
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 35 transition count 49
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 4 with 2 rules applied. Total rules applied 211 place count 34 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 215 place count 34 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 33 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 32 transition count 42
Applied a total of 218 rules in 47 ms. Remains 32 /143 variables (removed 111) and now considering 42/189 (removed 147) transitions.
[2026-05-31 20:38:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11534022184514636754.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6719321079620213091.kers'
[2026-05-31 20:38:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11534022184514636754.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6719321079620213091.kers]
Normalized transition count is 37 out of 38 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 37 rows 32 cols 95 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-31 20:38:29] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6719321079620213091.kers
Total runtime 1 ms.
[2026-05-31 20:38:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-31 20:38:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-05-31 20:38:29] [INFO ] Invariant cache hit.
[2026-05-31 20:38:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-31 20:38:29] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-31 20:38:29] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2026-05-31 20:38:29] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-05-31 20:38:29] [INFO ] Invariant cache hit.
[2026-05-31 20:38:29] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 4/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 1/70 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 4/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 35/82 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 83 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 32/32 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2816ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 2817ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/143 places, 42/189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3003 ms. Remains : 32/143 places, 42/189 transitions.
[2026-05-31 20:38:32] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:32] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:32] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-31 20:38:32] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:32] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:38:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15183350612706548664.gal : 1 ms
[2026-05-31 20:38:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10958668670122712847.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/CTLFireability15183350612706548664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10958668670122712847.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,9288,0.014581,4036,2,105,5,502,6,0,165,378,0
Converting to forward existential form...Done !
original formula: EG((p23==0))
=> equivalent forward existential formula: [FwdG(Init,(p23==0))] != FALSE
Hit Full ! (commute/partial/dont) 40/0/2
(forward)formula 0,1,0.031329,4380,1,0,7,2276,19,1,808,1187,8
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 189/189 transitions.
Graph (trivial) has 137 edges and 143 vertex of which 12 / 143 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 135 transition count 138
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 58 rules applied. Total rules applied 101 place count 93 transition count 122
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 110 place count 85 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 113 place count 84 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 83 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 114 place count 83 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 128 place count 76 transition count 112
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 142 place count 62 transition count 90
Iterating global reduction 5 with 14 rules applied. Total rules applied 156 place count 62 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 156 place count 62 transition count 87
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 162 place count 59 transition count 87
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 166 place count 55 transition count 71
Iterating global reduction 5 with 4 rules applied. Total rules applied 170 place count 55 transition count 71
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 200 place count 40 transition count 56
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 203 place count 37 transition count 52
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 207 place count 36 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 35 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 35 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 34 transition count 48
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 34 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 33 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 33 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 31 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 221 place count 30 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 30 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 227 place count 30 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 229 place count 28 transition count 35
Applied a total of 229 rules in 38 ms. Remains 28 /143 variables (removed 115) and now considering 35/189 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6636169881943407012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11899375670088315741.kers'
[2026-05-31 20:38:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6636169881943407012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11899375670088315741.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 34 rows 27 cols 83 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-31 20:38:32] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11899375670088315741.kers
Total runtime 1 ms.
[2026-05-31 20:38:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-31 20:38:32] [INFO ] Invariant cache hit.
[2026-05-31 20:38:32] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2026-05-31 20:38:32] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-31 20:38:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 34/62 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/63 variables, and 34 constraints, problems are : Problem set: 0 solved, 22 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 34/62 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/63 variables, and 56 constraints, problems are : Problem set: 0 solved, 22 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1330ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/143 places, 35/189 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1509 ms. Remains : 28/143 places, 35/189 transitions.
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:38:33] [INFO ] Input system was already deterministic with 35 transitions.
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 1 ms
[2026-05-31 20:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4054734391901055795.gal : 1 ms
[2026-05-31 20:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4168387298269417883.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/CTLFireability4054734391901055795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4168387298269417883.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,6048,0.011737,3980,2,68,5,392,5,0,148,307,0
Converting to forward existential form...Done !
original formula: EF(EG(AF((p88==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((p88==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.024059,4252,1,0,8,1666,22,3,657,958,10
FORMULA ErlangenMainframeV1-PT-bP01C01-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:38:33] [INFO ] Flatten gal took : 7 ms
Total runtime 140537 ms.
BK_STOP 1780259913894
--------------------
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="ErlangenMainframeV1-PT-bP01C01"
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 ErlangenMainframeV1-PT-bP01C01, 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 r338-smll-178021499000050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV1-PT-bP01C01.tgz
mv ErlangenMainframeV1-PT-bP01C01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;