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-177969019900170.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 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 107K 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-10-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699646797

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:00:48] [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:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:00:48] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-25 09:00:48] [INFO ] Transformed 149 places.
[2026-05-25 09:00:48] [INFO ] Transformed 340 transitions.
[2026-05-25 09:00:48] [INFO ] Found NUPN structural information;
[2026-05-25 09:00:48] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 64 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 122 transition count 312
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 122 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 122 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 119 transition count 307
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 119 transition count 307
Applied a total of 59 rules in 34 ms. Remains 119 /149 variables (removed 30) and now considering 307/340 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2881891061797093724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16148560418904044463.kers'
[2026-05-25 09:00:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2881891061797093724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16148560418904044463.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 119 cols 1647 entries
Finished phase 1 with 105 SingleSign rule and 4 generalized
[2026-05-25 09:00:48] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16148560418904044463.kers
Total runtime 2 ms.
[2026-05-25 09:00:49] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-25 09:00:49] [INFO ] Invariant cache hit.
[2026-05-25 09:00:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-25 09:00:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 12/22 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 307/426 variables, 119/141 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 2/143 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/144 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/146 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 3/149 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/149 constraints. Problems are: Problem set: 64 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 150 constraints, problems are : Problem set: 64 solved, 242 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 64 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 18/28 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/28 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 307/426 variables, 119/147 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 242/389 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/390 constraints. Problems are: Problem set: 64 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/392 constraints. Problems are: Problem set: 64 solved, 242 unsolved
SMT process timed out in 60446ms, After SMT, problems are : Problem set: 64 solved, 242 unsolved
Search for dead transitions found 64 dead transitions in 60463ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/149 places, 243/340 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61061 ms. Remains : 119/149 places, 243/340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3568093821730237912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5590825802232442701.kers'
[2026-05-25 09:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3568093821730237912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5590825802232442701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 119 cols 1135 entries
Finished phase 1 with 105 SingleSign rule and 4 generalized
[2026-05-25 09:01:49] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5590825802232442701.kers
Total runtime 11 ms.
[2026-05-25 09:01:49] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 09:01:49] [INFO ] Invariant cache hit.
[2026-05-25 09:01:50] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-25 09:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 243/362 variables, 119/142 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 149 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 243/362 variables, 119/148 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 242/390 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 242 unsolved
SMT process timed out in 60124ms, After SMT, problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60455 ms. Remains : 119/119 places, 243/243 transitions.
Support contains 64 out of 119 places after structural reductions.
[2026-05-25 09:02:50] [INFO ] Flatten gal took : 53 ms
[2026-05-25 09:02:50] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:02:50] [INFO ] Input system was already deterministic with 243 transitions.
RANDOM walk for 40000 steps (1750 resets) in 1940 ms. (20 steps per ms) remains 46/72 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (37 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (39 resets) in 47 ms. (83 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (38 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (45 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (41 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (35 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (35 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (39 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (38 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (42 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (39 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (44 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (43 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (40 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (39 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (40 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (39 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
[2026-05-25 09:02:51] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 45 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/102 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 11 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 35 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 4 (OVERLAPS) 7/109 variables, 4/11 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 239/348 variables, 109/120 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/121 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/121 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 13/361 variables, 9/130 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/130 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 1/362 variables, 1/131 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/131 constraints. Problems are: Problem set: 16 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/131 constraints. Problems are: Problem set: 16 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 131 constraints, problems are : Problem set: 16 solved, 30 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 16 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 30 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/98 variables, 6/6 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/7 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/9 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/11 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 6/104 variables, 3/14 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/15 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 234/338 variables, 104/119 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 14/133 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 1/134 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/134 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 15/353 variables, 10/144 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 1/145 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 14/159 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 1/160 constraints. Problems are: Problem set: 18 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/353 variables, 1/161 constraints. Problems are: Problem set: 18 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/362 variables, and 161 constraints, problems are : Problem set: 18 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/119 constraints, PredecessorRefiner: 28/45 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7965ms problems are : Problem set: 18 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 243/243 transitions.
Graph (complete) has 454 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 118 transition count 235
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 112 transition count 234
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 111 transition count 233
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 111 transition count 230
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 108 transition count 230
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 36 place count 95 transition count 214
Iterating global reduction 3 with 13 rules applied. Total rules applied 49 place count 95 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 95 transition count 213
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 53 place count 92 transition count 207
Iterating global reduction 4 with 3 rules applied. Total rules applied 56 place count 92 transition count 207
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 71 place count 84 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 83 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 83 transition count 199
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 77 transition count 259
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 101 place count 77 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 143 place count 77 transition count 201
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 77 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 147 place count 75 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 75 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 149 place count 74 transition count 198
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 74 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 73 transition count 197
Applied a total of 151 rules in 101 ms. Remains 73 /119 variables (removed 46) and now considering 197/243 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 73/119 places, 197/243 transitions.
RANDOM walk for 40000 steps (3347 resets) in 434 ms. (91 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40004 steps (680 resets) in 163 ms. (243 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (445 resets) in 123 ms. (322 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (616 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (312 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (673 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (557 resets) in 58 ms. (678 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (665 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (654 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (544 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (384 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (384 resets) in 39 ms. (1000 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (643 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6179006362077793271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2045741684998204396.kers'
[2026-05-25 09:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6179006362077793271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2045741684998204396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 73 cols 1079 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-25 09:03:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2045741684998204396.kers
Total runtime 1 ms.
[2026-05-25 09:03:00] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 41/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 5/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 197/269 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 1/270 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 92 constraints, problems are : Problem set: 0 solved, 11 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 41/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 5/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 5/72 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 197/269 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/270 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/270 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 106 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7892 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8611ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 4720 steps, including 189 resets, run visited all 4 properties in 109 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 1042 ms.
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-10-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:03:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 09:03:09] [INFO ] Flatten gal took : 22 ms
FORMULA MedleyA-PT-10-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:03:09] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:03:09] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 51 out of 119 places (down from 52) after GAL structural reductions.
Computed a total of 11 stabilizing places and 12 stable transitions
Graph (complete) has 454 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 101 transition count 222
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 101 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 101 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 97 transition count 209
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 97 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 95 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 95 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 94 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 94 transition count 201
Applied a total of 52 rules in 9 ms. Remains 94 /119 variables (removed 25) and now considering 201/243 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12475725579470086844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11871076705482344505.kers'
[2026-05-25 09:03:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12475725579470086844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11871076705482344505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 94 cols 1009 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:03:09] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11871076705482344505.kers
Total runtime 2 ms.
[2026-05-25 09:03:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:03:10] [INFO ] Invariant cache hit.
[2026-05-25 09:03:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-25 09:03:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/295 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 117 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17356 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/295 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 200/315 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 318 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47448ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 47448ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 201/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47640 ms. Remains : 94/119 places, 201/243 transitions.
[2026-05-25 09:03:57] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:03:57] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:03:57] [INFO ] Input system was already deterministic with 201 transitions.
[2026-05-25 09:03:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:03:57] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13904488003250028371.gal : 6 ms
[2026-05-25 09:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability2431458711281492428.ctl : 7 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/CTLFireability13904488003250028371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2431458711281492428.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.79124e+07,2.07314,70060,2,5538,5,178503,6,0,577,286796,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(((AX(FALSE) + (p46==0)) + ((p79==0)||((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1)))&&((p28==1)&&(p42==1))))))))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(((!(EX(!(FALSE))) + (p46==0)) + ((p79==0)||((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1)))&&((p...187
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...494
Detected timeout of ITS tools.
[2026-05-25 09:04:27] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:04:27] [INFO ] Applying decomposition
[2026-05-25 09:04:27] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6435712508914488255.txt' '-o' '/tmp/graph6435712508914488255.bin' '-w' '/tmp/graph6435712508914488255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6435712508914488255.bin' '-l' '-1' '-v' '-w' '/tmp/graph6435712508914488255.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:04:27] [INFO ] Decomposing Gal with order
[2026-05-25 09:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:04:28] [INFO ] Removed a total of 407 redundant transitions.
[2026-05-25 09:04:28] [INFO ] Flatten gal took : 80 ms
[2026-05-25 09:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 10 ms.
[2026-05-25 09:04:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16008411921183694248.gal : 3 ms
[2026-05-25 09:04:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16530012524778663601.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/CTLFireability16008411921183694248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16530012524778663601.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.79124e+07,0.226644,12900,551,280,15145,1973,371,35125,143,13598,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(((AX(FALSE) + (i1.u9.p46==0)) + ((i6.u11.p79==0)||((((i1.u1.p21==1)&&(i3.u7.p32==1))&&((i6.u11.p82==1)&&(i6.u18.p122==1)))&&((i3...189
=> equivalent forward existential formula: [FwdG(EY(Init),EX(((!(EX(!(FALSE))) + (i1.u9.p46==0)) + ((i6.u11.p79==0)||((((i1.u1.p21==1)&&(i3.u7.p32==1))&&((...238
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t47, t81, t85, t191, t192, t193, t194, i1.u9.t46, i1.u9.t48, i1.u9.t49, i1.u9.t50, i...690
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,6.73086,196720,1,0,351550,10657,1962,754614,703,139032,634243
FORMULA MedleyA-PT-10-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 100 transition count 220
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 100 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 95 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 95 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 92 transition count 195
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 92 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 91 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 91 transition count 192
Applied a total of 58 rules in 44 ms. Remains 91 /119 variables (removed 28) and now considering 192/243 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14151148296909871802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1795131406841260285.kers'
[2026-05-25 09:04:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14151148296909871802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1795131406841260285.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 91 cols 971 entries
Finished phase 1 with 77 SingleSign rule and 4 generalized
[2026-05-25 09:04:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1795131406841260285.kers
Total runtime 1 ms.
[2026-05-25 09:04:35] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:04:35] [INFO ] Invariant cache hit.
[2026-05-25 09:04:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-25 09:04:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/283 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 110 constraints, problems are : Problem set: 0 solved, 191 unsolved in 20474 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/283 variables, 91/108 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 191/299 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 305 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50575ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 50576ms
Starting structural reductions in LTL mode, iteration 1 : 91/119 places, 192/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50872 ms. Remains : 91/119 places, 192/243 transitions.
[2026-05-25 09:05:25] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:05:25] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:05:25] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-25 09:05:25] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:05:25] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:05:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15160408847276031328.gal : 3 ms
[2026-05-25 09:05:25] [INFO ] Time to serialize properties into /tmp/CTLFireability568271331257878744.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/CTLFireability15160408847276031328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability568271331257878744.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.36187e+07,1.80254,57300,2,5824,5,156612,6,0,556,232719,0


Converting to forward existential form...Done !
original formula: AF((AG(((p140==0)&&(((p21==0)||(p28==0))||(p52==0)))) * AX(!(E((p78==1) U (p111==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((p140==0)&&(((p21==0)||(p28==0))||(p52==0)))))) * !(EX(!(!(E((p78==1) U (p111==1))))...169
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t28, t30, t31, t34, ...465
Detected timeout of ITS tools.
[2026-05-25 09:05:55] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:05:55] [INFO ] Applying decomposition
[2026-05-25 09:05:56] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11807293232584579871.txt' '-o' '/tmp/graph11807293232584579871.bin' '-w' '/tmp/graph11807293232584579871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11807293232584579871.bin' '-l' '-1' '-v' '-w' '/tmp/graph11807293232584579871.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:05:56] [INFO ] Decomposing Gal with order
[2026-05-25 09:05:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:05:56] [INFO ] Removed a total of 381 redundant transitions.
[2026-05-25 09:05:56] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:05:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 5 ms.
[2026-05-25 09:05:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7616902382681027664.gal : 2 ms
[2026-05-25 09:05:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7499209938639909032.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/CTLFireability7616902382681027664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7499209938639909032.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.36187e+07,0.192903,12792,480,257,14444,2319,406,35654,124,14468,0


Converting to forward existential form...Done !
original formula: AF((AG(((i7.i0.u22.p140==0)&&(((i1.u2.p21==0)||(i3.u5.p28==0))||(i1.u9.p52==0)))) * AX(!(E((i6.u10.p78==1) U (i6.u18.p111==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((i7.i0.u22.p140==0)&&(((i1.u2.p21==0)||(i3.u5.p28==0))||(i1.u9.p52==0)))))) * !(EX(!...211
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t50, t78, t82, t182, t183, t184, t185, i0.u4.t74, i1.u9.t49, i1.u9.t51, i1.u9.t52, i...705
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,14.2764,407388,1,0,635778,12951,2404,1.86958e+06,685,191948,761150
FORMULA MedleyA-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 217
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 95 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 95 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 94 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 94 transition count 203
Applied a total of 52 rules in 21 ms. Remains 94 /119 variables (removed 25) and now considering 203/243 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10866154114606783659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15745350151675239096.kers'
[2026-05-25 09:06:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10866154114606783659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15745350151675239096.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 94 cols 1017 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:06:10] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15745350151675239096.kers
Total runtime 2 ms.
[2026-05-25 09:06:10] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 09:06:10] [INFO ] Invariant cache hit.
[2026-05-25 09:06:10] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-25 09:06:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/297 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 112 constraints, problems are : Problem set: 0 solved, 202 unsolved in 14011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/297 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 202/312 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 323 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44107ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 44108ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 203/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44383 ms. Remains : 94/119 places, 203/243 transitions.
[2026-05-25 09:06:54] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:06:54] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:06:54] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-25 09:06:54] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:06:54] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:06:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3308231656325000989.gal : 2 ms
[2026-05-25 09:06:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7258713731453132085.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/CTLFireability3308231656325000989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7258713731453132085.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.69605e+07,1.70435,57716,2,6143,5,155511,6,0,579,224927,0


Converting to forward existential form...Done !
original formula: AF((((EX((E((p63==1) U (((p21==1)&&(p37==1))&&(p47==1))) + E((((p21==1)&&(p37==1))&&(p47==1)) U (((p82==1)&&(p122==1))&&((p125==1)&&(p147...277
=> equivalent forward existential formula: [FwdG(Init,!((((EX((E((p63==1) U (((p21==1)&&(p37==1))&&(p47==1))) + E((((p21==1)&&(p37==1))&&(p47==1)) U (((p82...415
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t20, t22, t23, t24, t26, t27, t29, t31, t32, t35, t36, ...489
Detected timeout of ITS tools.
[2026-05-25 09:07:25] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:07:25] [INFO ] Applying decomposition
[2026-05-25 09:07:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6042343882105483486.txt' '-o' '/tmp/graph6042343882105483486.bin' '-w' '/tmp/graph6042343882105483486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6042343882105483486.bin' '-l' '-1' '-v' '-w' '/tmp/graph6042343882105483486.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:07:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:07:25] [INFO ] Removed a total of 411 redundant transitions.
[2026-05-25 09:07:25] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2026-05-25 09:07:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9931825270471779343.gal : 16 ms
[2026-05-25 09:07:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17633764561663013190.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/CTLFireability9931825270471779343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17633764561663013190.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.69605e+07,0.238489,12636,521,294,15292,2394,428,29591,134,16337,0


Converting to forward existential form...Done !
original formula: AF((((EX((E((i0.u0.p63==1) U (((i3.u2.p21==1)&&(i2.u5.p37==1))&&(i3.u9.p47==1))) + E((((i3.u2.p21==1)&&(i2.u5.p37==1))&&(i3.u9.p47==1)) U...410
=> equivalent forward existential formula: [FwdG(Init,!((((EX((E((i0.u0.p63==1) U (((i3.u2.p21==1)&&(i2.u5.p37==1))&&(i3.u9.p47==1))) + E((((i3.u2.p21==1)&...584
Reverse transition relation is NOT exact ! Due to transitions t17, t50, t81, t87, t179, t180, t181, t182, t197, t198, t199, t200, i1.u3.t77, i2.t70, i2.t67...697
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,8.52334,281456,1,0,374077,27620,2810,1.51751e+06,743,333725,444233
FORMULA MedleyA-PT-10-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Graph (complete) has 454 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 117 transition count 228
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 104 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 30 place count 104 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 100 transition count 221
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 55 place count 83 transition count 197
Iterating global reduction 2 with 17 rules applied. Total rules applied 72 place count 83 transition count 197
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 78 transition count 181
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 78 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 75 transition count 174
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 75 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 74 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 74 transition count 171
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 114 place count 61 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 61 transition count 159
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 57 transition count 151
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 57 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 57 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 127 place count 57 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 55 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 53 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 52 transition count 142
Applied a total of 136 rules in 58 ms. Remains 52 /119 variables (removed 67) and now considering 142/243 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2727054607205695912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-166012365512548782.kers'
[2026-05-25 09:07:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2727054607205695912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-166012365512548782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 52 cols 760 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-25 09:07:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-166012365512548782.kers
Total runtime 1 ms.
[2026-05-25 09:07:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 09:07:33] [INFO ] Invariant cache hit.
[2026-05-25 09:07:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:07:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2026-05-25 09:07:33] [INFO ] Redundant transitions in 2 ms returned []
Running 133 sub problems to find dead transitions.
[2026-05-25 09:07:33] [INFO ] Invariant cache hit.
[2026-05-25 09:07:33] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/194 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 76 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4344 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 4/51 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 142/193 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 133/208 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 209 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11099 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15497ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 15497ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/119 places, 142/243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15711 ms. Remains : 52/119 places, 142/243 transitions.
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:07:49] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:07:49] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:07:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13013744061009614162.gal : 2 ms
[2026-05-25 09:07:49] [INFO ] Time to serialize properties into /tmp/CTLFireability3560440655028344278.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/CTLFireability13013744061009614162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3560440655028344278.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.09916e+06,0.133037,8988,2,547,5,21366,6,0,347,19856,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(((((p21==1)&&(p35==1))&&((p82==1)&&(p122==1)))&&((p125==1)&&(p143==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((((p21==1)&&(p35==1))&&((p82==1)&&(p122==1)))&&((p125==1)&&(p143==1)))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t8, t9, t11, t13, t18, t19, t20, t22, t23, t25, t34, t35, t36, t37, t42, t43,...380
(forward)formula 0,0,0.282007,12276,1,0,259,40562,309,83,3647,26603,321
FORMULA MedleyA-PT-10-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 101 transition count 221
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 101 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 101 transition count 219
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 97 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 97 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 94 transition count 197
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 94 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 92 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 92 transition count 191
Applied a total of 56 rules in 16 ms. Remains 92 /119 variables (removed 27) and now considering 191/243 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2087503078137687293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8834658010872851171.kers'
[2026-05-25 09:07:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2087503078137687293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8834658010872851171.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 92 cols 971 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:07:49] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8834658010872851171.kers
Total runtime 4 ms.
[2026-05-25 09:07:49] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:07:49] [INFO ] Invariant cache hit.
[2026-05-25 09:07:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-25 09:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/283 variables, 92/109 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 0/283 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 112 constraints, problems are : Problem set: 0 solved, 190 unsolved in 14414 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/283 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 190/300 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 313 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44566ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 44567ms
Starting structural reductions in LTL mode, iteration 1 : 92/119 places, 191/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44797 ms. Remains : 92/119 places, 191/243 transitions.
[2026-05-25 09:08:34] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:08:34] [INFO ] Input system was already deterministic with 191 transitions.
[2026-05-25 09:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:08:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6490511913931600304.gal : 1 ms
[2026-05-25 09:08:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1434161904781605353.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/CTLFireability6490511913931600304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1434161904781605353.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.28193e+07,1.5111,51308,2,5461,5,142648,6,0,559,207628,0


Converting to forward existential form...Done !
original formula: AF((E(EF((p124!=1)) U ((p3==1) + (((p67!=1) * EX((((p21==1)&&(p28==1))&&(p52==1)))) * AX((p29==1))))) * AX(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(Init,!((E(E(TRUE U (p124!=1)) U ((p3==1) + (((p67!=1) * EX((((p21==1)&&(p28==1))&&(p52==1)))) * !(EX(!((p2...206
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...445
Detected timeout of ITS tools.
[2026-05-25 09:09:04] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:09:04] [INFO ] Applying decomposition
[2026-05-25 09:09:04] [INFO ] Flatten gal took : 12 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/graph14351308424184120554.txt' '-o' '/tmp/graph14351308424184120554.bin' '-w' '/tmp/graph14351308424184120554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14351308424184120554.bin' '-l' '-1' '-v' '-w' '/tmp/graph14351308424184120554.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:09:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:09:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:09:04] [INFO ] Removed a total of 386 redundant transitions.
[2026-05-25 09:09:04] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:09:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 5 ms.
[2026-05-25 09:09:04] [INFO ] Time to serialize gal into /tmp/CTLFireability362106815692772902.gal : 1 ms
[2026-05-25 09:09:04] [INFO ] Time to serialize properties into /tmp/CTLFireability74414035680022390.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/CTLFireability362106815692772902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability74414035680022390.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...259
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28193e+07,0.219903,15036,662,228,16135,1840,431,60667,122,10633,0


Converting to forward existential form...Done !
original formula: AF((E(EF((i5.i1.u20.p124!=1)) U ((i0.u2.p3==1) + (((i2.u10.p67!=1) * EX((((i0.u2.p21==1)&&(i1.u5.p28==1))&&(i0.u9.p52==1)))) * AX((i1.u5....184
=> equivalent forward existential formula: [FwdG(Init,!((E(E(TRUE U (i5.i1.u20.p124!=1)) U ((i0.u2.p3==1) + (((i2.u10.p67!=1) * EX((((i0.u2.p21==1)&&(i1.u5...253
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t47, t77, t125, t177, t178, t179, t180, i0.u2.t72, i0.u2.t73, i0.u9.t46, i0.u9.t48, ...629
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,0,5.78782,185124,1,0,235737,9146,2269,1.25796e+06,625,96002,361472
FORMULA MedleyA-PT-10-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 215
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 213
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 194
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 87 transition count 181
Applied a total of 66 rules in 13 ms. Remains 87 /119 variables (removed 32) and now considering 181/243 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4856126319977108318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14685062853723359506.kers'
[2026-05-25 09:09:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4856126319977108318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14685062853723359506.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 87 cols 933 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:09:10] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14685062853723359506.kers
Total runtime 2 ms.
[2026-05-25 09:09:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:09:10] [INFO ] Invariant cache hit.
[2026-05-25 09:09:10] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-25 09:09:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 13282 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 292 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43376ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 43376ms
Starting structural reductions in LTL mode, iteration 1 : 87/119 places, 181/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43560 ms. Remains : 87/119 places, 181/243 transitions.
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:54] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12368381514754184311.gal : 2 ms
[2026-05-25 09:09:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12091012840501241295.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/CTLFireability12368381514754184311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12091012840501241295.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.07361e+07,1.02081,36288,2,4440,5,104342,6,0,529,133789,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.0249,36288,1,0,6,104342,7,1,736,133789,1
FORMULA MedleyA-PT-10-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 100 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 100 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 100 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 95 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 95 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 92 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 92 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 90 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 90 transition count 187
Applied a total of 59 rules in 5 ms. Remains 90 /119 variables (removed 29) and now considering 187/243 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11713111719525950057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11656982651678763902.kers'
[2026-05-25 09:09:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11713111719525950057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11656982651678763902.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 90 cols 945 entries
Finished phase 1 with 76 SingleSign rule and 4 generalized
[2026-05-25 09:09:55] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11656982651678763902.kers
Total runtime 1 ms.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
[2026-05-25 09:09:55] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-25 09:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/277 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 13956 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/277 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 186/291 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 294 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44091ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 44091ms
Starting structural reductions in LTL mode, iteration 1 : 90/119 places, 187/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44380 ms. Remains : 90/119 places, 187/243 transitions.
[2026-05-25 09:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:10:39] [INFO ] Input system was already deterministic with 187 transitions.
[2026-05-25 09:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:39] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14875271819289473948.gal : 2 ms
[2026-05-25 09:10:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12419593394712833558.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/CTLFireability14875271819289473948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12419593394712833558.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.31746e+07,1.36802,50228,2,4965,5,136143,6,0,547,184381,0


Converting to forward existential form...Done !
original formula: A(A(EG(((((p21==1)&&(p61==1))&&((p125==1)&&(p141==1))) * AG((((p82==1)&&(p122==1))&&((p125==1)&&(p147==1)))))) U AG((AG((p53==1)) * AX(((...240
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(((p54==1) + E(TRUE U !(EX(!(FALSE))))))))))))) * !(E(!(!(EX(!(!(((p54==1) + E(TRUE U !...710
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...397
Detected timeout of ITS tools.
[2026-05-25 09:11:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:11:09] [INFO ] Applying decomposition
[2026-05-25 09:11:09] [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/graph14519097630321042175.txt' '-o' '/tmp/graph14519097630321042175.bin' '-w' '/tmp/graph14519097630321042175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14519097630321042175.bin' '-l' '-1' '-v' '-w' '/tmp/graph14519097630321042175.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:09] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:09] [INFO ] Removed a total of 434 redundant transitions.
[2026-05-25 09:11:09] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2026-05-25 09:11:09] [INFO ] Time to serialize gal into /tmp/CTLFireability435714893588731627.gal : 2 ms
[2026-05-25 09:11:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2950288920866158546.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/CTLFireability435714893588731627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2950288920866158546.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31746e+07,0.12527,9144,415,43,9988,280,398,18758,68,747,0


Converting to forward existential form...Done !
original formula: A(A(EG(((((i3.u3.p21==1)&&(i3.u12.p61==1))&&((i7.i0.u24.p125==1)&&(i7.i0.u28.p141==1))) * AG((((i6.u15.p82==1)&&(i6.u23.p122==1))&&((i7.i...353
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(((i3.u12.p54==1) + E(TRUE U !(EX(!(FALSE))))))))))))) * !(E(!(!(EX(!(!(((i3.u12.p54==1...915
Reverse transition relation is NOT exact ! Due to transitions t17, t46, t77, t81, i1.u5.t73, i2.t67, i2.t63, i2.t62, i2.u6.t44, i2.u6.t71, i2.u6.t72, i2.u7...601
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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
(forward)formula 0,0,3.41394,130272,1,0,197778,1301,2439,677588,320,5100,270676
FORMULA MedleyA-PT-10-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 214
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 93 transition count 195
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 93 transition count 195
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 90 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 90 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 89 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 89 transition count 185
Applied a total of 62 rules in 4 ms. Remains 89 /119 variables (removed 30) and now considering 185/243 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-430960427961794662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9473472489345170517.kers'
[2026-05-25 09:11:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-430960427961794662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9473472489345170517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 89 cols 941 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:11:13] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9473472489345170517.kers
Total runtime 2 ms.
[2026-05-25 09:11:13] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 09:11:13] [INFO ] Invariant cache hit.
[2026-05-25 09:11:13] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 09:11:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 104 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10101 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 185/274 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 184/286 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 289 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40175ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 40175ms
Starting structural reductions in LTL mode, iteration 1 : 89/119 places, 185/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40379 ms. Remains : 89/119 places, 185/243 transitions.
[2026-05-25 09:11:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:53] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:11:53] [INFO ] Input system was already deterministic with 185 transitions.
[2026-05-25 09:11:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7330949339491636474.gal : 1 ms
[2026-05-25 09:11:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1483081423358121543.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/CTLFireability7330949339491636474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1483081423358121543.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.2323e+07,1.37322,49920,2,4887,5,135316,6,0,541,183344,0


Converting to forward existential form...Done !
original formula: A((AX((p59==1)) * (p31==1)) U (!(((!(EF((((p21==1)&&(p61==1))&&((p82==1)&&(p93==1))))) + (p92==1)) + E((((p14==1)&&(p25==1))&&((p82==1)&&...302
=> equivalent forward existential formula: [((Init * !(EG(!((!(((!(E(TRUE U (((p21==1)&&(p61==1))&&((p82==1)&&(p93==1))))) + (p92==1)) + E((((p14==1)&&(p25...963
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...392
Detected timeout of ITS tools.
[2026-05-25 09:12:23] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:12:23] [INFO ] Applying decomposition
[2026-05-25 09:12:23] [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/graph1465637379622102180.txt' '-o' '/tmp/graph1465637379622102180.bin' '-w' '/tmp/graph1465637379622102180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1465637379622102180.bin' '-l' '-1' '-v' '-w' '/tmp/graph1465637379622102180.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:12:23] [INFO ] Decomposing Gal with order
[2026-05-25 09:12:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:12:23] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-25 09:12:23] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:12:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2026-05-25 09:12:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7761409364010051959.gal : 1 ms
[2026-05-25 09:12:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10397550067710979451.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/CTLFireability7761409364010051959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10397550067710979451.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.2323e+07,0.162017,12332,595,84,17060,674,404,33253,81,2087,0


Converting to forward existential form...Done !
original formula: A((AX((i2.u10.p59==1)) * (i1.u6.p31==1)) U (!(((!(EF((((i2.u2.p21==1)&&(i2.u9.p61==1))&&((i5.u13.p82==1)&&(i4.u18.p93==1))))) + (i4.u17.p...439
=> equivalent forward existential formula: [((Init * !(EG(!((!(((!(E(TRUE U (((i2.u2.p21==1)&&(i2.u9.p61==1))&&((i5.u13.p82==1)&&(i4.u18.p93==1))))) + (i4....1348
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t46, t75, t79, i1.t64, i1.t61, i1.t60, i1.u5.t44, i1.u5.t69, i1.u5.t70, i1.u6.t67, i...584
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,11.3602,381184,1,0,526741,3885,2451,2.22128e+06,383,35460,537878
FORMULA MedleyA-PT-10-CTLFireability-2024-09 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 : 119/119 places, 243/243 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 215
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 213
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 194
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 87 transition count 181
Applied a total of 66 rules in 16 ms. Remains 87 /119 variables (removed 32) and now considering 181/243 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2112897370311503715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3345230999197028110.kers'
[2026-05-25 09:12:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2112897370311503715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3345230999197028110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 87 cols 933 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:12:35] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3345230999197028110.kers
Total runtime 2 ms.
[2026-05-25 09:12:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 09:12:35] [INFO ] Invariant cache hit.
[2026-05-25 09:12:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-25 09:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 292 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42459ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 42459ms
Starting structural reductions in LTL mode, iteration 1 : 87/119 places, 181/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42708 ms. Remains : 87/119 places, 181/243 transitions.
[2026-05-25 09:13:18] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:13:18] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:13:18] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-25 09:13:18] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:18] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9023127950377598305.gal : 3 ms
[2026-05-25 09:13:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6614515646631041203.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/CTLFireability9023127950377598305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6614515646631041203.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.07361e+07,0.986273,36316,2,4440,5,104342,6,0,529,133789,0


Converting to forward existential form...Done !
original formula: A(E((p124==1) U AX(!(AF((((p75==1)&&(p86==1))&&((p125==1)&&(p147==1))))))) U ((p76==1)&&(p87==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p76==1)&&(p87==1)))))) * !(E(!(((p76==1)&&(p87==1))) U (!(E((p124==1) U !(EX(!(!(!(EG(!((((p7...245
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...367
Detected timeout of ITS tools.
[2026-05-25 09:13:48] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:13:48] [INFO ] Applying decomposition
[2026-05-25 09:13:48] [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/graph7566814234273094799.txt' '-o' '/tmp/graph7566814234273094799.bin' '-w' '/tmp/graph7566814234273094799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7566814234273094799.bin' '-l' '-1' '-v' '-w' '/tmp/graph7566814234273094799.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:48] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:48] [INFO ] Removed a total of 375 redundant transitions.
[2026-05-25 09:13:48] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 3 ms.
[2026-05-25 09:13:48] [INFO ] Time to serialize gal into /tmp/CTLFireability18421814225996652431.gal : 1 ms
[2026-05-25 09:13:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17112220085465054649.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/CTLFireability18421814225996652431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17112220085465054649.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07361e+07,0.119694,9132,442,160,9770,1097,378,17223,102,3170,0


Converting to forward existential form...Done !
original formula: A(E((i7.i0.u0.p124==1) U AX(!(AF((((i4.u12.p75==1)&&(i4.u15.p86==1))&&((i7.i1.u21.p125==1)&&(i7.i1.u26.p147==1))))))) U ((i7.i1.u21.p76==...176
=> equivalent forward existential formula: [((Init * !(EG(!(((i7.i1.u21.p76==1)&&(i4.u15.p87==1)))))) * !(E(!(((i7.i1.u21.p76==1)&&(i4.u15.p87==1))) U (!(E...339
Reverse transition relation is NOT exact ! Due to transitions t17, t46, t71, t75, i1.u4.t67, i2.t60, i2.t57, i2.t56, i2.u6.t44, i2.u6.t65, i2.u6.t66, i2.u7...552
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,9.91237,240460,1,0,330283,10172,2112,1.37734e+06,520,99850,411682
FORMULA MedleyA-PT-10-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Graph (complete) has 454 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 117 transition count 227
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 103 transition count 224
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 103 transition count 220
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 99 transition count 220
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 56 place count 83 transition count 197
Iterating global reduction 2 with 16 rules applied. Total rules applied 72 place count 83 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 79 transition count 186
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 79 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 77 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 77 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 76 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 76 transition count 178
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 114 place count 61 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 61 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 58 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 58 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 58 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 124 place count 58 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 128 place count 56 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 55 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 53 transition count 151
Applied a total of 132 rules in 29 ms. Remains 53 /119 variables (removed 66) and now considering 151/243 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11640519571425801573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17664220447538448718.kers'
[2026-05-25 09:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11640519571425801573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17664220447538448718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 53 cols 716 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-05-25 09:13:58] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17664220447538448718.kers
Total runtime 2 ms.
[2026-05-25 09:13:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:13:58] [INFO ] Invariant cache hit.
[2026-05-25 09:13:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:13:58] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2026-05-25 09:13:58] [INFO ] Redundant transitions in 6 ms returned []
Running 144 sub problems to find dead transitions.
[2026-05-25 09:13:58] [INFO ] Invariant cache hit.
[2026-05-25 09:13:58] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 3/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 2/204 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 78 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6596 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 3/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 150/202 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 143/220 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 2/204 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 222 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11848 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18523ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 18524ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/119 places, 151/243 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18763 ms. Remains : 53/119 places, 151/243 transitions.
[2026-05-25 09:14:17] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:14:17] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:14:17] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-25 09:14:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:14:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:14:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9542429748082726462.gal : 2 ms
[2026-05-25 09:14:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1212069689798726670.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/CTLFireability9542429748082726462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1212069689798726670.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,737916,0.173285,10644,2,1349,5,23916,6,0,359,24687,0


Converting to forward existential form...Done !
original formula: AG(EF(((p50==1) + (EF((((p21==1)&&(p28==1))&&(p57==1))) * EG((p80==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p50==1) + (E(TRUE U (((p21==1)&&(p28==1))&&(p57==1))) * EG((p80==0)))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t8, t9, t11, t12, t13, t14, t15, t16, t18, t19, t21, t25, t27, t47, t...347
(forward)formula 0,0,20.5241,534844,1,0,626,2.94064e+06,331,240,3755,2.42177e+06,767
FORMULA MedleyA-PT-10-CTLFireability-2024-11 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 : 119/119 places, 243/243 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 98 transition count 215
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 98 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 98 transition count 213
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 92 transition count 194
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 92 transition count 194
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 89 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 89 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 87 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 87 transition count 181
Applied a total of 66 rules in 4 ms. Remains 87 /119 variables (removed 32) and now considering 181/243 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6818224987981575955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9666806162115776002.kers'
[2026-05-25 09:14:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6818224987981575955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9666806162115776002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 87 cols 933 entries
Finished phase 1 with 73 SingleSign rule and 4 generalized
[2026-05-25 09:14:37] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9666806162115776002.kers
Total runtime 2 ms.
[2026-05-25 09:14:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:14:37] [INFO ] Invariant cache hit.
[2026-05-25 09:14:38] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2026-05-25 09:14:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 102 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12741 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 292 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42864ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 42865ms
Starting structural reductions in LTL mode, iteration 1 : 87/119 places, 181/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43084 ms. Remains : 87/119 places, 181/243 transitions.
[2026-05-25 09:15:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:15:20] [INFO ] Input system was already deterministic with 181 transitions.
[2026-05-25 09:15:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:15:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:15:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6369817767296396549.gal : 2 ms
[2026-05-25 09:15:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16152069755758521881.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/CTLFireability6369817767296396549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16152069755758521881.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.07361e+07,0.895406,36312,2,4440,5,104342,6,0,529,133789,0


Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.899337,36312,1,0,7,104342,7,1,742,133789,2
FORMULA MedleyA-PT-10-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 102 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 102 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 102 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 98 transition count 205
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 98 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 96 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 96 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 94 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 94 transition count 195
Applied a total of 52 rules in 19 ms. Remains 94 /119 variables (removed 25) and now considering 195/243 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6876067469621713011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16815749413440627534.kers'
[2026-05-25 09:15:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6876067469621713011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16815749413440627534.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 94 cols 979 entries
Finished phase 1 with 80 SingleSign rule and 4 generalized
[2026-05-25 09:15:21] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16815749413440627534.kers
Total runtime 2 ms.
[2026-05-25 09:15:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 09:15:21] [INFO ] Invariant cache hit.
[2026-05-25 09:15:22] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-25 09:15:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 113 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12853 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/289 variables, 94/111 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 194/305 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 307 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42959ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 42961ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 195/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43209 ms. Remains : 94/119 places, 195/243 transitions.
[2026-05-25 09:16:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:16:05] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:16:05] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-25 09:16:05] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:16:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:16:05] [INFO ] Time to serialize gal into /tmp/CTLFireability961429616819425744.gal : 2 ms
[2026-05-25 09:16:05] [INFO ] Time to serialize properties into /tmp/CTLFireability5070056063321386455.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/CTLFireability961429616819425744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5070056063321386455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.631e+07,4.76712,133668,2,16145,5,352123,6,0,571,657694,0


Converting to forward existential form...Done !
original formula: ((AF(EG(AG((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1)))))) * E(AX(((((p4!=1)||(p130==1))||(p77==1))&&(p45==1))) U !((EG((((p21==1)&&(p61...272
=> equivalent forward existential formula: (([FwdG(Init,!(EG(!(E(TRUE U !((((p21==1)&&(p32==1))&&((p82==1)&&(p122==1)))))))))] = FALSE * [(Init * !(E(!(EX(...395
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t11, t16, t17, t18, t19, t20, t21, t22, t23, t26, t27, t28, t29, t30, t31, t32, ...475
Detected timeout of ITS tools.
[2026-05-25 09:16:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:16:35] [INFO ] Applying decomposition
[2026-05-25 09:16:35] [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/graph15367837648597656814.txt' '-o' '/tmp/graph15367837648597656814.bin' '-w' '/tmp/graph15367837648597656814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15367837648597656814.bin' '-l' '-1' '-v' '-w' '/tmp/graph15367837648597656814.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:16:35] [INFO ] Decomposing Gal with order
[2026-05-25 09:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:16:35] [INFO ] Removed a total of 393 redundant transitions.
[2026-05-25 09:16:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2026-05-25 09:16:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6368369082448420807.gal : 1 ms
[2026-05-25 09:16:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2614718515987147364.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/CTLFireability6368369082448420807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2614718515987147364.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.631e+07,0.256897,15436,636,307,18456,2189,449,51980,121,17850,0


Converting to forward existential form...Done !
original formula: ((AF(EG(AG((((i3.u2.p21==1)&&(i2.u7.p32==1))&&((i5.u11.p82==1)&&(i5.u18.p122==1)))))) * E(AX(((((i1.u1.p4!=1)||(i7.i1.u19.p130==1))||(i5....394
=> equivalent forward existential formula: (([FwdG(Init,!(EG(!(E(TRUE U !((((i3.u2.p21==1)&&(i2.u7.p32==1))&&((i5.u11.p82==1)&&(i5.u18.p122==1)))))))))] = ...517
Reverse transition relation is NOT exact ! Due to transitions t18, t51, t80, t85, t185, t186, t187, t188, i1.u1.t78, i1.u4.t75, i2.t68, i2.t65, i2.t64, i2....734
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,7.14567,218872,1,0,371631,7940,2500,936476,660,98404,630919
FORMULA MedleyA-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 243/243 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 99 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 99 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 99 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 94 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 94 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 91 transition count 192
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 91 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 89 transition count 186
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 89 transition count 186
Applied a total of 61 rules in 4 ms. Remains 89 /119 variables (removed 30) and now considering 186/243 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16439159106517370030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1929532400242413831.kers'
[2026-05-25 09:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16439159106517370030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1929532400242413831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 89 cols 943 entries
Finished phase 1 with 75 SingleSign rule and 4 generalized
[2026-05-25 09:16:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1929532400242413831.kers
Total runtime 1 ms.
[2026-05-25 09:16:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 09:16:42] [INFO ] Invariant cache hit.
[2026-05-25 09:16:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 09:16:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 104 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10748 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/275 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 185/287 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 294 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40817ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 40817ms
Starting structural reductions in LTL mode, iteration 1 : 89/119 places, 186/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40990 ms. Remains : 89/119 places, 186/243 transitions.
[2026-05-25 09:17:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:17:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:17:23] [INFO ] Input system was already deterministic with 186 transitions.
[2026-05-25 09:17:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:17:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6039821065422127534.gal : 1 ms
[2026-05-25 09:17:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4036916751694508935.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/CTLFireability6039821065422127534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4036916751694508935.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.25783e+07,1.1514,44660,2,4974,5,125735,6,0,542,176891,0


Converting to forward existential form...Done !
original formula: AF(AX(EX((p44==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EX((p44==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t10, t15, t16, t17, t18, t19, t22, t23, t25, t27, t28, t31, t32, t34, t35, t36, t37, ...397
Detected timeout of ITS tools.
[2026-05-25 09:17:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:17:53] [INFO ] Applying decomposition
[2026-05-25 09:17:53] [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/graph6074541604125278347.txt' '-o' '/tmp/graph6074541604125278347.bin' '-w' '/tmp/graph6074541604125278347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6074541604125278347.bin' '-l' '-1' '-v' '-w' '/tmp/graph6074541604125278347.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:17:53] [INFO ] Decomposing Gal with order
[2026-05-25 09:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:17:53] [INFO ] Removed a total of 374 redundant transitions.
[2026-05-25 09:17:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:17:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 2 ms.
[2026-05-25 09:17:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2376432078665277314.gal : 1 ms
[2026-05-25 09:17:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14534890697691016556.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/CTLFireability2376432078665277314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14534890697691016556.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.25783e+07,0.128215,10164,528,210,9890,1417,407,27798,119,7403,0


Converting to forward existential form...Done !
original formula: AF(AX(EX((i1.u9.p44==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(EX((i1.u9.p44==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t46, t80, t124, i0.t65, i0.t62, i0.t61, i0.u5.t44, i0.u5.t70, i0.u5.t71, i0.u6.t68, ...613
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,6.89,204212,1,0,297200,10804,2034,1.08087e+06,589,118201,475240
FORMULA MedleyA-PT-10-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:18:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:18:00] [INFO ] Flatten gal took : 5 ms
Total runtime 1032134 ms.

BK_STOP 1779700680548

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-10"
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-10, 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-177969019900170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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