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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 27 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K 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 93K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:32 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 200K 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-bP04C04-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780261387771

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-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-31 21:03:10] [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 21:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:03:10] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2026-05-31 21:03:10] [INFO ] Transformed 233 places.
[2026-05-31 21:03:10] [INFO ] Transformed 507 transitions.
[2026-05-31 21:03:10] [INFO ] Found NUPN structural information;
[2026-05-31 21:03:10] [INFO ] Parsed PT model containing 233 places and 507 transitions and 3455 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 66 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 507/507 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 191 transition count 465
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 191 transition count 465
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 103 place count 172 transition count 446
Iterating global reduction 0 with 19 rules applied. Total rules applied 122 place count 172 transition count 446
Applied a total of 122 rules in 109 ms. Remains 172 /233 variables (removed 61) and now considering 446/507 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14964047895107908081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6477227648825775021.kers'
[2026-05-31 21:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14964047895107908081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6477227648825775021.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 446 rows 172 cols 3333 entries
Finished phase 1 with 155 SingleSign rule and 3 generalized
[2026-05-31 21:03:11] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6477227648825775021.kers
Total runtime 7 ms.
[2026-05-31 21:03:11] [INFO ] Implicit Places using invariants in 474 ms returned []
[2026-05-31 21:03:11] [INFO ] Invariant cache hit.
[2026-05-31 21:03:12] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2026-05-31 21:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 446/618 variables, 172/190 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/618 variables, and 191 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/172 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 446/618 variables, 172/191 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 445/636 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 647 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61344ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61379ms
Starting structural reductions in LTL mode, iteration 1 : 172/233 places, 446/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62580 ms. Remains : 172/233 places, 446/507 transitions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 172 /172 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2026-05-31 21:04:13] [INFO ] Invariant cache hit.
[2026-05-31 21:04:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-31 21:04:13] [INFO ] Invariant cache hit.
[2026-05-31 21:04:14] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 172/172 places, 446/446 transitions.
Support contains 66 out of 172 places after structural reductions.
[2026-05-31 21:04:14] [INFO ] Flatten gal took : 195 ms
[2026-05-31 21:04:14] [INFO ] Flatten gal took : 117 ms
[2026-05-31 21:04:15] [INFO ] Input system was already deterministic with 446 transitions.
RANDOM walk for 40000 steps (8 resets) in 3534 ms. (11 steps per ms) remains 39/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
[2026-05-31 21:04:16] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/127 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 27/154 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 18/172 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 446/618 variables, 172/186 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/618 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 186 constraints, problems are : Problem set: 1 solved, 37 unsolved in 2581 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 38/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 93/127 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 27/154 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 18/172 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 446/618 variables, 172/186 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 35/221 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 224 constraints, problems are : Problem set: 1 solved, 37 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 37/36 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7840ms problems are : Problem set: 1 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 129 edges and 172 vertex of which 9 / 172 are part of one of the 4 SCC in 13 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 167 transition count 396
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 53 rules applied. Total rules applied 94 place count 127 transition count 383
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 121 transition count 383
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 100 place count 121 transition count 373
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 120 place count 111 transition count 373
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 132 place count 99 transition count 361
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 99 transition count 361
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 147 place count 99 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 98 transition count 358
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 148 place count 98 transition count 355
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 154 place count 95 transition count 355
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 93 transition count 340
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 93 transition count 340
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 5 with 32 rules applied. Total rules applied 190 place count 77 transition count 324
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 76 transition count 320
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 76 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
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 204 place count 70 transition count 358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 214 place count 70 transition count 348
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 69 transition count 346
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 69 transition count 346
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 225 place count 69 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 69 transition count 335
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 232 place count 69 transition count 330
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 237 place count 64 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 238 place count 64 transition count 329
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 239 place count 64 transition count 339
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 240 place count 63 transition count 339
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 241 place count 63 transition count 339
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 243 place count 63 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 245 place count 63 transition count 337
Applied a total of 245 rules in 376 ms. Remains 63 /172 variables (removed 109) and now considering 337/446 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 63/172 places, 337/446 transitions.
RANDOM walk for 40000 steps (8 resets) in 1836 ms. (21 steps per ms) remains 29/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
[2026-05-31 21:04:25] [INFO ] Flow matrix only has 336 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6471942900278276585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13969191651495591225.kers'
[2026-05-31 21:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6471942900278276585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13969191651495591225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 63 cols 3145 entries
Finished phase 1 with 46 SingleSign rule and 3 generalized
[2026-05-31 21:04:25] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13969191651495591225.kers
Total runtime 5 ms.
[2026-05-31 21:04:25] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 17/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 9/63 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 336/399 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 99 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 26/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 17/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 9/63 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 336/399 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 25/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 124 constraints, problems are : Problem set: 0 solved, 26 unsolved in 6710 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 26/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8335ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 6 properties in 1645 ms.
Support contains 27 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 337/337 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 63 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 62 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 61 transition count 335
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 2 with 2 rules applied. Total rules applied 6 place count 60 transition count 334
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 59 transition count 333
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 59 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 59 transition count 331
Applied a total of 12 rules in 47 ms. Remains 59 /63 variables (removed 4) and now considering 331/337 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 59/63 places, 331/337 transitions.
RANDOM walk for 40000 steps (8 resets) in 484 ms. (82 steps per ms) remains 16/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
[2026-05-31 21:04:35] [INFO ] Flow matrix only has 324 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-14839049613400008311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18103740943440570484.kers'
[2026-05-31 21:04:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14839049613400008311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18103740943440570484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 59 cols 3077 entries
Finished phase 1 with 42 SingleSign rule and 3 generalized
[2026-05-31 21:04:35] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18103740943440570484.kers
Total runtime 4 ms.
[2026-05-31 21:04:35] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 16/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 7/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/59 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 324/383 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 103 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 16/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 7/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/59 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 324/383 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 119 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4177 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5274ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 12 properties in 5767 ms.
Support contains 10 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 331/331 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 330
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 58 transition count 330
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 50 transition count 250
Ensure Unique test removed 4 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 46 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 44 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 44 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 42 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 41 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 41 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 41 transition count 139
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 40 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 40 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 40 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 38 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 38 transition count 131
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 38 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 37 transition count 130
Applied a total of 46 rules in 27 ms. Remains 37 /59 variables (removed 22) and now considering 130/331 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 37/59 places, 130/331 transitions.
RANDOM walk for 40000 steps (8 resets) in 1398 ms. (28 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
[2026-05-31 21:04:47] [INFO ] Flow matrix only has 126 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-15252803067717625501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6225877791939892032.kers'
[2026-05-31 21:04:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15252803067717625501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6225877791939892032.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 37 cols 1029 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 21:04:47] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6225877791939892032.kers
Total runtime 1 ms.
[2026-05-31 21:04:47] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 126/163 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 45/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 92 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 126/163 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 45/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 37/37 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 199 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=99 )
Parikh walk visited 3 properties in 70 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 55 ms
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 49 ms
[2026-05-31 21:04:48] [INFO ] Input system was already deterministic with 446 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 149 transition count 352
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 148 transition count 352
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 58 place count 137 transition count 244
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 136 transition count 244
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 130 transition count 214
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 83 place count 129 transition count 214
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 88 place count 124 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 93 place count 124 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 122 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 122 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 99 place count 120 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 101 place count 120 transition count 181
Applied a total of 101 rules in 23 ms. Remains 120 /172 variables (removed 52) and now considering 181/446 (removed 265) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15385944006269163467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12951784417975895798.kers'
[2026-05-31 21:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15385944006269163467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12951784417975895798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 120 cols 688 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-31 21:04:48] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12951784417975895798.kers
Total runtime 5 ms.
[2026-05-31 21:04:48] [INFO ] Implicit Places using invariants in 108 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/172 places, 181/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 119/172 places, 181/446 transitions.
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 14 ms
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 13 ms
[2026-05-31 21:04:48] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 13 ms
[2026-05-31 21:04:48] [INFO ] Flatten gal took : 13 ms
[2026-05-31 21:04:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14688478664136722934.gal : 11 ms
[2026-05-31 21:04:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9667502200191209082.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14688478664136722934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9667502200191209082.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.00735e+09,0.957333,23348,2,7345,5,83437,6,0,659,60687,0


Converting to forward existential form...Done !
original formula: EX(EF((AG((p0==1)) * EG(((((p11==1)&&(p30==1))&&((p60==1)&&(p79==1)))&&((p119==1)&&(p226==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(EY(Init),TRUE) * !(E(TRUE U !((p0==1))))),((((p11==1)&&(p30==1))&&((p60==1)&&(p79==1)))&&((p119==1)&...178
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t69, t76, t82, t86, t88, t89, t91, t93, t94, t97, t100, t101, t102, ...465
(forward)formula 0,0,5.29875,110292,1,0,322,524607,393,157,4748,429552,399
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 144 edges and 172 vertex of which 9 / 172 are part of one of the 4 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 166 transition count 396
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 104 place count 123 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 115 transition count 379
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 112 place count 115 transition count 368
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 134 place count 104 transition count 368
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 150 place count 88 transition count 281
Ensure Unique test removed 2 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 86 transition count 281
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 168 place count 86 transition count 279
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 172 place count 84 transition count 279
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 178 place count 78 transition count 203
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 76 transition count 203
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 224 place count 57 transition count 184
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 227 place count 54 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 230 place count 54 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 54 transition count 173
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 3 with 2 rules applied. Total rules applied 236 place count 53 transition count 172
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 241 place count 53 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 52 transition count 171
Applied a total of 242 rules in 130 ms. Remains 52 /172 variables (removed 120) and now considering 171/446 (removed 275) transitions.
[2026-05-31 21:04:54] [INFO ] Flow matrix only has 164 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-11196925801369018332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16781781125802191539.kers'
[2026-05-31 21:04:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11196925801369018332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16781781125802191539.kers]
Normalized transition count is 163 out of 164 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 52 cols 1468 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-31 21:04:54] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-16781781125802191539.kers
Total runtime 17 ms.
[2026-05-31 21:04:54] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-31 21:04:54] [INFO ] Flow matrix only has 164 transitions (discarded 7 similar events)
[2026-05-31 21:04:54] [INFO ] Invariant cache hit.
[2026-05-31 21:04:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:04:54] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2026-05-31 21:04:54] [INFO ] Redundant transitions in 10 ms returned []
Running 160 sub problems to find dead transitions.
[2026-05-31 21:04:54] [INFO ] Flow matrix only has 164 transitions (discarded 7 similar events)
[2026-05-31 21:04:54] [INFO ] Invariant cache hit.
[2026-05-31 21:04:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 4/52 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 163/215 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 1/216 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 63 constraints, problems are : Problem set: 0 solved, 160 unsolved in 10334 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 4/52 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 163/215 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 160/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 223 constraints, problems are : Problem set: 0 solved, 160 unsolved in 27601 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38278ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 38279ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/172 places, 171/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38713 ms. Remains : 52/172 places, 171/446 transitions.
[2026-05-31 21:05:32] [INFO ] Flatten gal took : 17 ms
[2026-05-31 21:05:32] [INFO ] Flatten gal took : 11 ms
[2026-05-31 21:05:32] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-31 21:05:32] [INFO ] Flatten gal took : 10 ms
[2026-05-31 21:05:32] [INFO ] Flatten gal took : 11 ms
[2026-05-31 21:05:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2193803498136964141.gal : 9 ms
[2026-05-31 21:05:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14977333176087584125.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/CTLFireability2193803498136964141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14977333176087584125.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.46842e+06,0.110134,6728,2,321,5,4920,6,0,377,4197,0


Converting to forward existential form...Done !
original formula: A(!(((((p15==1)&&(p30==1))&&((p49==1)&&(p79==1)))&&((p119==1)&&(p215==1)))) U !(EF(((((p22==1)&&(p41==1))&&((p53==1)&&(p79==1)))&&((p119=...174
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U ((((p22==1)&&(p41==1))&&((p53==1)&&(p79==1)))&&((p119==1)&&(p226==1))))))))) * !(E(!...423
Reverse transition relation is NOT exact ! Due to transitions t43, t44, t55, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.43206,107044,1,0,376,526410,368,324,5438,530212,574
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-01 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 : 172/172 places, 446/446 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 150 transition count 353
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 149 transition count 353
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 60 place count 134 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 133 transition count 181
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 125 transition count 167
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 93 place count 124 transition count 167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 98 place count 119 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 103 place count 119 transition count 152
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 105 place count 117 transition count 150
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 117 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 109 place count 115 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 111 place count 115 transition count 148
Applied a total of 111 rules in 16 ms. Remains 115 /172 variables (removed 57) and now considering 148/446 (removed 298) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18346906981384664834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12621881296722382198.kers'
[2026-05-31 21:05:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18346906981384664834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12621881296722382198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 115 cols 412 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-31 21:05:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12621881296722382198.kers
Total runtime 1 ms.
[2026-05-31 21:05:37] [INFO ] Implicit Places using invariants in 94 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/172 places, 148/446 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 114/172 places, 148/446 transitions.
[2026-05-31 21:05:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:05:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:05:37] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-31 21:05:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:05:37] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:05:37] [INFO ] Time to serialize gal into /tmp/CTLFireability779465853383712201.gal : 2 ms
[2026-05-31 21:05:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2427065724938813415.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/CTLFireability779465853383712201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2427065724938813415.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EX(((p94==0)||(p218==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p94==0)||(p218==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t16, t19, t27, t67, t77, t86, t88, t90, t92, t93, t94, t96, t97, t99, t115, t116, t117, ...267
(forward)formula 0,1,0.313997,13592,1,0,224,52210,312,123,3560,42382,303
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-02 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 : 172/172 places, 446/446 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 150 transition count 353
Ensure Unique test removed 1 places
Iterating global reduction 0 with 23 rules applied. Total rules applied 45 place count 149 transition count 353
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 54 place count 140 transition count 335
Ensure Unique test removed 1 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 139 transition count 335
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 135 transition count 331
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 73 place count 134 transition count 331
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 76 place count 131 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 131 transition count 320
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 81 place count 129 transition count 318
Iterating global reduction 0 with 2 rules applied. Total rules applied 83 place count 129 transition count 318
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 127 transition count 316
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 127 transition count 316
Applied a total of 87 rules in 18 ms. Remains 127 /172 variables (removed 45) and now considering 316/446 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3714780153159328526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18190744695654477097.kers'
[2026-05-31 21:05:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3714780153159328526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18190744695654477097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 127 cols 1868 entries
Finished phase 1 with 115 SingleSign rule and 1 generalized
[2026-05-31 21:05:37] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18190744695654477097.kers
Total runtime 2 ms.
[2026-05-31 21:05:37] [INFO ] Implicit Places using invariants in 62 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/172 places, 316/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 126/172 places, 316/446 transitions.
[2026-05-31 21:05:38] [INFO ] Flatten gal took : 16 ms
[2026-05-31 21:05:38] [INFO ] Flatten gal took : 17 ms
[2026-05-31 21:05:38] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-31 21:05:38] [INFO ] Flatten gal took : 17 ms
[2026-05-31 21:05:38] [INFO ] Flatten gal took : 17 ms
[2026-05-31 21:05:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11362384783645478931.gal : 5 ms
[2026-05-31 21:05:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11052800230127204860.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/CTLFireability11362384783645478931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11052800230127204860.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.56062e+09,1.30506,40376,2,11748,5,143468,6,0,822,98282,0


Converting to forward existential form...Done !
original formula: AG(((AG((AX(((((p22==0)||(p34==0))||((p53==0)||(p72==0)))||((p119==0)||(p215==0)))) * AG(((((p15==1)&&(p30==1))&&((p60==1)&&(p68==1)))&&(...373
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(((((p15==1)&&(p41==1))&&((p49==1)&&(p79==1)))&&((p119==1)&&(p226==1)))) U ...645
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t67, t70, t77, t83, t89, t90, t94, t95, t99, t103, t104, t105, t106, t107...1248
(forward)formula 0,1,9.01065,201076,1,0,571,1.03861e+06,654,291,8453,800844,642
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 145 edges and 172 vertex of which 9 / 172 are part of one of the 4 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 166 transition count 398
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 56 rules applied. Total rules applied 98 place count 125 transition count 383
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 118 transition count 381
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 110 place count 116 transition count 380
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 110 place count 116 transition count 369
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 132 place count 105 transition count 369
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 148 place count 89 transition count 282
Ensure Unique test removed 2 places
Iterating global reduction 4 with 18 rules applied. Total rules applied 166 place count 87 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 166 place count 87 transition count 280
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 85 transition count 280
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 177 place count 78 transition count 168
Ensure Unique test removed 2 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 186 place count 76 transition count 168
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 73 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 73 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 72 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 72 transition count 124
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 4 with 38 rules applied. Total rules applied 232 place count 53 transition count 105
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 235 place count 50 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 238 place count 50 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 242 place count 50 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 48 transition count 92
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 48 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 47 transition count 91
Applied a total of 249 rules in 43 ms. Remains 47 /172 variables (removed 125) and now considering 91/446 (removed 355) transitions.
[2026-05-31 21:05:47] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8027687046392044432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13214312647615040739.kers'
[2026-05-31 21:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8027687046392044432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13214312647615040739.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 47 cols 548 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-31 21:05:47] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13214312647615040739.kers
Total runtime 1 ms.
[2026-05-31 21:05:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-31 21:05:47] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2026-05-31 21:05:47] [INFO ] Invariant cache hit.
[2026-05-31 21:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:05:47] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2026-05-31 21:05:47] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-31 21:05:47] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2026-05-31 21:05:47] [INFO ] Invariant cache hit.
[2026-05-31 21:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 85/132 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 58 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3785 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 4/47 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 85/132 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 79/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 137 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5931 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9767ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 9767ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/172 places, 91/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10329 ms. Remains : 47/172 places, 91/446 transitions.
[2026-05-31 21:05:57] [INFO ] Flatten gal took : 8 ms
[2026-05-31 21:05:57] [INFO ] Flatten gal took : 7 ms
[2026-05-31 21:05:57] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-31 21:05:57] [INFO ] Flatten gal took : 9 ms
[2026-05-31 21:05:57] [INFO ] Flatten gal took : 8 ms
[2026-05-31 21:05:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17379455181794437750.gal : 3 ms
[2026-05-31 21:05:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5239860041084196416.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/CTLFireability17379455181794437750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5239860041084196416.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.58451e+06,0.078208,4944,2,362,5,3104,6,0,277,2700,0


Converting to forward existential form...Done !
original formula: AF(!(E(EG(((((p15==1)&&(p30==1))&&((p60==1)&&(p68==1)))&&((p119==1)&&(p226==1)))) U EF((p206==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(EG(((((p15==1)&&(p30==1))&&((p60==1)&&(p68==1)))&&((p119==1)&&(p226==1)))) U E(TRUE U (p206==1)...169
Reverse transition relation is NOT exact ! Due to transitions t42, t43, t53, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,0,0.977639,21912,1,0,207,88264,213,148,2957,100377,308
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-04 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 : 172/172 places, 446/446 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 156 transition count 430
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 156 transition count 430
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 149 transition count 415
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 149 transition count 415
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 146 transition count 412
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 146 transition count 412
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 143 transition count 401
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 143 transition count 401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 141 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 141 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 139 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 139 transition count 397
Applied a total of 66 rules in 22 ms. Remains 139 /172 variables (removed 33) and now considering 397/446 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7823322634192425058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7744074592028983113.kers'
[2026-05-31 21:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7823322634192425058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7744074592028983113.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 139 cols 3159 entries
Finished phase 1 with 122 SingleSign rule and 3 generalized
[2026-05-31 21:05:58] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7744074592028983113.kers
Total runtime 3 ms.
[2026-05-31 21:05:58] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-31 21:05:58] [INFO ] Invariant cache hit.
[2026-05-31 21:05:59] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2026-05-31 21:05:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/536 variables, 139/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/536 variables, and 155 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/536 variables, 139/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 396/551 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/536 variables, and 554 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60919ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Starting structural reductions in LTL mode, iteration 1 : 139/172 places, 397/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61403 ms. Remains : 139/172 places, 397/446 transitions.
[2026-05-31 21:07:00] [INFO ] Flatten gal took : 23 ms
[2026-05-31 21:07:00] [INFO ] Flatten gal took : 25 ms
[2026-05-31 21:07:00] [INFO ] Input system was already deterministic with 397 transitions.
[2026-05-31 21:07:00] [INFO ] Flatten gal took : 24 ms
[2026-05-31 21:07:00] [INFO ] Flatten gal took : 24 ms
[2026-05-31 21:07:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15321979077369890944.gal : 6 ms
[2026-05-31 21:07:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1373006060551038000.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/CTLFireability15321979077369890944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1373006060551038000.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.48032e+09,1.21852,28016,2,7682,5,76444,6,0,955,82769,0


Converting to forward existential form...Done !
original formula: (E(A(EF(((((p11==1)&&(p34==1))&&((p49==1)&&(p72==1)))&&((p119==1)&&(p226==1)))) U ((((p15==1)&&(p41==1))&&((p49==1)&&(p68==1)))&&((p119==...613
=> equivalent forward existential formula: ([FwdG((Init * E(!((E(!(((((p15==1)&&(p41==1))&&((p49==1)&&(p68==1)))&&((p119==1)&&(p215==1)))) U (!(E(TRUE U ((...1837
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t27, t67, t70, t77, t83, t89, t90, t93, t95, t96, t100, t104, t281, t282, t283...762
Detected timeout of ITS tools.
[2026-05-31 21:07:30] [INFO ] Flatten gal took : 33 ms
[2026-05-31 21:07:30] [INFO ] Applying decomposition
[2026-05-31 21:07:30] [INFO ] Flatten gal took : 32 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/graph17751999876826925840.txt' '-o' '/tmp/graph17751999876826925840.bin' '-w' '/tmp/graph17751999876826925840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17751999876826925840.bin' '-l' '-1' '-v' '-w' '/tmp/graph17751999876826925840.weights' '-q' '0' '-e' '0.001'
[2026-05-31 21:07:30] [INFO ] Decomposing Gal with order
[2026-05-31 21:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 21:07:30] [INFO ] Removed a total of 78 redundant transitions.
[2026-05-31 21:07:31] [INFO ] Flatten gal took : 175 ms
[2026-05-31 21:07:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2026-05-31 21:07:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15478697706452401014.gal : 15 ms
[2026-05-31 21:07:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16586640668291323999.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15478697706452401014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16586640668291323999.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 154 transition count 385
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 154 transition count 385
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 146 transition count 369
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 146 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 143 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 143 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 141 transition count 356
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 141 transition count 356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 139 transition count 354
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 139 transition count 354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 137 transition count 352
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 137 transition count 352
Applied a total of 70 rules in 23 ms. Remains 137 /172 variables (removed 35) and now considering 352/446 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15344716905601107197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13735003653732499428.kers'
[2026-05-31 21:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15344716905601107197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13735003653732499428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 352 rows 137 cols 2709 entries
Finished phase 1 with 120 SingleSign rule and 3 generalized
[2026-05-31 21:08:01] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13735003653732499428.kers
Total runtime 5 ms.
[2026-05-31 21:08:01] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-31 21:08:01] [INFO ] Invariant cache hit.
[2026-05-31 21:08:01] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2026-05-31 21:08:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 352/489 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/489 variables, and 153 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 352/489 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 351/504 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 5/509 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 509 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60730ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 60733ms
Starting structural reductions in LTL mode, iteration 1 : 137/172 places, 352/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61265 ms. Remains : 137/172 places, 352/446 transitions.
[2026-05-31 21:09:02] [INFO ] Flatten gal took : 17 ms
[2026-05-31 21:09:02] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:09:02] [INFO ] Input system was already deterministic with 352 transitions.
[2026-05-31 21:09:02] [INFO ] Flatten gal took : 16 ms
[2026-05-31 21:09:02] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:09:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7875572199733860183.gal : 5 ms
[2026-05-31 21:09:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1539129823738465161.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/CTLFireability7875572199733860183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1539129823738465161.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.14584e+09,1.28544,28064,2,9463,5,82516,6,0,902,71191,0


Converting to forward existential form...Done !
original formula: EF((AX(EX((((AF((p148==1)) * (p21==1)) * ((p40==1)&&(p48==1))) * ((p78==1)&&(p125==1))))) * AG((AX(((((p22==0)||(p30==0))||((p60==0)||(p7...358
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(EX((((!(EG(!((p148==1)))) * (p21==1)) * ((p40==1)&&(p48==1))) * ((p78==1)&&(p125==1)...1193
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t69, t71, t75, t77, t83, t85, t89, t90, t94, t95, t99, t103, t105, t...765
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.207,198020,1,0,736,893499,754,394,11948,684131,930
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 157 transition count 431
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 157 transition count 431
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 150 transition count 390
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 150 transition count 390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 148 transition count 388
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 148 transition count 388
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 146 transition count 381
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 146 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 145 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 145 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 144 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 144 transition count 379
Applied a total of 56 rules in 16 ms. Remains 144 /172 variables (removed 28) and now considering 379/446 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9628741661582970946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3363219737912326465.kers'
[2026-05-31 21:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9628741661582970946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3363219737912326465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 144 cols 2923 entries
Finished phase 1 with 127 SingleSign rule and 3 generalized
[2026-05-31 21:09:12] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3363219737912326465.kers
Total runtime 6 ms.
[2026-05-31 21:09:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-31 21:09:13] [INFO ] Invariant cache hit.
[2026-05-31 21:09:13] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-31 21:09:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/523 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 159 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/523 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 378/537 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 541 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60758ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60761ms
Starting structural reductions in LTL mode, iteration 1 : 144/172 places, 379/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61193 ms. Remains : 144/172 places, 379/446 transitions.
[2026-05-31 21:10:14] [INFO ] Flatten gal took : 35 ms
[2026-05-31 21:10:14] [INFO ] Flatten gal took : 38 ms
[2026-05-31 21:10:14] [INFO ] Input system was already deterministic with 379 transitions.
[2026-05-31 21:10:14] [INFO ] Flatten gal took : 24 ms
[2026-05-31 21:10:14] [INFO ] Flatten gal took : 50 ms
[2026-05-31 21:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4698157267248698794.gal : 7 ms
[2026-05-31 21:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9630691153150170876.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/CTLFireability4698157267248698794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9630691153150170876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.85359e+09,2.21772,51536,2,14138,5,189655,6,0,957,128578,0


Converting to forward existential form...Done !
original formula: EF((((((p22==0)||(p30==0))||((p49==0)||(p72==0)))||((p119==0)||(p226==0))) * (((((p10==1)&&(p33==1))&&((p59==1)&&(p71==1)))&&(p125==1)) +...251
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((((p22==0)||(p30==0))||((p49==0)||(p72==0)))||((p119==0)||(p226==0)))) * ((((p10==1)&&(p3...415
(forward)formula 0,1,2.24059,51536,1,0,8,189655,9,2,989,128578,2
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 138 edges and 172 vertex of which 7 / 172 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 167 transition count 401
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 96 place count 128 transition count 384
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 106 place count 120 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 118 transition count 382
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 108 place count 118 transition count 371
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 130 place count 107 transition count 371
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 141 place count 96 transition count 334
Iterating global reduction 4 with 11 rules applied. Total rules applied 152 place count 96 transition count 334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 152 place count 96 transition count 333
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 95 transition count 333
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 158 place count 91 transition count 260
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 91 transition count 260
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 196 place count 74 transition count 243
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 72 transition count 237
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 72 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 72 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 71 transition count 232
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 71 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 70 transition count 231
Applied a total of 211 rules in 59 ms. Remains 70 /172 variables (removed 102) and now considering 231/446 (removed 215) transitions.
[2026-05-31 21:10:16] [INFO ] Flow matrix only has 226 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12700616912687749041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6922031395734321579.kers'
[2026-05-31 21:10:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12700616912687749041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6922031395734321579.kers]
Normalized transition count is 225 out of 226 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 70 cols 2030 entries
Finished phase 1 with 53 SingleSign rule and 3 generalized
[2026-05-31 21:10:16] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6922031395734321579.kers
Total runtime 3 ms.
[2026-05-31 21:10:16] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-31 21:10:16] [INFO ] Flow matrix only has 226 transitions (discarded 5 similar events)
[2026-05-31 21:10:16] [INFO ] Invariant cache hit.
[2026-05-31 21:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:10:16] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2026-05-31 21:10:17] [INFO ] Redundant transitions in 31 ms returned []
Running 221 sub problems to find dead transitions.
[2026-05-31 21:10:17] [INFO ] Flow matrix only has 226 transitions (discarded 5 similar events)
[2026-05-31 21:10:17] [INFO ] Invariant cache hit.
[2026-05-31 21:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 4/70 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 225/295 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/296 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 85 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20386 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 4/70 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 225/295 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 221/305 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/296 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 306 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50775ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 50776ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/172 places, 231/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51212 ms. Remains : 70/172 places, 231/446 transitions.
[2026-05-31 21:11:07] [INFO ] Flatten gal took : 16 ms
[2026-05-31 21:11:07] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:11:07] [INFO ] Input system was already deterministic with 231 transitions.
[2026-05-31 21:11:07] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:11:07] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:11:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16148684904010119483.gal : 4 ms
[2026-05-31 21:11:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16518488549995438846.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/CTLFireability16148684904010119483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16518488549995438846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65298e+07,0.344346,8932,2,1398,5,15248,6,0,510,11259,0


Converting to forward existential form...Done !
original formula: EG(AG(((A(((((p176==1)&&(p22==1))&&((p34==1)&&(p60==1)))&&(((p72==1)&&(p119==1))&&(p226==1))) U !(((((p14==1)&&(p40==1))&&((p59==1)&&(p71...273
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((!((E(!(!(((((p14==1)&&(p40==1))&&((p59==1)&&(p71==1)))&&(p125==1)))) U (!(((((p176==1)...489
Reverse transition relation is NOT exact ! Due to transitions t105, t106, t107, t170, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,0,2.55993,44684,1,0,430,158513,502,229,8576,101377,601
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 155 edges and 172 vertex of which 11 / 172 are part of one of the 5 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 165 transition count 395
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 104 place count 122 transition count 378
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 114 transition count 378
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 112 place count 114 transition count 367
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 134 place count 103 transition count 367
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 150 place count 87 transition count 280
Ensure Unique test removed 2 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 85 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 168 place count 85 transition count 278
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 172 place count 83 transition count 278
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 183 place count 72 transition count 102
Ensure Unique test removed 2 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 196 place count 70 transition count 102
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 66 transition count 92
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 66 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 65 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 65 transition count 90
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 242 place count 47 transition count 72
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 246 place count 43 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 43 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 257 place count 43 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 265 place count 39 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 266 place count 38 transition count 51
Applied a total of 266 rules in 28 ms. Remains 38 /172 variables (removed 134) and now considering 51/446 (removed 395) transitions.
[2026-05-31 21:11:10] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2788480688272618987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12914608714392427532.kers'
[2026-05-31 21:11:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2788480688272618987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12914608714392427532.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 40 rows 33 cols 99 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-31 21:11:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12914608714392427532.kers
Total runtime 1 ms.
[2026-05-31 21:11:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-31 21:11:10] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
[2026-05-31 21:11:10] [INFO ] Invariant cache hit.
[2026-05-31 21:11:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-31 21:11:10] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2026-05-31 21:11:10] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-31 21:11:10] [INFO ] Flow matrix only has 41 transitions (discarded 10 similar events)
[2026-05-31 21:11:10] [INFO ] Invariant cache hit.
[2026-05-31 21:11:10] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 4/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/78 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/79 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 57 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 4/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/78 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3992ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 3993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/172 places, 51/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4162 ms. Remains : 38/172 places, 51/446 transitions.
[2026-05-31 21:11:14] [INFO ] Flatten gal took : 2 ms
[2026-05-31 21:11:14] [INFO ] Flatten gal took : 2 ms
[2026-05-31 21:11:14] [INFO ] Input system was already deterministic with 51 transitions.
[2026-05-31 21:11:14] [INFO ] Flatten gal took : 2 ms
[2026-05-31 21:11:14] [INFO ] Flatten gal took : 1 ms
[2026-05-31 21:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12790048997737567497.gal : 1 ms
[2026-05-31 21:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4123878363509086352.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/CTLFireability12790048997737567497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4123878363509086352.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,76032,0.018143,4176,2,125,5,717,6,0,198,557,0


Converting to forward existential form...Done !
original formula: EG((p85==0))
=> equivalent forward existential formula: [FwdG(Init,(p85==0))] != FALSE
Hit Full ! (commute/partial/dont) 49/0/2
(forward)formula 0,1,0.041207,4580,1,0,7,3670,19,1,1002,1723,8
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 144 edges and 172 vertex of which 9 / 172 are part of one of the 4 SCC in 0 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 166 transition count 396
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 104 place count 123 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 115 transition count 379
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 112 place count 115 transition count 368
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 134 place count 104 transition count 368
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 150 place count 88 transition count 281
Ensure Unique test removed 2 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 86 transition count 281
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 168 place count 86 transition count 279
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 84 transition count 279
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 178 place count 78 transition count 203
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 186 place count 76 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 75 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 75 transition count 201
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 226 place count 56 transition count 182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 229 place count 53 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 53 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 53 transition count 172
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 240 place count 53 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 52 transition count 171
Applied a total of 241 rules in 57 ms. Remains 52 /172 variables (removed 120) and now considering 171/446 (removed 275) transitions.
[2026-05-31 21:11:14] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9122689791368934940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3971616549135584455.kers'
[2026-05-31 21:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9122689791368934940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3971616549135584455.kers]
Normalized transition count is 164 out of 165 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 52 cols 1476 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-31 21:11:14] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3971616549135584455.kers
Total runtime 2 ms.
[2026-05-31 21:11:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-31 21:11:14] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
[2026-05-31 21:11:14] [INFO ] Invariant cache hit.
[2026-05-31 21:11:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:11:15] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2026-05-31 21:11:15] [INFO ] Redundant transitions in 3 ms returned []
Running 160 sub problems to find dead transitions.
[2026-05-31 21:11:15] [INFO ] Flow matrix only has 165 transitions (discarded 6 similar events)
[2026-05-31 21:11:15] [INFO ] Invariant cache hit.
[2026-05-31 21:11:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 4/52 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/216 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 1/217 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 63 constraints, problems are : Problem set: 0 solved, 160 unsolved in 7423 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 4/52 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/216 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 160/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 223 constraints, problems are : Problem set: 0 solved, 160 unsolved in 29222 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36885ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 36886ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/172 places, 171/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37196 ms. Remains : 52/172 places, 171/446 transitions.
[2026-05-31 21:11:51] [INFO ] Flatten gal took : 5 ms
[2026-05-31 21:11:51] [INFO ] Flatten gal took : 6 ms
[2026-05-31 21:11:51] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-31 21:11:52] [INFO ] Flatten gal took : 8 ms
[2026-05-31 21:11:52] [INFO ] Flatten gal took : 7 ms
[2026-05-31 21:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11287395748094489179.gal : 12 ms
[2026-05-31 21:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10961153393983275999.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/CTLFireability11287395748094489179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10961153393983275999.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,7.46842e+06,0.183798,6736,2,325,5,4985,6,0,377,4311,0


Converting to forward existential form...Done !
original formula: EF((((AF(((((p11==0)||(p41==0))||((p60==0)||(p68==0)))||((p119==0)||(p226==0)))) * (p15==1)) * ((p34==1)&&(p53==1))) * (((p68==1)&&(p119=...173
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (((p68==1)&&(p119==1))&&(p215==1))) * ((p34==1)&&(p53==1))) * (p15==1)) * !(EG(!(((((p11=...231
Reverse transition relation is NOT exact ! Due to transitions t26, t44, t56, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
(forward)formula 0,1,0.637872,10520,1,0,223,26342,364,158,5592,19092,383
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 139 edges and 172 vertex of which 9 / 172 are part of one of the 4 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 166 transition count 397
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 57 rules applied. Total rules applied 100 place count 124 transition count 382
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 117 transition count 381
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 111 place count 116 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 112 place count 115 transition count 379
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 112 place count 115 transition count 369
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 132 place count 105 transition count 369
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 148 place count 89 transition count 282
Ensure Unique test removed 2 places
Iterating global reduction 5 with 18 rules applied. Total rules applied 166 place count 87 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 166 place count 87 transition count 280
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 170 place count 85 transition count 280
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 176 place count 79 transition count 204
Ensure Unique test removed 2 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 184 place count 77 transition count 204
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 222 place count 58 transition count 185
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 225 place count 55 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 55 transition count 178
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 232 place count 55 transition count 174
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 234 place count 54 transition count 173
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 240 place count 54 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 53 transition count 172
Applied a total of 241 rules in 53 ms. Remains 53 /172 variables (removed 119) and now considering 172/446 (removed 274) transitions.
[2026-05-31 21:11:52] [INFO ] Flow matrix only has 164 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15097483495461940448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12245682729296948519.kers'
[2026-05-31 21:11:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15097483495461940448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12245682729296948519.kers]
Normalized transition count is 163 out of 164 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 53 cols 1468 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-31 21:11:52] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12245682729296948519.kers
Total runtime 2 ms.
[2026-05-31 21:11:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-31 21:11:52] [INFO ] Flow matrix only has 164 transitions (discarded 8 similar events)
[2026-05-31 21:11:52] [INFO ] Invariant cache hit.
[2026-05-31 21:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:11:52] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2026-05-31 21:11:52] [INFO ] Redundant transitions in 3 ms returned []
Running 161 sub problems to find dead transitions.
[2026-05-31 21:11:52] [INFO ] Flow matrix only has 164 transitions (discarded 8 similar events)
[2026-05-31 21:11:52] [INFO ] Invariant cache hit.
[2026-05-31 21:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 4/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 163/216 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 1/217 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 64 constraints, problems are : Problem set: 0 solved, 161 unsolved in 10585 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 4/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 163/216 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 161/224 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 225 constraints, problems are : Problem set: 0 solved, 161 unsolved in 29939 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40793ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 40794ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/172 places, 172/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41099 ms. Remains : 53/172 places, 172/446 transitions.
[2026-05-31 21:12:33] [INFO ] Flatten gal took : 9 ms
[2026-05-31 21:12:33] [INFO ] Flatten gal took : 7 ms
[2026-05-31 21:12:33] [INFO ] Input system was already deterministic with 172 transitions.
[2026-05-31 21:12:33] [INFO ] Flatten gal took : 6 ms
[2026-05-31 21:12:33] [INFO ] Flatten gal took : 6 ms
[2026-05-31 21:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability13914681753665728842.gal : 3 ms
[2026-05-31 21:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability3695235471178461583.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/CTLFireability13914681753665728842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3695235471178461583.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.71315e+06,0.187361,6744,2,400,5,5298,6,0,382,4811,0


Converting to forward existential form...Done !
original formula: EF((AF(E(AF(((((p22==1)&&(p41==1))&&((p60==1)&&(p68==1)))&&((p119==1)&&(p226==1)))) U A(((((p22==1)&&(p30==1))&&((p53==1)&&(p72==1)))&&((...270
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG(!(E(!(EG(!(((((p22==1)&&(p41==1))&&((p60==1)&&(p68==1)))&&((p119==1)&&(p226==1)))...388
Reverse transition relation is NOT exact ! Due to transitions t44, t55, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.767736,14260,1,0,257,42140,384,185,5480,33238,427
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 146 edges and 172 vertex of which 9 / 172 are part of one of the 4 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 166 transition count 396
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 104 place count 123 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 115 transition count 379
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 112 place count 115 transition count 369
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 132 place count 105 transition count 369
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 144 place count 93 transition count 314
Iterating global reduction 3 with 12 rules applied. Total rules applied 156 place count 93 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 156 place count 93 transition count 312
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 160 place count 91 transition count 312
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 165 place count 86 transition count 273
Iterating global reduction 3 with 5 rules applied. Total rules applied 170 place count 86 transition count 273
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 204 place count 69 transition count 256
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 66 transition count 249
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 66 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 66 transition count 246
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 66 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 65 transition count 245
Applied a total of 216 rules in 44 ms. Remains 65 /172 variables (removed 107) and now considering 245/446 (removed 201) transitions.
[2026-05-31 21:12:34] [INFO ] Flow matrix only has 241 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-8318315367661885880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5058580361226990828.kers'
[2026-05-31 21:12:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8318315367661885880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5058580361226990828.kers]
Normalized transition count is 240 out of 241 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 65 cols 2292 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-31 21:12:34] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5058580361226990828.kers
Total runtime 3 ms.
[2026-05-31 21:12:34] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-31 21:12:34] [INFO ] Flow matrix only has 241 transitions (discarded 4 similar events)
[2026-05-31 21:12:34] [INFO ] Invariant cache hit.
[2026-05-31 21:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:12:34] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2026-05-31 21:12:35] [INFO ] Redundant transitions in 3 ms returned []
Running 234 sub problems to find dead transitions.
[2026-05-31 21:12:35] [INFO ] Flow matrix only has 241 transitions (discarded 4 similar events)
[2026-05-31 21:12:35] [INFO ] Invariant cache hit.
[2026-05-31 21:12:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 240/305 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 80 constraints, problems are : Problem set: 0 solved, 234 unsolved in 22054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 240/305 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 234/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 314 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52683ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 52684ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/172 places, 245/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53088 ms. Remains : 65/172 places, 245/446 transitions.
[2026-05-31 21:13:27] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:13:27] [INFO ] Flatten gal took : 16 ms
[2026-05-31 21:13:27] [INFO ] Input system was already deterministic with 245 transitions.
[2026-05-31 21:13:27] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:13:27] [INFO ] Flatten gal took : 19 ms
[2026-05-31 21:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14439699358344062253.gal : 4 ms
[2026-05-31 21:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16479564543905381538.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/CTLFireability14439699358344062253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16479564543905381538.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32246e+07,0.330712,8376,2,945,5,10914,6,0,503,9587,0


Converting to forward existential form...Done !
original formula: E(!(((((p22==1)&&(p41==1))&&((p49==1)&&(p68==1)))&&((p119==1)&&(p215==1)))) U AG(!(EG(!(((p146==1)||((((p14==1)&&(p33==1))&&((p59==1)&&(p...181
=> equivalent forward existential formula: [(FwdU(Init,!(((((p22==1)&&(p41==1))&&((p49==1)&&(p68==1)))&&((p119==1)&&(p215==1))))) * !(E(TRUE U !(!(EG(!(((p...239
Reverse transition relation is NOT exact ! Due to transitions t1, t125, t126, t127, t128, t129, t130, t131, t132, t133, t134, t135, t136, t137, t138, t139,...316
(forward)formula 0,0,1.13312,21584,1,0,371,66419,514,242,7569,55659,540
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 143 edges and 172 vertex of which 9 / 172 are part of one of the 4 SCC in 0 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 166 transition count 396
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 104 place count 123 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 115 transition count 379
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 112 place count 115 transition count 368
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 134 place count 104 transition count 368
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 150 place count 88 transition count 281
Ensure Unique test removed 2 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 168 place count 86 transition count 281
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 168 place count 86 transition count 279
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 172 place count 84 transition count 279
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 177 place count 79 transition count 257
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 184 place count 77 transition count 257
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 222 place count 58 transition count 238
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 225 place count 55 transition count 231
Iterating global reduction 3 with 3 rules applied. Total rules applied 228 place count 55 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 231 place count 55 transition count 228
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 236 place count 55 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 54 transition count 227
Applied a total of 237 rules in 29 ms. Remains 54 /172 variables (removed 118) and now considering 227/446 (removed 219) transitions.
[2026-05-31 21:13:28] [INFO ] Flow matrix only has 221 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3006895804641061523.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3040760644076353778.kers'
[2026-05-31 21:13:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3006895804641061523.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3040760644076353778.kers]
Normalized transition count is 220 out of 221 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 54 cols 2128 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-31 21:13:29] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3040760644076353778.kers
Total runtime 2 ms.
[2026-05-31 21:13:29] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-31 21:13:29] [INFO ] Flow matrix only has 221 transitions (discarded 6 similar events)
[2026-05-31 21:13:29] [INFO ] Invariant cache hit.
[2026-05-31 21:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:13:29] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2026-05-31 21:13:29] [INFO ] Redundant transitions in 2 ms returned []
Running 216 sub problems to find dead transitions.
[2026-05-31 21:13:29] [INFO ] Flow matrix only has 221 transitions (discarded 6 similar events)
[2026-05-31 21:13:29] [INFO ] Invariant cache hit.
[2026-05-31 21:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/274 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 1/275 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 65 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 220/274 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 216/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/275 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 281 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47527ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 47528ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/172 places, 227/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47837 ms. Remains : 54/172 places, 227/446 transitions.
[2026-05-31 21:14:16] [INFO ] Flatten gal took : 7 ms
[2026-05-31 21:14:16] [INFO ] Flatten gal took : 8 ms
[2026-05-31 21:14:16] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-31 21:14:16] [INFO ] Flatten gal took : 8 ms
[2026-05-31 21:14:16] [INFO ] Flatten gal took : 25 ms
[2026-05-31 21:14:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8565891705339508440.gal : 28 ms
[2026-05-31 21:14:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18273180802542659067.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8565891705339508440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18273180802542659067.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/ReachabilityCardinality18273180802542659067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 144
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :144 after 192
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :192 after 742
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :742 after 6416
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6416 after 27792
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,1.12009e+07,0.279141,8048,2,366,12,6581,7,0,456,5462,0
Total reachable state count : 11200896

Verifying 1 reachability properties.
Reachability property ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-13 is true.
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

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-bP04C04-CTLFireability-2024-13,1,0.282758,8308,2,55,12,6581,7,0,476,5462,0
RANDOM walk for 40000 steps (8 resets) in 2787 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 169007 steps, run visited all 1 properties in 514 ms. (steps per millisecond=328 )
Probabilistic random walk after 169007 steps, saw 45952 distinct states, run finished after 521 ms. (steps per millisecond=324 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 172/172 places, 446/446 transitions.
Graph (trivial) has 139 edges and 172 vertex of which 9 / 172 are part of one of the 4 SCC in 0 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 166 transition count 402
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 89 place count 129 transition count 388
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 122 transition count 388
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 96 place count 122 transition count 377
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 118 place count 111 transition count 377
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 134 place count 95 transition count 290
Ensure Unique test removed 2 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 152 place count 93 transition count 290
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 152 place count 93 transition count 288
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 91 transition count 288
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 163 place count 84 transition count 176
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 172 place count 82 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 80 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 80 transition count 136
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 212 place count 62 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 59 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 59 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 222 place count 59 transition count 107
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 3 with 4 rules applied. Total rules applied 226 place count 57 transition count 105
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 57 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 57 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 56 transition count 103
Applied a total of 232 rules in 40 ms. Remains 56 /172 variables (removed 116) and now considering 103/446 (removed 343) transitions.
[2026-05-31 21:14:18] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7532249262034915846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17688357073512821065.kers'
[2026-05-31 21:14:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7532249262034915846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17688357073512821065.kers]
Normalized transition count is 96 out of 97 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 56 cols 572 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-31 21:14:18] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17688357073512821065.kers
Total runtime 2 ms.
[2026-05-31 21:14:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-31 21:14:18] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
[2026-05-31 21:14:18] [INFO ] Invariant cache hit.
[2026-05-31 21:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-31 21:14:18] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2026-05-31 21:14:18] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2026-05-31 21:14:18] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
[2026-05-31 21:14:18] [INFO ] Invariant cache hit.
[2026-05-31 21:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 96/152 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 67 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5424 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 96/152 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 97/163 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 164 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8291 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13757ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 13757ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/172 places, 103/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14025 ms. Remains : 56/172 places, 103/446 transitions.
[2026-05-31 21:14:32] [INFO ] Flatten gal took : 6 ms
[2026-05-31 21:14:32] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:14:32] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-31 21:14:32] [INFO ] Flatten gal took : 5 ms
[2026-05-31 21:14:32] [INFO ] Flatten gal took : 4 ms
[2026-05-31 21:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12749551475663533704.gal : 2 ms
[2026-05-31 21:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability13998944981574999067.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/CTLFireability12749551475663533704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13998944981574999067.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,8.65258e+06,0.089891,5088,2,410,5,4327,6,0,324,3703,0


Converting to forward existential form...Done !
original formula: A(!((((A(AG((p129==1)) U E((p178==1) U (p200==1))) * (p15==1)) * ((p34==1)&&(p60==1))) * (((p68==1)&&(p119==1))&&((p226==1)&&(p82!=1)))))...174
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p23==1))))))) * !(E(!(!(E(TRUE U (p23==1)))) U (!(!((((!((E(!(E((p178==1) U (p200==...388
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t52, t53, t63, Intersection with reachable at each step enabled. (destroyed/revers...185
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.620783,15044,1,0,184,63501,244,111,3138,47036,272
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-14 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 : 172/172 places, 446/446 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 154 transition count 357
Ensure Unique test removed 1 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 37 place count 153 transition count 357
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 147 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 147 transition count 343
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 53 place count 143 transition count 338
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 142 transition count 338
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 139 transition count 327
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 139 transition count 327
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 137 transition count 325
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 137 transition count 325
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 135 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 135 transition count 323
Applied a total of 72 rules in 15 ms. Remains 135 /172 variables (removed 37) and now considering 323/446 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13577769133730848703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1910646596295729615.kers'
[2026-05-31 21:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13577769133730848703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1910646596295729615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 323 rows 135 cols 2051 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-05-31 21:14:32] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1910646596295729615.kers
Total runtime 3 ms.
[2026-05-31 21:14:33] [INFO ] Implicit Places using invariants in 98 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/172 places, 323/446 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 134/172 places, 323/446 transitions.
[2026-05-31 21:14:33] [INFO ] Flatten gal took : 16 ms
[2026-05-31 21:14:33] [INFO ] Flatten gal took : 19 ms
[2026-05-31 21:14:33] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-31 21:14:33] [INFO ] Flatten gal took : 19 ms
[2026-05-31 21:14:33] [INFO ] Flatten gal took : 19 ms
[2026-05-31 21:14:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2787368887068729665.gal : 4 ms
[2026-05-31 21:14:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12842708468571716444.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/CTLFireability2787368887068729665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12842708468571716444.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.99354e+09,3.33365,73092,2,16465,5,264162,6,0,861,209924,0


Converting to forward existential form...Done !
original formula: (EF((((((AG((p126==1)) + (AG(((((p22==1)&&(p30==1))&&((p53==1)&&(p68==1)))&&((p119==1)&&(p226==1)))) * (p206==1))) + EF(EG((p232==1)))) *...416
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((((!(E(TRUE U !((p126==1)))) + (!(E(TRUE U !(((((p22==1)&&(p30==1))&&((p53==1)&&(p68=...536
Reverse transition relation is NOT exact ! Due to transitions t2, t10, t14, t15, t18, t27, t30, t34, t38, t41, t52, t56, t59, t70, t74, t77, t81, t83, t89,...1214
Hit Full ! (commute/partial/dont) 321/0/2
(forward)formula 0,0,20.3939,370940,1,0,740,1.67451e+06,690,348,9541,1.56316e+06,846
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-31 21:14:53] [INFO ] Flatten gal took : 29 ms
[2026-05-31 21:14:53] [INFO ] Flatten gal took : 28 ms
[2026-05-31 21:14:53] [INFO ] Applying decomposition
[2026-05-31 21:14:53] [INFO ] Flatten gal took : 29 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/graph17862701582085807659.txt' '-o' '/tmp/graph17862701582085807659.bin' '-w' '/tmp/graph17862701582085807659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17862701582085807659.bin' '-l' '-1' '-v' '-w' '/tmp/graph17862701582085807659.weights' '-q' '0' '-e' '0.001'
[2026-05-31 21:14:54] [INFO ] Decomposing Gal with order
[2026-05-31 21:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 21:14:54] [INFO ] Removed a total of 151 redundant transitions.
[2026-05-31 21:14:54] [INFO ] Flatten gal took : 60 ms
[2026-05-31 21:14:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-31 21:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3896441996425970462.gal : 11 ms
[2026-05-31 21:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7988824990372529679.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/CTLFireability3896441996425970462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7988824990372529679.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78917e+10,270.617,3276192,1246,10063,158767,2.82704e+06,477,3.19599e+06,501,5.82781e+07,0


Converting to forward existential form...Done !
original formula: (E(A(EF(((((u15.p11==1)&&(u15.p34==1))&&((u15.p49==1)&&(u15.p72==1)))&&((u15.p119==1)&&(u15.p226==1)))) U ((((u15.p15==1)&&(u15.p41==1))&...803
=> equivalent forward existential formula: ([FwdG((Init * E(!((E(!(((((u15.p15==1)&&(u15.p41==1))&&((u15.p49==1)&&(u15.p68==1)))&&((u15.p119==1)&&(u15.p215...2355
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t22, t28, t38, t87, u15.t307, u15.t308, u15.t311, u15.t312, u15.t313, u15.t314, u15....1364
Detected timeout of ITS tools.
[2026-05-31 21:38:48] [INFO ] Applying decomposition
[2026-05-31 21:38:48] [INFO ] Flatten gal took : 18 ms
[2026-05-31 21:38:48] [INFO ] Decomposing Gal with order
[2026-05-31 21:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-31 21:38:48] [INFO ] Removed a total of 1443 redundant transitions.
[2026-05-31 21:38:48] [INFO ] Flatten gal took : 53 ms
[2026-05-31 21:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 13 ms.
[2026-05-31 21:38:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8539257641574546312.gal : 2 ms
[2026-05-31 21:38:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12283717504281001516.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/CTLFireability8539257641574546312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12283717504281001516.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78917e+10,0.196666,9980,501,605,8588,3322,255,28576,286,14934,0


Converting to forward existential form...Done !
original formula: (E(A(EF(((((i0.i0.i0.i0.u5.p11==1)&&(i0.i0.i0.i0.u6.p34==1))&&((i0.i0.i0.u7.p49==1)&&(i0.i0.u8.p72==1)))&&((i0.i1.u13.p119==1)&&(i1.u18.p...1111
=> equivalent forward existential formula: ([FwdG((Init * E(!((E(!(((((i0.i0.i0.i0.u5.p15==1)&&(i0.i0.i0.i0.u6.p41==1))&&((i0.i0.i0.u7.p49==1)&&(i0.i0.u8.p...3209
Reverse transition relation is NOT exact ! Due to transitions i0.t386, i0.i0.t110, i0.i0.u8.t114, i0.i0.u8.t313, i0.i0.u8.t314, i0.i0.i0.t115, i0.i0.i0.u7....796
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,674.489,7641980,1,0,7.5413e+06,175436,1023,7.42298e+07,1014,1.57002e+06,969089
FORMULA ErlangenMainframeV1-PT-bP04C04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 2816240 ms.

BK_STOP 1780264206611

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

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