Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000258.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 70K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779702109727

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:41:51] [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-25 09:41:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:41:51] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2026-05-25 09:41:51] [INFO ] Transformed 306 places.
[2026-05-25 09:41:51] [INFO ] Transformed 298 transitions.
[2026-05-25 09:41:51] [INFO ] Found NUPN structural information;
[2026-05-25 09:41:51] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 100 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 275 transition count 267
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 275 transition count 267
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 80 place count 257 transition count 249
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 257 transition count 249
Applied a total of 98 rules in 77 ms. Remains 257 /306 variables (removed 49) and now considering 249/298 (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-2719764417191118707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5313719752762520076.kers'
[2026-05-25 09:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2719764417191118707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5313719752762520076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 249 rows 257 cols 602 entries
Finished phase 1 with 237 SingleSign rule and 0 generalized
[2026-05-25 09:41:51] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5313719752762520076.kers
Total runtime 3 ms.
[2026-05-25 09:41:51] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-25 09:41:51] [INFO ] Invariant cache hit.
[2026-05-25 09:41:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2026-05-25 09:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/257 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 248 unsolved
SMT process timed out in 30079ms, After SMT, problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 30091ms
Starting structural reductions in LTL mode, iteration 1 : 257/306 places, 249/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30783 ms. Remains : 257/306 places, 249/298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 257 /257 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2026-05-25 09:42:22] [INFO ] Invariant cache hit.
[2026-05-25 09:42:22] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:42:22] [INFO ] Invariant cache hit.
[2026-05-25 09:42:22] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 257/257 places, 249/249 transitions.
Support contains 100 out of 257 places after structural reductions.
[2026-05-25 09:42:22] [INFO ] Flatten gal took : 35 ms
[2026-05-25 09:42:22] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:42:22] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 93 out of 257 places (down from 100) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1406 ms. (28 steps per ms) remains 15/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
[2026-05-25 09:42:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 158/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 70/257 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 249/506 variables, 257/278 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/506 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 279 constraints, problems are : Problem set: 0 solved, 15 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 158/187 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 70/257 variables, 8/21 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 249/506 variables, 257/280 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 14/294 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/506 variables, 1/298 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/506 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/506 variables, 1/299 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/506 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 299 constraints, problems are : Problem set: 1 solved, 14 unsolved in 3361 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4344ms problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 13 properties in 973 ms.
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 181 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 252 transition count 187
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 196 transition count 187
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 113 place count 196 transition count 150
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 159 transition count 150
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 209 place count 137 transition count 128
Iterating global reduction 2 with 22 rules applied. Total rules applied 231 place count 137 transition count 128
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 231 place count 137 transition count 117
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 253 place count 126 transition count 117
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 315 place count 95 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 321 place count 92 transition count 109
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 347 place count 92 transition count 83
Reduce places removed 26 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 375 place count 66 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 376 place count 66 transition count 81
Applied a total of 376 rules in 61 ms. Remains 66 /257 variables (removed 191) and now considering 81/249 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 66/257 places, 81/249 transitions.
RANDOM walk for 16046 steps (514 resets) in 86 ms. (184 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 09:42:29] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:42:29] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:42:29] [INFO ] Input system was already deterministic with 249 transitions.
Computed a total of 49 stabilizing places and 49 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 185 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 251 transition count 186
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 194 transition count 186
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 115 place count 194 transition count 148
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 156 transition count 148
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 212 place count 135 transition count 127
Iterating global reduction 2 with 21 rules applied. Total rules applied 233 place count 135 transition count 127
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 233 place count 135 transition count 118
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 251 place count 126 transition count 118
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 293 place count 105 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 104 transition count 96
Applied a total of 294 rules in 31 ms. Remains 104 /257 variables (removed 153) and now considering 96/249 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6013584985232094658.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1889850378359922938.kers'
[2026-05-25 09:42:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6013584985232094658.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1889850378359922938.kers]
Normalized transition count is 95 out of 96 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 95 rows 101 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 09:42:29] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1889850378359922938.kers
Total runtime 1 ms.
[2026-05-25 09:42:29] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:42:29] [INFO ] Invariant cache hit.
[2026-05-25 09:42:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 09:42:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-25 09:42:29] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2026-05-25 09:42:29] [INFO ] Invariant cache hit.
[2026-05-25 09:42:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 2/104 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 95/199 variables, 104/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 132 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4482 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 2/104 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 95/199 variables, 104/129 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 90/222 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 225 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5455 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 9948ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9948ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/257 places, 96/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10176 ms. Remains : 104/257 places, 96/249 transitions.
[2026-05-25 09:42:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:39] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:42:39] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-25 09:42:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:42:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1549576969535145478.gal : 2 ms
[2026-05-25 09:42:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10016550561313790647.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1549576969535145478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10016550561313790647.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.21556e+11,0.309101,16136,2,699,5,59942,6,0,511,71880,0


Converting to forward existential form...Done !
original formula: EG(AG((AF((p36==1)) * AF((p4==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((!(EG(!((p36==1)))) * !(EG(!((p4==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t21, t26, t27, t28, t30, t37, t42, t49, t64, t65, t87, t89, t90, t91, Intersection w...238
(forward)formula 0,0,0.94413,34528,1,0,189,161801,229,85,3110,198083,218
FORMULA MedleyA-PT-21-CTLFireability-2024-00 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 : 257/257 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 226
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 222 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 222 transition count 214
Applied a total of 70 rules in 14 ms. Remains 222 /257 variables (removed 35) and now considering 214/249 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10035964697483872234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7181194579139003935.kers'
[2026-05-25 09:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10035964697483872234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7181194579139003935.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 222 cols 532 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-25 09:42:40] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7181194579139003935.kers
Total runtime 2 ms.
[2026-05-25 09:42:40] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 09:42:40] [INFO ] Invariant cache hit.
[2026-05-25 09:42:40] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 09:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/253 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 257 constraints, problems are : Problem set: 0 solved, 213 unsolved in 25304 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/467 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 8/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 55368ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 55368ms
Starting structural reductions in LTL mode, iteration 1 : 222/257 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55689 ms. Remains : 222/257 places, 214/249 transitions.
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:43:36] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:43:36] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1161165715999018683.gal : 3 ms
[2026-05-25 09:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4873153486115611115.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/CTLFireability1161165715999018683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4873153486115611115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46924e+17,1.536,60184,2,10707,5,246138,6,0,1104,323356,0


Converting to forward existential form...Done !
original formula: EG(AX((EG((p205==1)) + EG((p139==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((EG((p205==1)) + EG((p139==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t63, t72, t84, t99, t109, t129, t144, t154, t17...348
Detected timeout of ITS tools.
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:44:06] [INFO ] Applying decomposition
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph282770338547047468.txt' '-o' '/tmp/graph282770338547047468.bin' '-w' '/tmp/graph282770338547047468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph282770338547047468.bin' '-l' '-1' '-v' '-w' '/tmp/graph282770338547047468.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:44:06] [INFO ] Decomposing Gal with order
[2026-05-25 09:44:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:44:06] [INFO ] Removed a total of 33 redundant transitions.
[2026-05-25 09:44:06] [INFO ] Flatten gal took : 62 ms
[2026-05-25 09:44:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 09:44:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2362388949063245884.gal : 5 ms
[2026-05-25 09:44:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14445338814046105120.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/CTLFireability2362388949063245884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14445338814046105120.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46924e+17,0.182816,11952,1342,25,17839,281,524,20273,42,695,0


Converting to forward existential form...Done !
original formula: EG(AX((EG((i11.u64.p205==1)) + EG((i6.u42.p139==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((EG((i11.u64.p205==1)) + EG((i6.u42.p139==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t171, t172, t173, t175, t176, t177, t181, t182, t183, t193, t196, t201, t204, t209,...470
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 173 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 251 transition count 193
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 201 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 103 place count 200 transition count 192
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 103 place count 200 transition count 152
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 183 place count 160 transition count 152
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 204 place count 139 transition count 131
Iterating global reduction 3 with 21 rules applied. Total rules applied 225 place count 139 transition count 131
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 225 place count 139 transition count 124
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 239 place count 132 transition count 124
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 285 place count 109 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 286 place count 109 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 108 transition count 100
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 44 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 289 place count 106 transition count 100
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 291 place count 105 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 291 place count 105 transition count 98
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 293 place count 104 transition count 98
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 5 with 8 rules applied. Total rules applied 301 place count 100 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 100 transition count 93
Applied a total of 302 rules in 53 ms. Remains 100 /257 variables (removed 157) and now considering 93/249 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17317902358000067050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6287019886963844688.kers'
[2026-05-25 09:44:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17317902358000067050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6287019886963844688.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 254 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-25 09:44:36] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6287019886963844688.kers
Total runtime 0 ms.
[2026-05-25 09:44:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:44:36] [INFO ] Invariant cache hit.
[2026-05-25 09:44:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-25 09:44:36] [INFO ] Redundant transitions in 1 ms returned []
Running 67 sub problems to find dead transitions.
[2026-05-25 09:44:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 14/100 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 92/192 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3141 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 14/100 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 92/192 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 67/190 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/193 variables, and 192 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6191ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 6191ms
Starting structural reductions in SI_CTL mode, iteration 1 : 100/257 places, 93/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6486 ms. Remains : 100/257 places, 93/249 transitions.
[2026-05-25 09:44:43] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:44:43] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:44:43] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 09:44:43] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:44:43] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:44:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7005915558675851609.gal : 1 ms
[2026-05-25 09:44:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15804977169326881926.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/CTLFireability7005915558675851609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15804977169326881926.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.21548e+11,0.093432,7812,2,426,5,19075,5,0,493,22630,0


Converting to forward existential form...Done !
original formula: AF(E(EF((p202==1)) U E(EF((p129!=1)) U ((p141==1) + ((p303==1) * EF((p166==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E(TRUE U (p202==1)) U E(E(TRUE U (p129!=1)) U ((p141==1) + ((p303==1) * E(TRUE U (p166==1))))))))...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t17, t38, t41, t44, t47, t56, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,1,19.0753,642660,1,0,230,3.25878e+06,217,112,2870,4.27e+06,287
FORMULA MedleyA-PT-21-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 : 257/257 places, 249/249 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 238 transition count 230
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 238 transition count 230
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 49 place count 227 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 60 place count 227 transition count 219
Applied a total of 60 rules in 9 ms. Remains 227 /257 variables (removed 30) and now considering 219/249 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11921533940232878315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12170685954693525029.kers'
[2026-05-25 09:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11921533940232878315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12170685954693525029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 227 cols 542 entries
Finished phase 1 with 207 SingleSign rule and 0 generalized
[2026-05-25 09:45:02] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12170685954693525029.kers
Total runtime 1 ms.
[2026-05-25 09:45:02] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 09:45:02] [INFO ] Invariant cache hit.
[2026-05-25 09:45:02] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 09:45:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/446 variables, 227/260 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/446 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 260 constraints, problems are : Problem set: 0 solved, 218 unsolved in 22478 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/446 variables, 227/262 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 218/480 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 11/491 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 505 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52536ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 52537ms
Starting structural reductions in LTL mode, iteration 1 : 227/257 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53084 ms. Remains : 227/257 places, 219/249 transitions.
[2026-05-25 09:45:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:45:55] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:45:55] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-25 09:45:55] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:45:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7746520910667008307.gal : 1 ms
[2026-05-25 09:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17727426816372513843.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/CTLFireability7746520910667008307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17727426816372513843.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.19726e+17,4.42229,102140,2,18039,5,406374,6,0,1129,593618,0


Converting to forward existential form...Done !
original formula: A((EG((((!(AF((p275==1))) + EG((p274==1))) + ((p291==1)||(p237==1))) + (((((p147==1)&&(p300==1))&&((p138==1)||(p23==1)))||(p78==1))||((p3...328
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!((E(!((p195==1)) U (!((((p10==1)||((p259==1)&&(p284==1)))||((p251==1)&&(p56==1)))) * !((p...732
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t11, t13, t22, t31, t32, t39, t54, t64, t70, t73, t86, t101, t111, t131,...370
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 36 ms
[2026-05-25 09:46:25] [INFO ] Applying decomposition
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5776518582698245946.txt' '-o' '/tmp/graph5776518582698245946.bin' '-w' '/tmp/graph5776518582698245946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5776518582698245946.bin' '-l' '-1' '-v' '-w' '/tmp/graph5776518582698245946.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:46:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:46:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:46:25] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-25 09:46:25] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:46:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 09:46:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6419926241223182800.gal : 14 ms
[2026-05-25 09:46:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13814956546552285866.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/CTLFireability6419926241223182800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13814956546552285866.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.19726e+17,0.847085,34056,2079,54,68846,424,548,76717,67,1123,0


Converting to forward existential form...Done !
original formula: A((EG((((!(AF((i14.i0.u85.p275==1))) + EG((i14.i1.u84.p274==1))) + ((u87.p291==1)||(i10.u75.p237==1))) + (((((i9.i0.u37.p147==1)&&(i13.i2...506
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!(!((E(!((i11.i0.u60.p195==1)) U (!((((i3.u4.p10==1)||((i1.u80.p259==1)&&(i1.u86.p284==1)))|...1074
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t176, t177, t178, t180, t181, t186, t187, t198, t201, t209, u87.t11, u87.t13, i1.u8...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 237 transition count 229
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 237 transition count 229
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 226 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 226 transition count 218
Applied a total of 62 rules in 19 ms. Remains 226 /257 variables (removed 31) and now considering 218/249 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14832511336302425234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2780349831957432803.kers'
[2026-05-25 09:46:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14832511336302425234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2780349831957432803.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 226 cols 540 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-25 09:46:55] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2780349831957432803.kers
Total runtime 3 ms.
[2026-05-25 09:46:55] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 09:46:56] [INFO ] Invariant cache hit.
[2026-05-25 09:46:56] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 09:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/444 variables, 226/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 261 constraints, problems are : Problem set: 0 solved, 217 unsolved in 24732 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/444 variables, 226/260 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 217/477 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 14/491 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 499 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 54783ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 54783ms
Starting structural reductions in LTL mode, iteration 1 : 226/257 places, 218/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55178 ms. Remains : 226/257 places, 218/249 transitions.
[2026-05-25 09:47:51] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:47:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:47:51] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-25 09:47:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:47:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:47:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16689223859940807894.gal : 2 ms
[2026-05-25 09:47:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16165771561137532617.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/CTLFireability16689223859940807894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16165771561137532617.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.99735e+17,2.53999,87168,2,13101,5,353028,6,0,1124,492694,0


Converting to forward existential form...Done !
original formula: (E(!(AG((E(((p104==1)&&(p154==1)) U (p202==1)) * E(((p11==1)&&(p70==1)) U (p256==1))))) U EX((p209==1))) + E((EF((((((p262==1)&&(p140==1)...316
=> equivalent forward existential formula: ([(EY(FwdU(Init,!(!(E(TRUE U !((E(((p104==1)&&(p154==1)) U (p202==1)) * E(((p11==1)&&(p70==1)) U (p256==1)))))))...782
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t23, t26, t31, t32, t33, t40, t55, t61, t64, t66, t87, t102, t112, ...369
Detected timeout of ITS tools.
[2026-05-25 09:48:21] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:48:21] [INFO ] Applying decomposition
[2026-05-25 09:48:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11108951927327210848.txt' '-o' '/tmp/graph11108951927327210848.bin' '-w' '/tmp/graph11108951927327210848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11108951927327210848.bin' '-l' '-1' '-v' '-w' '/tmp/graph11108951927327210848.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:48:21] [INFO ] Decomposing Gal with order
[2026-05-25 09:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:48:21] [INFO ] Removed a total of 30 redundant transitions.
[2026-05-25 09:48:21] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:48:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:48:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11907680431382109086.gal : 3 ms
[2026-05-25 09:48:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5861628248703954607.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/CTLFireability11907680431382109086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5861628248703954607.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99735e+17,0.381818,20772,1888,23,41086,246,508,41411,39,581,0


Converting to forward existential form...Done !
original formula: (E(!(AG((E(((i6.u32.p104==1)&&(i6.u49.p154==1)) U (i10.u64.p202==1)) * E(((i2.u5.p11==1)&&(i2.u22.p70==1)) U (i0.i1.u80.p256==1))))) U EX...478
=> equivalent forward existential formula: ([(EY(FwdU(Init,!(!(E(TRUE U !((E(((i6.u32.p104==1)&&(i6.u49.p154==1)) U (i10.u64.p202==1)) * E(((i2.u5.p11==1)&...1098
Reverse transition relation is NOT exact ! Due to transitions t10, t31, t175, t176, t177, t179, t180, t181, t185, t186, t187, t197, t200, t208, t213, t216,...531
(forward)formula 0,1,6.16158,267344,1,0,598142,342,3557,790446,182,884,940936
FORMULA MedleyA-PT-21-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 226
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 222 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 222 transition count 214
Applied a total of 70 rules in 18 ms. Remains 222 /257 variables (removed 35) and now considering 214/249 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2699879356861521102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16864917123621625037.kers'
[2026-05-25 09:48:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2699879356861521102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16864917123621625037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 222 cols 532 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-25 09:48:27] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16864917123621625037.kers
Total runtime 1 ms.
[2026-05-25 09:48:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:48:27] [INFO ] Invariant cache hit.
[2026-05-25 09:48:27] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 09:48:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/253 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 257 constraints, problems are : Problem set: 0 solved, 213 unsolved in 25938 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/467 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 8/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 484 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 55968ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 55969ms
Starting structural reductions in LTL mode, iteration 1 : 222/257 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56278 ms. Remains : 222/257 places, 214/249 transitions.
[2026-05-25 09:49:23] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:49:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:49:23] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 09:49:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:49:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:49:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2011188708925859627.gal : 1 ms
[2026-05-25 09:49:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16468957849986082925.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/CTLFireability2011188708925859627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16468957849986082925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46924e+17,2.2414,60204,2,10707,5,246138,6,0,1104,323356,0


Converting to forward existential form...Done !
original formula: (EF(((EG(((p216==0)||((p170==1)&&(p239==1)))) * (p295==1)) + !(A(AG((p157==1)) U (p3==1))))) * EG(!(A(((p34==1)&&(p205!=1)) U (EX(((p186=...203
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((EG(((p216==0)||((p170==1)&&(p239==1)))) * (p295==1)) + !(!((E(!((p3==1)) U (!(!(E(TRUE ...446
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t63, t72, t84, t99, t109, t129, t144, t154, t17...348
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-25 09:49:53] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:49:53] [INFO ] Applying decomposition
[2026-05-25 09:49:53] [INFO ] Flatten gal took : 4 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/graph11459467802188159015.txt' '-o' '/tmp/graph11459467802188159015.bin' '-w' '/tmp/graph11459467802188159015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11459467802188159015.bin' '-l' '-1' '-v' '-w' '/tmp/graph11459467802188159015.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:49:53] [INFO ] Decomposing Gal with order
[2026-05-25 09:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:49:54] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-25 09:49:54] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:49:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7157963393156911361.gal : 2 ms
[2026-05-25 09:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1454737668396910020.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/CTLFireability7157963393156911361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1454737668396910020.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46924e+17,0.179149,11244,1258,40,15693,280,515,19444,60,642,0


Converting to forward existential form...Done !
original formula: (EF(((EG(((i11.u66.p216==0)||((i8.i2.u53.p170==1)&&(i11.u74.p239==1)))) * (i14.u85.p295==1)) + !(A(AG((i5.u48.p157==1)) U (i8.i0.u1.p3==1...294
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((EG(((i11.u66.p216==0)||((i8.i2.u53.p170==1)&&(i11.u74.p239==1)))) * (i14.u85.p295==1)) ...607
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t171, t172, t173, t175, t176, t177, t181, t182, t183, t193, t196, t201, t204, t209,...457
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 179 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 251 transition count 191
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 199 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 197 transition count 189
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 109 place count 197 transition count 152
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 183 place count 160 transition count 152
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 202 place count 141 transition count 133
Iterating global reduction 3 with 19 rules applied. Total rules applied 221 place count 141 transition count 133
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 221 place count 141 transition count 125
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 237 place count 133 transition count 125
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 279 place count 112 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 111 transition count 103
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 110 vertex of which 5 / 110 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 282 place count 107 transition count 103
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 286 place count 106 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 292 place count 103 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 103 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 294 place count 103 transition count 94
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 296 place count 102 transition count 94
Applied a total of 296 rules in 61 ms. Remains 102 /257 variables (removed 155) and now considering 94/249 (removed 155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-827057239811374491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10376881316278387267.kers'
[2026-05-25 09:50:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-827057239811374491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10376881316278387267.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 93 rows 101 cols 260 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 09:50:24] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10376881316278387267.kers
Total runtime 2 ms.
[2026-05-25 09:50:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:50:24] [INFO ] Invariant cache hit.
[2026-05-25 09:50:24] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2026-05-25 09:50:24] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 09:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 9/102 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 93/195 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4581 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 9/102 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 93/195 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 77/205 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/196 variables, and 209 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5431 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 10024ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 10024ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/257 places, 94/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10358 ms. Remains : 102/257 places, 94/249 transitions.
[2026-05-25 09:50:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:50:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:50:34] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-25 09:50:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:50:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:50:34] [INFO ] Time to serialize gal into /tmp/CTLFireability599996134749931636.gal : 0 ms
[2026-05-25 09:50:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15295124284370814983.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/CTLFireability599996134749931636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15295124284370814983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.04036e+11,0.138304,10796,2,1721,5,31017,5,0,500,38594,0


Converting to forward existential form...Done !
original formula: (EG(!(A(A((p277==1) U (p187==1)) U A((p126==1) U (p107==1))))) * EG(AF(((p22==0)||(p72==0)))))
=> equivalent forward existential formula: [FwdG((Init * EG(!(!((E(!(!((E(!((p107==1)) U (!((p126==1)) * !((p107==1)))) + EG(!((p107==1)))))) U (!(!((E(!((...426
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t16, t29, t30, t31, t37, t41, t44, t45, t46, t54, t80, t81, t84, t91, Intersection w...238
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,5.43731,164516,1,0,381,818666,239,284,2936,1.16765e+06,431
FORMULA MedleyA-PT-21-CTLFireability-2024-06 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 : 257/257 places, 249/249 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 256 transition count 194
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 109 place count 202 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 201 transition count 193
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 110 place count 201 transition count 157
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 182 place count 165 transition count 157
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 202 place count 145 transition count 137
Iterating global reduction 3 with 20 rules applied. Total rules applied 222 place count 145 transition count 137
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 222 place count 145 transition count 129
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 238 place count 137 transition count 129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 284 place count 114 transition count 106
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 286 place count 114 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 287 place count 113 transition count 105
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 46 edges and 112 vertex of which 4 / 112 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 289 place count 110 transition count 105
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 292 place count 109 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 298 place count 106 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 299 place count 106 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 299 place count 106 transition count 98
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 301 place count 105 transition count 98
Applied a total of 301 rules in 33 ms. Remains 105 /257 variables (removed 152) and now considering 98/249 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11549994670878581866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-221731332726234909.kers'
[2026-05-25 09:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11549994670878581866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-221731332726234909.kers]
Normalized transition count is 97 out of 98 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 264 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-25 09:50:40] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-221731332726234909.kers
Total runtime 1 ms.
[2026-05-25 09:50:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:50:40] [INFO ] Invariant cache hit.
[2026-05-25 09:50:40] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-25 09:50:40] [INFO ] Redundant transitions in 0 ms returned []
Running 70 sub problems to find dead transitions.
[2026-05-25 09:50:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 14/105 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 97/202 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 125 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 14/105 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 97/202 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 70/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 198 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3662 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6089ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 6090ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/257 places, 98/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6354 ms. Remains : 105/257 places, 98/249 transitions.
[2026-05-25 09:50:46] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:50:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:50:46] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-25 09:50:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:50:46] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3753408136492767001.gal : 2 ms
[2026-05-25 09:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability837175438154890589.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/CTLFireability3753408136492767001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability837175438154890589.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,4.85954e+11,0.123085,8640,2,757,5,23207,5,0,518,25058,0


Converting to forward existential form...Done !
original formula: AG((((p208==1) + EF((((((p263==0)||(p11==0))||(p70==0))&&(p245==1))&&(p302==1)))) + ((AF((p155==0)) * (p249==1)) * EF((((p93==0)||(p152==...173
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !(((p208==1) + E(TRUE U (((((p263==0)||(p11==0))||(p70==0))&&(p245==1))&&(p302==1))))...488
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t9, t42, t47, t51, t52, t88, Intersection with reachable at each step enabled. (...200
(forward)formula 0,0,13.2122,313944,1,0,204,1.63463e+06,218,92,2995,2.01357e+06,233
FORMULA MedleyA-PT-21-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 226
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 221 transition count 213
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 221 transition count 213
Applied a total of 72 rules in 10 ms. Remains 221 /257 variables (removed 36) and now considering 213/249 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6667629114320019298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6296082231274990066.kers'
[2026-05-25 09:50:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6667629114320019298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6296082231274990066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 221 cols 530 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-25 09:50:59] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6296082231274990066.kers
Total runtime 1 ms.
[2026-05-25 09:50:59] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 09:50:59] [INFO ] Invariant cache hit.
[2026-05-25 09:51:00] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-25 09:51:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 253 constraints, problems are : Problem set: 0 solved, 212 unsolved in 26369 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 213/434 variables, 221/254 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 212/466 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 9/475 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 485 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 56416ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 56416ms
Starting structural reductions in LTL mode, iteration 1 : 221/257 places, 213/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56751 ms. Remains : 221/257 places, 213/249 transitions.
[2026-05-25 09:51:56] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:51:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:51:56] [INFO ] Input system was already deterministic with 213 transitions.
[2026-05-25 09:51:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:51:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:51:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10250175889827013755.gal : 2 ms
[2026-05-25 09:51:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14894954716123694128.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/CTLFireability10250175889827013755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14894954716123694128.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.37107e+17,2.27085,60008,2,10303,5,243349,6,0,1099,324949,0


Converting to forward existential form...Done !
original formula: AX(E(AF((p7==1)) U EF(EX((p69==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((p7==1)))) U E(TRUE U EX((p69==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t136, t139, t143, t1...349
Detected timeout of ITS tools.
[2026-05-25 09:52:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:52:26] [INFO ] Applying decomposition
[2026-05-25 09:52:26] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7077645360306066705.txt' '-o' '/tmp/graph7077645360306066705.bin' '-w' '/tmp/graph7077645360306066705.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7077645360306066705.bin' '-l' '-1' '-v' '-w' '/tmp/graph7077645360306066705.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:52:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:52:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:52:26] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-25 09:52:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:52:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:52:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11963625626421109931.gal : 2 ms
[2026-05-25 09:52:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6504169795828750422.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/CTLFireability11963625626421109931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6504169795828750422.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37107e+17,0.240155,14520,1979,25,24634,238,501,24806,43,589,0


Converting to forward existential form...Done !
original formula: AX(E(AF((i2.i0.u2.p7==1)) U EF(EX((i5.i0.u20.p69==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!((i2.i0.u2.p7==1)))) U E(TRUE U EX((i5.i0.u20.p69==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t28, t170, t171, t172, t174, t175, t176, t180, t181, t182, t192, t195, t200, t203, t208,...488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 226
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 222 transition count 214
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 222 transition count 214
Applied a total of 70 rules in 6 ms. Remains 222 /257 variables (removed 35) and now considering 214/249 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8729510297438864180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8632239933836519488.kers'
[2026-05-25 09:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8729510297438864180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8632239933836519488.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 222 cols 532 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-25 09:52:56] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8632239933836519488.kers
Total runtime 3 ms.
[2026-05-25 09:52:56] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:52:56] [INFO ] Invariant cache hit.
[2026-05-25 09:52:57] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-25 09:52:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/436 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 258 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/257 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 213/470 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 7/477 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 486 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 222/257 places, 214/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60350 ms. Remains : 222/257 places, 214/249 transitions.
[2026-05-25 09:53:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:53:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:53:57] [INFO ] Input system was already deterministic with 214 transitions.
[2026-05-25 09:53:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:53:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:53:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8068461504577063382.gal : 1 ms
[2026-05-25 09:53:57] [INFO ] Time to serialize properties into /tmp/CTLFireability6299161159308389131.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/CTLFireability8068461504577063382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6299161159308389131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43894e+17,1.85324,64844,2,11256,5,259356,6,0,1104,356523,0


Converting to forward existential form...Done !
original formula: AF(!(A(((AG(((p177==1)&&(p197==1))) + (p126==1)) * (A((p52==1) U ((p266==1)&&(p293==1))) + EG((p251==1)))) U AF(AX(((p19==1)&&(p21==1))))...158
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!(!(EX(!(((p19==1)&&(p21==1))))))))) U (!(((!(E(TRUE U !(((p177==1)&&(p197==1))))) + ...409
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t104, t108, t109, t129, t144, t1...355
(forward)formula 0,1,17.5496,489140,1,0,409,2.44471e+06,475,210,6297,3.04043e+06,490
FORMULA MedleyA-PT-21-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 : 257/257 places, 249/249 transitions.
Graph (trivial) has 182 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 251 transition count 187
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 195 transition count 187
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 113 place count 195 transition count 150
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 158 transition count 150
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 208 place count 137 transition count 129
Iterating global reduction 2 with 21 rules applied. Total rules applied 229 place count 137 transition count 129
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 229 place count 137 transition count 119
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 249 place count 127 transition count 119
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 291 place count 106 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 292 place count 105 transition count 97
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 47 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 294 place count 103 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 296 place count 102 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 296 place count 102 transition count 95
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 298 place count 101 transition count 95
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 4 with 8 rules applied. Total rules applied 306 place count 97 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 97 transition count 90
Applied a total of 307 rules in 18 ms. Remains 97 /257 variables (removed 160) and now considering 90/249 (removed 159) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11802708040162422674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12565599557242494840.kers'
[2026-05-25 09:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11802708040162422674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12565599557242494840.kers]
Normalized transition count is 89 out of 90 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 89 rows 96 cols 251 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-25 09:54:14] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12565599557242494840.kers
Total runtime 1 ms.
[2026-05-25 09:54:14] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 09:54:14] [INFO ] Invariant cache hit.
[2026-05-25 09:54:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-25 09:54:15] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-25 09:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 11/97 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 89/186 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/187 variables, and 121 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3354 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 11/97 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 89/186 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 68/189 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/187 variables, and 190 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3848 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7220ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 7220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 97/257 places, 90/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7430 ms. Remains : 97/257 places, 90/249 transitions.
[2026-05-25 09:54:22] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:54:22] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:54:22] [INFO ] Input system was already deterministic with 90 transitions.
[2026-05-25 09:54:22] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:54:22] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1570819118789082953.gal : 1 ms
[2026-05-25 09:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability3667163593801876887.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/CTLFireability1570819118789082953.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3667163593801876887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29849e+11,0.115842,7884,2,428,5,19106,5,0,478,23183,0


Converting to forward existential form...Done !
original formula: AG(E(((p23==1)||((p65==1)&&(p300==1))) U AF(((p303==1)||(p131==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p23==1)||((p65==1)&&(p300==1))) U !(EG(!(((p303==1)||(p131==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t14, t34, t37, t41, t43, t77, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,0,10.362,336268,1,0,388,1.64173e+06,206,193,2770,2.94145e+06,432
FORMULA MedleyA-PT-21-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 185 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 251 transition count 186
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 194 transition count 186
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 115 place count 194 transition count 149
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 189 place count 157 transition count 149
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 210 place count 136 transition count 128
Iterating global reduction 2 with 21 rules applied. Total rules applied 231 place count 136 transition count 128
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 231 place count 136 transition count 118
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 251 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 297 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 304 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 310 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 312 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 312 place count 94 transition count 85
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 314 place count 93 transition count 85
Applied a total of 314 rules in 48 ms. Remains 93 /257 variables (removed 164) and now considering 85/249 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18293683734789988385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15580054320560081704.kers'
[2026-05-25 09:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18293683734789988385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15580054320560081704.kers]
Normalized transition count is 84 out of 85 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 92 cols 238 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 09:54:32] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15580054320560081704.kers
Total runtime 0 ms.
[2026-05-25 09:54:32] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:54:32] [INFO ] Invariant cache hit.
[2026-05-25 09:54:32] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-25 09:54:32] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-25 09:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 114 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1810 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 13/93 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 84/177 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 57/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 171 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3304ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3304ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/257 places, 85/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3541 ms. Remains : 93/257 places, 85/249 transitions.
[2026-05-25 09:54:36] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:54:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:54:36] [INFO ] Input system was already deterministic with 85 transitions.
[2026-05-25 09:54:36] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 827 steps (23 resets) in 9 ms. (82 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 09:54:36] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:54:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17700910908539850481.gal : 1 ms
[2026-05-25 09:54:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16326567404848631344.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17700910908539850481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16326567404848631344.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 233 transition count 225
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 233 transition count 225
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 220 transition count 212
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 220 transition count 212
Applied a total of 74 rules in 5 ms. Remains 220 /257 variables (removed 37) and now considering 212/249 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2869895427705975070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10337255243896352783.kers'
[2026-05-25 09:54:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2869895427705975070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10337255243896352783.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 220 cols 528 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-25 09:54:36] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10337255243896352783.kers
Total runtime 1 ms.
[2026-05-25 09:54:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:54:36] [INFO ] Invariant cache hit.
[2026-05-25 09:54:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:54:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 255 constraints, problems are : Problem set: 0 solved, 211 unsolved in 19307 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 211/466 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
SMT process timed out in 49335ms, After SMT, problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 49336ms
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49551 ms. Remains : 220/257 places, 212/249 transitions.
[2026-05-25 09:55:25] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:55:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:55:25] [INFO ] Input system was already deterministic with 212 transitions.
[2026-05-25 09:55:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:55:25] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:55:25] [INFO ] Time to serialize gal into /tmp/CTLFireability10902132365374975153.gal : 1 ms
[2026-05-25 09:55:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16553279455653012960.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/CTLFireability10902132365374975153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16553279455653012960.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.31918e+17,1.63596,55288,2,10280,5,224657,6,0,1094,295065,0


Converting to forward existential form...Done !
original formula: (AF((p166==1)) + AX((p139==1)))
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!((p166==1))))))) * !((p139==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t152, t169, t1...343
(forward)formula 0,0,11.0159,306776,1,0,381,1.54667e+06,449,195,5949,1.62311e+06,450
FORMULA MedleyA-PT-21-CTLFireability-2024-12 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 : 257/257 places, 249/249 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 240 transition count 232
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 240 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 231 transition count 223
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 231 transition count 223
Applied a total of 52 rules in 5 ms. Remains 231 /257 variables (removed 26) and now considering 223/249 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9426629948011913352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7754438544159632807.kers'
[2026-05-25 09:55:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9426629948011913352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7754438544159632807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 231 cols 550 entries
Finished phase 1 with 211 SingleSign rule and 0 generalized
[2026-05-25 09:55:37] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7754438544159632807.kers
Total runtime 1 ms.
[2026-05-25 09:55:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 09:55:37] [INFO ] Invariant cache hit.
[2026-05-25 09:55:37] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 09:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/454 variables, 231/267 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/454 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 268 constraints, problems are : Problem set: 0 solved, 222 unsolved in 23682 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/454 variables, 231/269 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 222/491 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 509 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 53713ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 53714ms
Starting structural reductions in LTL mode, iteration 1 : 231/257 places, 223/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53977 ms. Remains : 231/257 places, 223/249 transitions.
[2026-05-25 09:56:31] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:56:31] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:56:31] [INFO ] Input system was already deterministic with 223 transitions.
[2026-05-25 09:56:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:56:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:56:31] [INFO ] Time to serialize gal into /tmp/CTLFireability714859446544994291.gal : 2 ms
[2026-05-25 09:56:31] [INFO ] Time to serialize properties into /tmp/CTLFireability4518637149831808027.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/CTLFireability714859446544994291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4518637149831808027.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,2.64211e+17,6.07134,164576,2,22275,5,633939,6,0,1149,977122,0


Converting to forward existential form...Done !
original formula: E(AF(EX(((p277==1)&&(p200==1)))) U ((AF((EX(EF((p297==1))) * A((p291!=1) U E(((p259==1)&&(p298==1)) U (p221==1))))) + (p24==1)) + ((!(((p...290
=> equivalent forward existential formula: (([(FwdU(Init,!(EG(!(EX(((p277==1)&&(p200==1))))))) * !(EG(!((EX(E(TRUE U (p297==1))) * !((E(!(E(((p259==1)&&(p2...583
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t11, t13, t20, t29, t30, t37, t52, t59, t63, t64, t68, t71, t74, t87, t9...384
Detected timeout of ITS tools.
[2026-05-25 09:57:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:57:01] [INFO ] Applying decomposition
[2026-05-25 09:57:01] [INFO ] Flatten gal took : 3 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/graph9920900231204254515.txt' '-o' '/tmp/graph9920900231204254515.bin' '-w' '/tmp/graph9920900231204254515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9920900231204254515.bin' '-l' '-1' '-v' '-w' '/tmp/graph9920900231204254515.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:57:01] [INFO ] Decomposing Gal with order
[2026-05-25 09:57:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:57:01] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-25 09:57:01] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:57:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17702449088070588786.gal : 2 ms
[2026-05-25 09:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2992248628953053439.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/CTLFireability17702449088070588786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2992248628953053439.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.64211e+17,3.84724,126728,4330,34,273492,380,562,349463,57,1262,0


Converting to forward existential form...Done !
original formula: E(AF(EX(((i14.u87.p277==1)&&(i10.u63.p200==1)))) U ((AF((EX(EF((i13.u90.p297==1))) * A((i11.i1.u89.p291!=1) U E(((i13.u83.p259==1)&&(i4.i...453
=> equivalent forward existential formula: (([(FwdU(Init,!(EG(!(EX(((i14.u87.p277==1)&&(i10.u63.p200==1))))))) * !(EG(!((EX(E(TRUE U (i13.u90.p297==1))) * ...836
Reverse transition relation is NOT exact ! Due to transitions t10, t29, t181, t182, t184, t186, t190, t191, t205, t210, t213, t218, i1.u10.t161, i2.t151, i...570
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Graph (trivial) has 184 edges and 257 vertex of which 6 / 257 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 251 transition count 187
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 195 transition count 187
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 113 place count 195 transition count 150
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 158 transition count 150
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 209 place count 136 transition count 128
Iterating global reduction 2 with 22 rules applied. Total rules applied 231 place count 136 transition count 128
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 231 place count 136 transition count 118
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 251 place count 126 transition count 118
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 295 place count 104 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 296 place count 103 transition count 95
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 49 edges and 102 vertex of which 5 / 102 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 99 transition count 95
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 302 place count 98 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 308 place count 95 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 310 place count 95 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 310 place count 95 transition count 86
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 312 place count 94 transition count 86
Applied a total of 312 rules in 15 ms. Remains 94 /257 variables (removed 163) and now considering 86/249 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12798716446350193767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2922117748982974763.kers'
[2026-05-25 09:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12798716446350193767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2922117748982974763.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 93 cols 240 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-25 09:57:31] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2922117748982974763.kers
Total runtime 0 ms.
[2026-05-25 09:57:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:57:31] [INFO ] Invariant cache hit.
[2026-05-25 09:57:31] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-25 09:57:31] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-25 09:57:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 13/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/180 variables, and 115 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 13/94 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 85/179 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 58/173 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/180 variables, and 173 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4964ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4964ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/257 places, 86/249 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5171 ms. Remains : 94/257 places, 86/249 transitions.
[2026-05-25 09:57:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:57:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:57:36] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-25 09:57:36] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:57:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:57:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16976055118003451043.gal : 1 ms
[2026-05-25 09:57:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3551702538240072271.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/ReachabilityCardinality16976055118003451043.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3551702538240072271.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 1679 steps (48 resets) in 11 ms. (139 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 249/249 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 233 transition count 225
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 233 transition count 225
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 220 transition count 212
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 220 transition count 212
Applied a total of 74 rules in 5 ms. Remains 220 /257 variables (removed 37) and now considering 212/249 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3056985022145571773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3337289339855682618.kers'
[2026-05-25 09:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3056985022145571773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3337289339855682618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 220 cols 528 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-25 09:57:36] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3337289339855682618.kers
Total runtime 1 ms.
[2026-05-25 09:57:36] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 09:57:36] [INFO ] Invariant cache hit.
[2026-05-25 09:57:36] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-25 09:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 255 constraints, problems are : Problem set: 0 solved, 211 unsolved in 28511 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/432 variables, 220/255 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 211/466 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 479 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58554ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 58555ms
Starting structural reductions in LTL mode, iteration 1 : 220/257 places, 212/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58829 ms. Remains : 220/257 places, 212/249 transitions.
[2026-05-25 09:58:35] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:58:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:58:35] [INFO ] Input system was already deterministic with 212 transitions.
[2026-05-25 09:58:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:58:35] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7960777583364182838.gal : 0 ms
[2026-05-25 09:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4026522242930532541.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/CTLFireability7960777583364182838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4026522242930532541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31918e+17,1.4197,55312,2,10280,5,224657,6,0,1094,295065,0


Converting to forward existential form...Done !
original formula: E(AX(EG(EF(AG((p83==1))))) U AG(((!((p210==1)&&(p238==1)))||(p157==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(EG(E(TRUE U !(E(TRUE U !((p83==1)))))))))) * !(E(TRUE U !(((!((p210==1)&&(p238==1)))||(p157==...172
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t10, t19, t28, t29, t36, t51, t61, t82, t97, t107, t127, t142, t152, t169, t1...343
Detected timeout of ITS tools.
[2026-05-25 09:59:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:59:05] [INFO ] Applying decomposition
[2026-05-25 09:59:05] [INFO ] Flatten gal took : 4 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/graph9869366736986660406.txt' '-o' '/tmp/graph9869366736986660406.bin' '-w' '/tmp/graph9869366736986660406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9869366736986660406.bin' '-l' '-1' '-v' '-w' '/tmp/graph9869366736986660406.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:59:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:59:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:59:05] [INFO ] Removed a total of 34 redundant transitions.
[2026-05-25 09:59:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:59:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:59:05] [INFO ] Time to serialize gal into /tmp/CTLFireability1862443425423009374.gal : 13 ms
[2026-05-25 09:59:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17925160636357777293.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/CTLFireability1862443425423009374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17925160636357777293.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31918e+17,0.193387,11312,1300,38,16274,346,480,18001,59,812,0


Converting to forward existential form...Done !
original formula: E(AX(EG(EF(AG((i5.i1.u25.p83==1))))) U AG(((!((i12.u64.p210==1)&&(i12.u73.p238==1)))||(i8.u48.p157==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(EG(E(TRUE U !(E(TRUE U !((i5.i1.u25.p83==1)))))))))) * !(E(TRUE U !(((!((i12.u64.p210==1)&&(i...205
Reverse transition relation is NOT exact ! Due to transitions t28, t169, t170, t171, t173, t174, t175, t179, t180, t181, t191, t194, t199, t202, t207, t210...453
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,8.63387,234648,1,0,442574,461,2816,841443,272,1015,717742
FORMULA MedleyA-PT-21-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:59:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:59:14] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:59:14] [INFO ] Applying decomposition
[2026-05-25 09:59:14] [INFO ] Flatten gal took : 2 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/graph16051707313779222036.txt' '-o' '/tmp/graph16051707313779222036.bin' '-w' '/tmp/graph16051707313779222036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16051707313779222036.bin' '-l' '-1' '-v' '-w' '/tmp/graph16051707313779222036.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:59:14] [INFO ] Decomposing Gal with order
[2026-05-25 09:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:59:14] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-25 09:59:14] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:59:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7758952564146322665.gal : 3 ms
[2026-05-25 09:59:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12339213419715031928.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/CTLFireability7758952564146322665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12339213419715031928.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.45425e+17,1.7016,53376,2977,39,96665,277,634,164920,56,864,0


Converting to forward existential form...Done !
original formula: EG(AX((EG((i9.u67.p205==1)) + EG((i6.i0.u48.p139==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((EG((i9.u67.p205==1)) + EG((i6.i0.u48.p139==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t34, t206, t207, t208, t210, t211, t212, t216, t217, t231, t239, t245, i0.t204, i0.t197,...845
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
[2026-05-25 10:25:01] [INFO ] Applying decomposition
[2026-05-25 10:25:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:25:01] [INFO ] Decomposing Gal with order
[2026-05-25 10:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:25:01] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-25 10:25:01] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:25:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 6 ms.
[2026-05-25 10:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability7330219848248271400.gal : 2 ms
[2026-05-25 10:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14772034678742812289.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/CTLFireability7330219848248271400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14772034678742812289.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.45425e+17,20.7805,514724,3862,1950,542208,14293,428,4.63219e+06,254,177594,0


Converting to forward existential form...Done !
original formula: EG(AX((EG((i0.i0.i0.i0.i1.i1.i0.u30.p205==1)) + EG((i0.i0.i0.i0.i0.i1.i1.i0.u22.p139==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((EG((i0.i0.i0.i0.i1.i1.i0.u30.p205==1)) + EG((i0.i0.i0.i0.i0.i1.i1.i0.u22.p139==0)))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t207, t212, u38.t6, i0.t218, i0.i0.u34.t22, i0.i0.u34.t26, i0.i0.u34.t29, i0.i0.u34.t30, i0.i...1657
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r178-oct2-177969020000258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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