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-178021499100066.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-bP03C03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.7K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 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 96K 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-bP03C03-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780260834990

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-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 20:53:57] [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:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:53:58] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-31 20:53:58] [INFO ] Transformed 213 places.
[2026-05-31 20:53:58] [INFO ] Transformed 327 transitions.
[2026-05-31 20:53:58] [INFO ] Found NUPN structural information;
[2026-05-31 20:53:58] [INFO ] Parsed PT model containing 213 places and 327 transitions and 1410 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 90 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 327/327 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 185 transition count 299
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 185 transition count 299
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 176 transition count 290
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 176 transition count 290
Applied a total of 74 rules in 89 ms. Remains 176 /213 variables (removed 37) and now considering 290/327 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6904732701457134810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11177621656369325509.kers'
[2026-05-31 20:53:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6904732701457134810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11177621656369325509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 176 cols 1336 entries
Finished phase 1 with 161 SingleSign rule and 3 generalized
[2026-05-31 20:53:58] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11177621656369325509.kers
Total runtime 5 ms.
[2026-05-31 20:53:58] [INFO ] Implicit Places using invariants in 442 ms returned []
[2026-05-31 20:53:58] [INFO ] Invariant cache hit.
[2026-05-31 20:53:59] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2026-05-31 20:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 290/466 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 199 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 290/466 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 289/490 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 11/501 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 289 unsolved
SMT process timed out in 60572ms, After SMT, problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60605ms
Starting structural reductions in LTL mode, iteration 1 : 176/213 places, 290/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 176/213 places, 290/327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2026-05-31 20:54:59] [INFO ] Invariant cache hit.
[2026-05-31 20:55:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-31 20:55:00] [INFO ] Invariant cache hit.
[2026-05-31 20:55:00] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 176/176 places, 290/290 transitions.
Support contains 90 out of 176 places after structural reductions.
[2026-05-31 20:55:00] [INFO ] Flatten gal took : 91 ms
[2026-05-31 20:55:00] [INFO ] Flatten gal took : 43 ms
[2026-05-31 20:55:00] [INFO ] Input system was already deterministic with 290 transitions.
Reduction of identical properties reduced properties to check from 76 to 75
RANDOM walk for 40000 steps (8 resets) in 2432 ms. (16 steps per ms) remains 30/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
[2026-05-31 20:55:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/165 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/176 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 290/466 variables, 176/188 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 3/191 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/466 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 191 constraints, problems are : Problem set: 3 solved, 22 unsolved in 1832 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 128/164 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 12/176 variables, 3/13 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 2/15 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp57 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 290/466 variables, 176/192 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 21/213 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 5/218 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/220 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 1/221 constraints. Problems are: Problem set: 4 solved, 21 unsolved
SMT process timed out in 7048ms, After SMT, problems are : Problem set: 4 solved, 21 unsolved
Fused 21 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 203 ms.
Support contains 32 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 290/290 transitions.
Graph (trivial) has 127 edges and 176 vertex of which 10 / 176 are part of one of the 4 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 170 transition count 235
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
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 1 with 53 rules applied. Total rules applied 98 place count 126 transition count 226
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 124 transition count 222
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 109 place count 120 transition count 221
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 109 place count 120 transition count 212
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 127 place count 111 transition count 212
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 139 place count 99 transition count 192
Iterating global reduction 4 with 12 rules applied. Total rules applied 151 place count 99 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 99 transition count 191
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 152 place count 99 transition count 189
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 156 place count 97 transition count 189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 159 place count 94 transition count 168
Iterating global reduction 5 with 3 rules applied. Total rules applied 162 place count 94 transition count 168
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 198 place count 76 transition count 150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -61
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 212 place count 69 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 69 transition count 209
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 69 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 218 place count 67 transition count 207
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 67 transition count 207
Applied a total of 219 rules in 175 ms. Remains 67 /176 variables (removed 109) and now considering 207/290 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 67/176 places, 207/290 transitions.
RANDOM walk for 40000 steps (8 resets) in 1474 ms. (27 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40002 steps (8 resets) in 357 ms. (111 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
[2026-05-31 20:55:10] [INFO ] Flow matrix only has 203 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-5142836562447716711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4668404366493698227.kers'
[2026-05-31 20:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5142836562447716711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4668404366493698227.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 67 cols 1234 entries
Finished phase 1 with 52 SingleSign rule and 3 generalized
[2026-05-31 20:55:10] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4668404366493698227.kers
Total runtime 2 ms.
[2026-05-31 20:55:10] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 38/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 203/270 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 102 constraints, problems are : Problem set: 0 solved, 12 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 38/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 203/270 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 23/102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 114 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2274ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 10 properties in 1243 ms.
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 207/207 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 206
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 66 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 65 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4 place count 65 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 14 place count 60 transition count 200
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 56 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 23 place count 55 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 55 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 27 place count 52 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 30 place count 52 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 52 transition count 131
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 43 place count 46 transition count 125
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 45 place count 44 transition count 122
Ensure Unique test removed 2 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 49 place count 42 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 50 place count 41 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 41 transition count 114
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 53 place count 40 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 55 place count 39 transition count 117
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 59 place count 39 transition count 113
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 39 transition count 109
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 67 place count 35 transition count 109
Applied a total of 67 rules in 41 ms. Remains 35 /67 variables (removed 32) and now considering 109/207 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 35/67 places, 109/207 transitions.
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/2 properties
BEST_FIRST walk for 36757 steps (8 resets) in 68 ms. (532 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:55:14] [INFO ] Flatten gal took : 29 ms
[2026-05-31 20:55:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:55:14] [INFO ] Flatten gal took : 29 ms
[2026-05-31 20:55:14] [INFO ] Input system was already deterministic with 290 transitions.
Support contains 68 out of 176 places (down from 83) after GAL structural reductions.
Computed a total of 21 stabilizing places and 21 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Graph (trivial) has 156 edges and 176 vertex of which 10 / 176 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 169 transition count 232
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 65 rules applied. Total rules applied 116 place count 119 transition count 217
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 113 transition count 217
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 122 place count 113 transition count 206
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 144 place count 102 transition count 206
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 162 place count 84 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 181 place count 83 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 181 place count 83 transition count 168
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 81 transition count 168
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 195 place count 71 transition count 98
Ensure Unique test removed 2 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 207 place count 69 transition count 98
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 66 transition count 88
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 214 place count 65 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 65 transition count 86
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 253 place count 46 transition count 67
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 42 transition count 60
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 42 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 42 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 39 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 274 place count 38 transition count 50
Applied a total of 274 rules in 43 ms. Remains 38 /176 variables (removed 138) and now considering 50/290 (removed 240) transitions.
[2026-05-31 20:55:14] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9701842490862736870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1155222540115315089.kers'
[2026-05-31 20:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9701842490862736870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1155222540115315089.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 42 rows 35 cols 119 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-31 20:55:14] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1155222540115315089.kers
Total runtime 3 ms.
[2026-05-31 20:55:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 20:55:14] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2026-05-31 20:55:14] [INFO ] Invariant cache hit.
[2026-05-31 20:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:55:14] [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:55:14] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2026-05-31 20:55:14] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2026-05-31 20:55:14] [INFO ] Invariant cache hit.
[2026-05-31 20:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 4/38 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/80 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 48 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 4/38 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/80 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 41/88 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/81 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/81 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 90 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 2930ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/176 places, 50/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3113 ms. Remains : 38/176 places, 50/290 transitions.
[2026-05-31 20:55:17] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:55:17] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:17] [INFO ] Input system was already deterministic with 50 transitions.
[2026-05-31 20:55:17] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:55:17] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9696478430553583470.gal : 3 ms
[2026-05-31 20:55:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15110355136060831994.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9696478430553583470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15110355136060831994.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,94464,0.033747,4064,2,77,5,539,6,0,199,365,0


Converting to forward existential form...Done !
original formula: EF(AG((AF((((p94==0)||(p99==0))||(p161==0))) + (p144==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!((((p94==0)||(p99==0))||(p161==0))))) + (p144==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.112209,5580,1,0,22,9432,24,5,1006,8163,18
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Graph (trivial) has 148 edges and 176 vertex of which 8 / 176 are part of one of the 3 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 170 transition count 236
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 58 rules applied. Total rules applied 106 place count 123 transition count 225
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 110 place count 119 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 110 place count 119 transition count 214
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 132 place count 108 transition count 214
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 153 place count 87 transition count 175
Ensure Unique test removed 1 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 175 place count 86 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 178 place count 86 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 85 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 179 place count 85 transition count 169
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 185 place count 82 transition count 169
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 192 place count 75 transition count 127
Ensure Unique test removed 2 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 201 place count 73 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 203 place count 71 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 71 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 206 place count 70 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 207 place count 70 transition count 105
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 243 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 51 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 51 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 248 place count 51 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 250 place count 50 transition count 81
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 50 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 49 transition count 80
Applied a total of 252 rules in 79 ms. Remains 49 /176 variables (removed 127) and now considering 80/290 (removed 210) transitions.
[2026-05-31 20:55:17] [INFO ] Flow matrix only has 78 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12391553665390873817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1389247722216759834.kers'
[2026-05-31 20:55:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12391553665390873817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1389247722216759834.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 49 cols 364 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-31 20:55:17] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1389247722216759834.kers
Total runtime 1 ms.
[2026-05-31 20:55:17] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-31 20:55:17] [INFO ] Flow matrix only has 78 transitions (discarded 2 similar events)
[2026-05-31 20:55:17] [INFO ] Invariant cache hit.
[2026-05-31 20:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:55:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-31 20:55:18] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-31 20:55:18] [INFO ] Flow matrix only has 78 transitions (discarded 2 similar events)
[2026-05-31 20:55:18] [INFO ] Invariant cache hit.
[2026-05-31 20:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 77/126 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 59 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 4/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 77/126 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 69/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 128 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5837ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 5837ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/176 places, 80/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6081 ms. Remains : 49/176 places, 80/290 transitions.
[2026-05-31 20:55:23] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:55:23] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:23] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-31 20:55:23] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:55:23] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1437779582342343257.gal : 4 ms
[2026-05-31 20:55:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3031720490459462562.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/CTLFireability1437779582342343257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3031720490459462562.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.57696e+06,0.029711,4572,2,365,5,2402,6,0,275,1789,0


Converting to forward existential form...Done !
original formula: AF(AG(((p71==0)&&((((p14==0)||(p29==0))||((p48==0)||(p99==0)))||(((p195==0)||(p134==0))||((p168==0)||(p183==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p71==0)&&((((p14==0)||(p29==0))||((p48==0)||(p99==0)))||(((p195==0)||(p134==0))||((p...191
Reverse transition relation is NOT exact ! Due to transitions t26, t45, t53, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.809389,22600,1,0,178,97541,185,132,2332,108656,240
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-01 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 : 176/176 places, 290/290 transitions.
Graph (trivial) has 163 edges and 176 vertex of which 12 / 176 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 168 transition count 229
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 67 rules applied. Total rules applied 120 place count 116 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 110 transition count 214
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 126 place count 110 transition count 205
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 144 place count 101 transition count 205
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 161 place count 84 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 179 place count 83 transition count 170
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 179 place count 83 transition count 167
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 80 transition count 167
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 194 place count 71 transition count 98
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 204 place count 70 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 206 place count 68 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 68 transition count 90
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 48 transition count 70
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 252 place count 44 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 256 place count 44 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 262 place count 44 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 41 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 40 transition count 53
Applied a total of 269 rules in 30 ms. Remains 40 /176 variables (removed 136) and now considering 53/290 (removed 237) transitions.
[2026-05-31 20:55:24] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-176657208084769133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17945252758890089867.kers'
[2026-05-31 20:55:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-176657208084769133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17945252758890089867.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 45 rows 39 cols 134 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-31 20:55:24] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17945252758890089867.kers
Total runtime 0 ms.
[2026-05-31 20:55:24] [INFO ] Implicit Places using invariants in 51 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 39/176 places, 53/290 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 52
Applied a total of 2 rules in 8 ms. Remains 38 /39 variables (removed 1) and now considering 52/53 (removed 1) transitions.
[2026-05-31 20:55:24] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1474418173904020974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17183984164804725800.kers'
[2026-05-31 20:55:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1474418173904020974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17183984164804725800.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 128 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-31 20:55:24] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17183984164804725800.kers
Total runtime 0 ms.
[2026-05-31 20:55:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-31 20:55:24] [INFO ] Flow matrix only has 45 transitions (discarded 7 similar events)
[2026-05-31 20:55:24] [INFO ] Invariant cache hit.
[2026-05-31 20:55:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 38/176 places, 52/290 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 189 ms. Remains : 38/176 places, 52/290 transitions.
[2026-05-31 20:55:24] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:55:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:55:24] [INFO ] Input system was already deterministic with 52 transitions.
[2026-05-31 20:55:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:55:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:55:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11829804135255544656.gal : 1 ms
[2026-05-31 20:55:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5348783229719493122.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/CTLFireability11829804135255544656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5348783229719493122.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,90720,0.017475,4304,2,170,5,1759,6,0,202,1720,0


Converting to forward existential form...Done !
original formula: EF(AG((p31==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p31==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.031475,4664,1,0,6,4274,15,0,968,1720,5
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-02 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 : 176/176 places, 290/290 transitions.
Graph (trivial) has 157 edges and 176 vertex of which 12 / 176 are part of one of the 5 SCC in 0 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 168 transition count 232
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 62 rules applied. Total rules applied 112 place count 119 transition count 219
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 118 place count 114 transition count 218
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 121 place count 113 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 112 transition count 216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 122 place count 112 transition count 206
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 142 place count 102 transition count 206
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 160 place count 84 transition count 170
Ensure Unique test removed 1 places
Iterating global reduction 5 with 19 rules applied. Total rules applied 179 place count 83 transition count 170
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 179 place count 83 transition count 167
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 185 place count 80 transition count 167
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 195 place count 70 transition count 97
Ensure Unique test removed 2 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 207 place count 68 transition count 97
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 210 place count 65 transition count 87
Iterating global reduction 5 with 3 rules applied. Total rules applied 213 place count 65 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 64 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 64 transition count 85
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 253 place count 45 transition count 66
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 257 place count 41 transition count 59
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 41 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 267 place count 41 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 273 place count 38 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 37 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 275 place count 36 transition count 49
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 279 place count 36 transition count 45
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 281 place count 36 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 283 place count 34 transition count 43
Applied a total of 283 rules in 46 ms. Remains 34 /176 variables (removed 142) and now considering 43/290 (removed 247) transitions.
[2026-05-31 20:55:25] [INFO ] Flow matrix only has 39 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-2502770039970874740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1386109488501368634.kers'
[2026-05-31 20:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2502770039970874740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1386109488501368634.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 38 rows 31 cols 93 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-31 20:55:25] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1386109488501368634.kers
Total runtime 16 ms.
[2026-05-31 20:55:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-31 20:55:25] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2026-05-31 20:55:25] [INFO ] Invariant cache hit.
[2026-05-31 20:55:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-31 20:55:25] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-31 20:55:25] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2026-05-31 20:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/72 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 38/72 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1830ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/176 places, 43/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2035 ms. Remains : 34/176 places, 43/290 transitions.
[2026-05-31 20:55:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:55:27] [INFO ] Input system was already deterministic with 43 transitions.
[2026-05-31 20:55:27] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:55:27] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:55:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12921359065188981909.gal : 2 ms
[2026-05-31 20:55:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3454110102793759640.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/CTLFireability12921359065188981909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3454110102793759640.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,36288,0.01441,4064,2,61,5,430,5,0,179,302,0


Converting to forward existential form...Done !
original formula: AF(AG(!(A((p83==1) U AG((p207==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(!(E(TRUE U !((p207==1))))) U (!((p83==1)) * !(!(E(TRUE U !((p207==1))))))) + ...204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.028726,4484,1,0,7,1761,21,1,829,679,11
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 147 transition count 253
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 147 transition count 253
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 135 transition count 216
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 135 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 130 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 130 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 127 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 127 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 126 transition count 178
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 126 transition count 178
Applied a total of 100 rules in 18 ms. Remains 126 /176 variables (removed 50) and now considering 178/290 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2789421066736123580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7353519184500250014.kers'
[2026-05-31 20:55:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2789421066736123580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7353519184500250014.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 126 cols 658 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-05-31 20:55:27] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7353519184500250014.kers
Total runtime 2 ms.
[2026-05-31 20:55:27] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-31 20:55:27] [INFO ] Invariant cache hit.
[2026-05-31 20:55:27] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-31 20:55:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/304 variables, 126/146 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 146 constraints, problems are : Problem set: 0 solved, 177 unsolved in 14362 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/304 variables, 126/146 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 177/323 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 329 constraints, problems are : Problem set: 0 solved, 177 unsolved in 23402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37818ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 37819ms
Starting structural reductions in LTL mode, iteration 1 : 126/176 places, 178/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38219 ms. Remains : 126/176 places, 178/290 transitions.
[2026-05-31 20:56:05] [INFO ] Flatten gal took : 17 ms
[2026-05-31 20:56:05] [INFO ] Flatten gal took : 18 ms
[2026-05-31 20:56:05] [INFO ] Input system was already deterministic with 178 transitions.
[2026-05-31 20:56:05] [INFO ] Flatten gal took : 15 ms
[2026-05-31 20:56:05] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:56:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10219707355089862530.gal : 7 ms
[2026-05-31 20:56:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5664730442603712895.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/CTLFireability10219707355089862530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5664730442603712895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.67319e+08,0.418048,11556,2,4387,5,34158,6,0,684,24930,0


Converting to forward existential form...Done !
original formula: (AG((p120==1)) + (AX(AG((p104==0))) * EX((((AX((((p134==0)||(p149==0))||(p191==0))) + EX((((p123==0)||(p149==0))||(p183==0)))) + ((p9==0)...195
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(!(E(TRUE U !((p120==1))))))),TRUE) * !((p104==0)))] = FALSE * [((Init * !(!(E(TRUE U !((p12...325
Reverse transition relation is NOT exact ! Due to transitions t10, t15, t18, t26, t70, t71, t81, t92, t93, t96, t99, t129, t130, t131, t138, t139, t140, t1...277
(forward)formula 0,0,2.85688,68896,1,0,285,329335,386,165,5169,256248,384
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 143 transition count 239
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 143 transition count 239
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 82 place count 127 transition count 182
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 100 place count 125 transition count 182
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 119 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 119 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 116 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 116 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 114 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 114 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 112 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 112 transition count 147
Applied a total of 126 rules in 14 ms. Remains 112 /176 variables (removed 64) and now considering 147/290 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18214740936245988308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10350466740635502306.kers'
[2026-05-31 20:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18214740936245988308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10350466740635502306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 112 cols 412 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-31 20:56:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10350466740635502306.kers
Total runtime 1 ms.
[2026-05-31 20:56:08] [INFO ] Implicit Places using invariants in 65 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/176 places, 147/290 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 111/176 places, 147/290 transitions.
[2026-05-31 20:56:08] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:56:08] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:56:08] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-31 20:56:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:08] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1294417597644276940.gal : 5 ms
[2026-05-31 20:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6689813207195148682.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/CTLFireability1294417597644276940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6689813207195148682.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,2.09928e+08,0.085322,5524,2,674,5,6303,6,0,593,6553,0


Converting to forward existential form...Done !
original formula: AF(AG((EX((((p115==0)||(p168==0))||(p183==0))) * AG((p36==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EX((((p115==0)||(p168==0))||(p183==0))) * !(E(TRUE U !((p36==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t66, t69, t76, t85, t87, t88, t89, t90, t92, t93, t95, t111, t112, t113, ...267
(forward)formula 0,0,6.36732,168628,1,0,532,757689,323,335,3694,1.1688e+06,572
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 144 transition count 240
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 144 transition count 240
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 128 transition count 183
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 126 transition count 183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 120 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 120 transition count 162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 115 place count 115 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 120 place count 115 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 123 place count 112 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 126 place count 112 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 110 transition count 142
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 110 transition count 142
Applied a total of 130 rules in 12 ms. Remains 110 /176 variables (removed 66) and now considering 142/290 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18105403242599051915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10811721493018171198.kers'
[2026-05-31 20:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18105403242599051915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10811721493018171198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 110 cols 386 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-31 20:56:14] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10811721493018171198.kers
Total runtime 1 ms.
[2026-05-31 20:56:15] [INFO ] Implicit Places using invariants in 78 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/176 places, 142/290 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 109/176 places, 142/290 transitions.
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:15] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:56:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8440357805997499264.gal : 2 ms
[2026-05-31 20:56:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12509378513846428548.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/CTLFireability8440357805997499264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12509378513846428548.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11207e+08,0.095297,5796,2,723,5,7347,6,0,580,8518,0


Converting to forward existential form...Done !
original formula: AG(AX((p61==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p61==0)))] = FALSE
(forward)formula 0,0,0.115477,6060,1,0,9,7347,9,2,951,8518,2
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-06 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 : 176/176 places, 290/290 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 145 transition count 241
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 145 transition count 241
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 133 transition count 210
Ensure Unique test removed 2 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 131 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 126 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 126 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 123 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 123 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 120 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 120 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 119 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 119 transition count 164
Applied a total of 112 rules in 9 ms. Remains 119 /176 variables (removed 57) and now considering 164/290 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11466643880758306935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13517665889319087925.kers'
[2026-05-31 20:56:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11466643880758306935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13517665889319087925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 119 cols 514 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-31 20:56:15] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13517665889319087925.kers
Total runtime 1 ms.
[2026-05-31 20:56:15] [INFO ] Implicit Places using invariants in 95 ms returned [23]
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 : 118/176 places, 164/290 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 118/176 places, 164/290 transitions.
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:56:15] [INFO ] Input system was already deterministic with 164 transitions.
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:15] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:56:15] [INFO ] Time to serialize gal into /tmp/CTLFireability7613897803042901989.gal : 3 ms
[2026-05-31 20:56:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10572833221697968760.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/CTLFireability7613897803042901989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10572833221697968760.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.01875e+08,0.330855,13280,2,5079,5,43912,6,0,638,33693,0


Converting to forward existential form...Done !
original formula: !(E((!(((((p21==1)&&(p40==1))&&((p52==1)&&(p99==1)))&&(p195==1))) * ((!(EG((p144==1))) + AF((p76==1))) + (AX((p124==1)) + !(AG((p81==1)))...171
=> equivalent forward existential formula: [(FwdU(Init,(!(((((p21==1)&&(p40==1))&&((p52==1)&&(p99==1)))&&(p195==1))) * ((!(EG((p144==1))) + !(EG(!((p76==1)...237
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t36, t45, t68, t71, t78, t81, t85, t88, t91, t92, t94, t96, t98, t100, t101, t...374
(forward)formula 0,0,15.4562,376432,1,0,577,1.69102e+06,372,363,4275,2.35859e+06,714
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-07 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 : 176/176 places, 290/290 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 151 transition count 257
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 151 transition count 257
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 62 place count 139 transition count 220
Iterating global reduction 0 with 12 rules applied. Total rules applied 74 place count 139 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 135 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 135 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 133 transition count 187
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 133 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 132 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 132 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 131 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 131 transition count 185
Applied a total of 90 rules in 7 ms. Remains 131 /176 variables (removed 45) and now considering 185/290 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-554962743421383693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11480834680652734287.kers'
[2026-05-31 20:56:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-554962743421383693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11480834680652734287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 672 entries
Finished phase 1 with 117 SingleSign rule and 2 generalized
[2026-05-31 20:56:31] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11480834680652734287.kers
Total runtime 2 ms.
[2026-05-31 20:56:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-31 20:56:31] [INFO ] Invariant cache hit.
[2026-05-31 20:56:31] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-31 20:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/316 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 145 constraints, problems are : Problem set: 0 solved, 184 unsolved in 12496 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/316 variables, 131/145 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 184/329 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 340 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42557ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 42559ms
Starting structural reductions in LTL mode, iteration 1 : 131/176 places, 185/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42914 ms. Remains : 131/176 places, 185/290 transitions.
[2026-05-31 20:57:13] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:57:13] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:57:14] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-31 20:57:14] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:57:14] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability17384683849026955177.gal : 4 ms
[2026-05-31 20:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6972820013919766044.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17384683849026955177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6972820013919766044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.00595e+08,0.854928,22984,2,6390,5,83362,6,0,711,74928,0


Converting to forward existential form...Done !
original formula: AG(((AX(((p55==1) + EF((((p9==1)&&(p28==1))&&((p51==1)&&(p105==1)))))) + EG(EX((p209==1)))) + (EF(AG(AX((((p123==1)&&(p149==1))&&(p183==1...317
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((!(EX(!(((p55==1) + E(TRUE U (((p9==1)&&(p28==1))&&((p51==1)&&(p105==1)))))))) + EG(EX((...604
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t15, t18, t26, t30, t36, t52, t57, t72, t75, t77, t83, t86, t90, t92, t93, t96, t97...352
Detected timeout of ITS tools.
[2026-05-31 20:57:44] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:57:44] [INFO ] Applying decomposition
[2026-05-31 20:57:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2640142632234724010.txt' '-o' '/tmp/graph2640142632234724010.bin' '-w' '/tmp/graph2640142632234724010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2640142632234724010.bin' '-l' '-1' '-v' '-w' '/tmp/graph2640142632234724010.weights' '-q' '0' '-e' '0.001'
[2026-05-31 20:57:44] [INFO ] Decomposing Gal with order
[2026-05-31 20:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 20:57:44] [INFO ] Removed a total of 227 redundant transitions.
[2026-05-31 20:57:44] [INFO ] Flatten gal took : 94 ms
[2026-05-31 20:57:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 14 ms.
[2026-05-31 20:57:44] [INFO ] Time to serialize gal into /tmp/CTLFireability680369368064413386.gal : 7 ms
[2026-05-31 20:57:44] [INFO ] Time to serialize properties into /tmp/CTLFireability30698234081442304.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/CTLFireability680369368064413386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability30698234081442304.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...259
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.00595e+08,0.145027,6968,342,92,5474,565,515,9123,107,1321,0


Converting to forward existential form...Done !
original formula: AG(((AX(((i1.i1.u10.p55==1) + EF((((i1.i2.u17.p9==1)&&(i1.i2.u17.p28==1))&&((i1.i2.u17.p51==1)&&(i1.i2.u18.p105==1)))))) + EG(EX((i8.i1.u...492
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((!(EX(!(((i1.i1.u10.p55==1) + E(TRUE U (((i1.i2.u17.p9==1)&&(i1.i2.u17.p28==1))&&((i1.i2...859
Reverse transition relation is NOT exact ! Due to transitions t30, t57, t72, t92, t97, i1.t146, i1.t145, i1.i0.t135, i1.i0.u5.t101, i1.i0.u6.t134, i1.i0.u7...463
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,2.00521,60520,1,0,102381,1708,3578,265802,574,4895,195917
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 151 transition count 257
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 151 transition count 257
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 141 transition count 239
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 141 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 140 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 140 transition count 238
Applied a total of 72 rules in 5 ms. Remains 140 /176 variables (removed 36) and now considering 238/290 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8538080318278445479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11341673945294843473.kers'
[2026-05-31 20:57:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8538080318278445479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11341673945294843473.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 140 cols 1118 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-31 20:57:46] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11341673945294843473.kers
Total runtime 3 ms.
[2026-05-31 20:57:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-31 20:57:46] [INFO ] Invariant cache hit.
[2026-05-31 20:57:46] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2026-05-31 20:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 238/378 variables, 140/153 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 153 constraints, problems are : Problem set: 0 solved, 237 unsolved in 21850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 238/378 variables, 140/153 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 237/390 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 395 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51948ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 51949ms
Starting structural reductions in LTL mode, iteration 1 : 140/176 places, 238/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52267 ms. Remains : 140/176 places, 238/290 transitions.
[2026-05-31 20:58:38] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:58:38] [INFO ] Flatten gal took : 11 ms
[2026-05-31 20:58:38] [INFO ] Input system was already deterministic with 238 transitions.
[2026-05-31 20:58:38] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:58:38] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:58:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6836416096184075260.gal : 2 ms
[2026-05-31 20:58:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11689265442958640670.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/CTLFireability6836416096184075260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11689265442958640670.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.92129e+09,1.04879,30280,2,8398,5,110224,6,0,800,94504,0


Converting to forward existential form...Done !
original formula: EF((((AG(((((p21==1)&&(p40==1))&&((p52==1)&&(p99==1)))&&(p206==1))) + EG(AF(((((p21==1)&&(p29==1))&&((p52==1)&&(p99==1)))&&(p195==1))))) ...752
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,TRUE) * ((!(E(TRUE U !(((((p21==1)&&(p40==1))&&((p52==1)&&(p99==1)))&&(p206==1))))) + EG(!(...3150
Reverse transition relation is NOT exact ! Due to transitions t10, t15, t18, t21, t28, t31, t42, t55, t60, t75, t76, t79, t81, t85, t87, t93, t95, t99, t10...582
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 236/0/2
(forward)formula 0,1,7.24653,163272,1,0,553,798537,538,267,7151,677477,675
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 146 transition count 242
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 146 transition count 242
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 135 transition count 229
Ensure Unique test removed 2 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 133 transition count 229
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 129 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 126 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 126 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 123 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 123 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 121 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 121 transition count 184
Applied a total of 108 rules in 11 ms. Remains 121 /176 variables (removed 55) and now considering 184/290 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9566017517588864747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9206754099201524974.kers'
[2026-05-31 20:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9566017517588864747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9206754099201524974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 121 cols 674 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-05-31 20:58:46] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9206754099201524974.kers
Total runtime 2 ms.
[2026-05-31 20:58:46] [INFO ] Implicit Places using invariants in 81 ms returned [24]
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 : 120/176 places, 184/290 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 120/176 places, 184/290 transitions.
[2026-05-31 20:58:46] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:58:46] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:58:46] [INFO ] Input system was already deterministic with 184 transitions.
[2026-05-31 20:58:46] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:58:46] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:58:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14756480574761417052.gal : 3 ms
[2026-05-31 20:58:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17754282797635373748.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/CTLFireability14756480574761417052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17754282797635373748.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,9.966e+08,0.535201,14344,2,5400,5,46003,6,0,666,37105,0


Converting to forward existential form...Done !
original formula: A(((p5==1) * AG((((AX(((p101==1)||(p53==1))) * (p21==1)) * ((p40==1)&&(p52==1))) * ((p99==1)&&(p195==1))))) U (EF((AX(E((p209==1) U (p99=...287
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (!(EX(!(E((p209==1) U (p99==1))))) * (p89==1))) * E(TRUE U (E(TRUE U (p164==1)) + !((...1199
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t22, t26, t67, t68, t71, t78, t84, t88, t91, t92, t94, t96, t100, t101, t102, ...483
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,25.9899,604120,1,0,523,4.03955e+06,420,263,4883,2.81889e+06,701
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Graph (trivial) has 156 edges and 176 vertex of which 10 / 176 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 169 transition count 231
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 66 rules applied. Total rules applied 118 place count 118 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 112 transition count 216
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 124 place count 112 transition count 205
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 146 place count 101 transition count 205
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 165 place count 82 transition count 168
Ensure Unique test removed 1 places
Iterating global reduction 3 with 20 rules applied. Total rules applied 185 place count 81 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 185 place count 81 transition count 165
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 78 transition count 165
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 199 place count 70 transition count 119
Ensure Unique test removed 2 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 209 place count 68 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 211 place count 66 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 66 transition count 99
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 249 place count 48 transition count 81
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 251 place count 46 transition count 78
Iterating global reduction 3 with 2 rules applied. Total rules applied 253 place count 46 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 259 place count 46 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 265 place count 43 transition count 69
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 268 place count 43 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 42 transition count 68
Applied a total of 269 rules in 22 ms. Remains 42 /176 variables (removed 134) and now considering 68/290 (removed 222) transitions.
[2026-05-31 20:59:12] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16679055246135145756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2056253820030014492.kers'
[2026-05-31 20:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16679055246135145756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2056253820030014492.kers]
Normalized transition count is 60 out of 61 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 60 rows 42 cols 290 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-31 20:59:12] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2056253820030014492.kers
Total runtime 0 ms.
[2026-05-31 20:59:12] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-31 20:59:12] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2026-05-31 20:59:12] [INFO ] Invariant cache hit.
[2026-05-31 20:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 20:59:12] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-31 20:59:12] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-31 20:59:12] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2026-05-31 20:59:12] [INFO ] Invariant cache hit.
[2026-05-31 20:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 60/102 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 52 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 4/42 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 60/102 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 58/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 110 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5718ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/176 places, 68/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5896 ms. Remains : 42/176 places, 68/290 transitions.
[2026-05-31 20:59:18] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:59:18] [INFO ] Flatten gal took : 4 ms
[2026-05-31 20:59:18] [INFO ] Input system was already deterministic with 68 transitions.
[2026-05-31 20:59:18] [INFO ] Flatten gal took : 20 ms
[2026-05-31 20:59:18] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:59:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18305191156258556744.gal : 5 ms
[2026-05-31 20:59:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4612265652335598897.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18305191156258556744.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4612265652335598897.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4612265652335598897.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 40
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :40 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 144
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :144 after 200
Reachability property ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-14 is true.
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12840,0.062104,4620,2,273,11,2014,6,0,235,1235,0
Total reachable state count : 12840

Verifying 1 reachability properties.
Reachability property ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-14,2,0.063755,4792,2,46,11,2014,7,0,250,1235,0
RANDOM walk for 40000 steps (8 resets) in 690 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 527394 steps, run visited all 1 properties in 922 ms. (steps per millisecond=572 )
Probabilistic random walk after 527394 steps, saw 100228 distinct states, run finished after 930 ms. (steps per millisecond=567 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 290/290 transitions.
Graph (trivial) has 154 edges and 176 vertex of which 10 / 176 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 169 transition count 232
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 65 rules applied. Total rules applied 116 place count 119 transition count 217
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 123 place count 113 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 112 transition count 216
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 124 place count 112 transition count 205
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 146 place count 101 transition count 205
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 164 place count 83 transition count 169
Ensure Unique test removed 1 places
Iterating global reduction 4 with 19 rules applied. Total rules applied 183 place count 82 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 183 place count 82 transition count 166
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 189 place count 79 transition count 166
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 199 place count 69 transition count 96
Ensure Unique test removed 2 places
Iterating global reduction 4 with 12 rules applied. Total rules applied 211 place count 67 transition count 96
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 214 place count 64 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 217 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 63 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 63 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 251 place count 47 transition count 68
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 44 transition count 63
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 44 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 44 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 267 place count 42 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 268 place count 41 transition count 54
Applied a total of 268 rules in 26 ms. Remains 41 /176 variables (removed 135) and now considering 54/290 (removed 236) transitions.
[2026-05-31 20:59:19] [INFO ] Flow matrix only has 50 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-1072504135686718045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14010514867328952765.kers'
[2026-05-31 20:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1072504135686718045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14010514867328952765.kers]
Normalized transition count is 49 out of 50 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 49 rows 41 cols 157 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-31 20:59:19] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14010514867328952765.kers
Total runtime 1 ms.
[2026-05-31 20:59:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-31 20:59:19] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
[2026-05-31 20:59:19] [INFO ] Invariant cache hit.
[2026-05-31 20:59:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-31 20:59:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-05-31 20:59:19] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2026-05-31 20:59:19] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
[2026-05-31 20:59:19] [INFO ] Invariant cache hit.
[2026-05-31 20:59:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 49/90 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 52 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 5/41 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 49/90 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 45/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 97 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4274ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 4274ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/176 places, 54/290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4477 ms. Remains : 41/176 places, 54/290 transitions.
[2026-05-31 20:59:24] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:59:24] [INFO ] Input system was already deterministic with 54 transitions.
[2026-05-31 20:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:59:24] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:59:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17216742644916758757.gal : 1 ms
[2026-05-31 20:59:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16329361930418374687.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/CTLFireability17216742644916758757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16329361930418374687.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,280368,0.020775,4192,2,105,5,997,6,0,215,823,0


Converting to forward existential form...Done !
original formula: EG((E((p62!=1) U (p78==1)) * EG((((p25==0)||(p69==0))||(p99==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E((p62!=1) U (p78==1)) * EG((((p25==0)||(p69==0))||(p99==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t13, t27, t40, t46, Intersection with reachable at each step enabled. (destroyed/re...188
(forward)formula 0,1,1.14443,30740,1,0,283,146123,135,159,1407,212016,312
FORMULA ErlangenMainframeV1-PT-bP03C03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-31 20:59:25] [INFO ] Flatten gal took : 18 ms
[2026-05-31 20:59:25] [INFO ] Flatten gal took : 18 ms
Total runtime 327875 ms.

BK_STOP 1780261165578

--------------------
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-bP03C03"
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-bP03C03, 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-178021499100066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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