About the Execution of ITS-Tools for DES-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15778.075 | 3600000.00 | 3748495.00 | 8039.10 | ??????T????????F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700354.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DES-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 73K 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 DES-PT-05b-CTLFireability-2024-00
FORMULA_NAME DES-PT-05b-CTLFireability-2024-01
FORMULA_NAME DES-PT-05b-CTLFireability-2024-02
FORMULA_NAME DES-PT-05b-CTLFireability-2024-03
FORMULA_NAME DES-PT-05b-CTLFireability-2024-04
FORMULA_NAME DES-PT-05b-CTLFireability-2024-05
FORMULA_NAME DES-PT-05b-CTLFireability-2024-06
FORMULA_NAME DES-PT-05b-CTLFireability-2024-07
FORMULA_NAME DES-PT-05b-CTLFireability-2024-08
FORMULA_NAME DES-PT-05b-CTLFireability-2024-09
FORMULA_NAME DES-PT-05b-CTLFireability-2024-10
FORMULA_NAME DES-PT-05b-CTLFireability-2024-11
FORMULA_NAME DES-PT-05b-CTLFireability-2024-12
FORMULA_NAME DES-PT-05b-CTLFireability-2024-13
FORMULA_NAME DES-PT-05b-CTLFireability-2024-14
FORMULA_NAME DES-PT-05b-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779662083606
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 22:34:45] [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-24 22:34:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:34:46] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-24 22:34:46] [INFO ] Transformed 300 places.
[2026-05-24 22:34:46] [INFO ] Transformed 251 transitions.
[2026-05-24 22:34:46] [INFO ] Found NUPN structural information;
[2026-05-24 22:34:46] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 113 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 284 transition count 238
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 284 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 280 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 280 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 280 transition count 232
Applied a total of 39 rules in 158 ms. Remains 280 /300 variables (removed 20) and now considering 232/251 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14496532128467860647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17303779771317420596.kers'
[2026-05-24 22:34:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14496532128467860647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17303779771317420596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 280 cols 698 entries
Finished phase 1 with 161 SingleSign rule and 57 generalized
[2026-05-24 22:34:46] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17303779771317420596.kers
Total runtime 4 ms.
[2026-05-24 22:34:47] [INFO ] Implicit Places using invariants in 865 ms returned []
[2026-05-24 22:34:47] [INFO ] Invariant cache hit.
[2026-05-24 22:34:48] [INFO ] Implicit Places using invariants and state equation in 760 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1698 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 279/300 places, 232/251 transitions.
Applied a total of 0 rules in 15 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1904 ms. Remains : 279/300 places, 232/251 transitions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Applied a total of 0 rules in 12 ms. Remains 279 /279 variables (removed 0) and now considering 232/232 (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-11495558937305182406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6288527321816088676.kers'
[2026-05-24 22:34:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11495558937305182406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6288527321816088676.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 279 cols 696 entries
Finished phase 1 with 165 SingleSign rule and 53 generalized
[2026-05-24 22:34:48] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6288527321816088676.kers
Total runtime 4 ms.
[2026-05-24 22:34:48] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-24 22:34:48] [INFO ] Invariant cache hit.
[2026-05-24 22:34:49] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2026-05-24 22:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 232/511 variables, 279/340 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 15/355 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 15/380 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 380 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/279 variables, 34/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (OVERLAPS) 232/511 variables, 279/405 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 231/636 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 636 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in LTL mode , in 1 iterations and 60911 ms. Remains : 279/279 places, 232/232 transitions.
Support contains 113 out of 279 places after structural reductions.
[2026-05-24 22:35:49] [INFO ] Flatten gal took : 96 ms
[2026-05-24 22:35:49] [INFO ] Flatten gal took : 49 ms
[2026-05-24 22:35:50] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 112 out of 279 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (343 resets) in 1836 ms. (21 steps per ms) remains 8/71 properties
BEST_FIRST walk for 40004 steps (50 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (48 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (46 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (43 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (43 resets) in 152 ms. (261 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (47 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (50 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (47 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
[2026-05-24 22:35:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 82/106 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 82/188 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 68/256 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/262 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 219/481 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 23/504 variables, 13/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 13 (OVERLAPS) 3/507 variables, 2/338 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 2/509 variables, 1/339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2/511 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/511 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 340 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 82/104 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 82/186 variables, 20/36 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 7 (OVERLAPS) 69/255 variables, 25/64 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 2/66 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/66 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/261 variables, 2/68 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/68 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 217/478 variables, 261/329 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 5/334 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 4/338 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 7/345 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/345 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 19/497 variables, 11/356 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/497 variables, 1/357 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/511 variables, and 357 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 272/279 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6554ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 15 rules applied. Total rules applied 16 place count 272 transition count 212
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 259 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 258 transition count 211
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 258 transition count 201
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 248 transition count 201
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 64 place count 235 transition count 188
Iterating global reduction 3 with 13 rules applied. Total rules applied 77 place count 235 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 235 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 81 place count 235 transition count 182
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 233 transition count 182
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 92 place count 226 transition count 175
Iterating global reduction 4 with 7 rules applied. Total rules applied 99 place count 226 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 108 place count 226 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 111 place count 224 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 111 place count 224 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 115 place count 222 transition count 163
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 259 place count 150 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 149 transition count 91
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 149 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 148 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 264 place count 148 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 147 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 266 place count 146 transition count 89
Applied a total of 266 rules in 192 ms. Remains 146 /279 variables (removed 133) and now considering 89/232 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 146/279 places, 89/232 transitions.
RANDOM walk for 40000 steps (1409 resets) in 1069 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (288 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (287 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (291 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (281 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (275 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 596534 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 5
Probabilistic random walk after 596534 steps, saw 81890 distinct states, run finished after 3010 ms. (steps per millisecond=198 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10721010177817969954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-298634796306142422.kers'
[2026-05-24 22:36:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10721010177817969954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-298634796306142422.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 89 rows 141 cols 405 entries
Finished phase 1 with 42 SingleSign rule and 44 generalized
[2026-05-24 22:36:01] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-298634796306142422.kers
Total runtime 1 ms.
[2026-05-24 22:36:01] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 56/124 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/130 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/132 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/133 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 82/215 variables, 133/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/224 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 7/231 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/231 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/231 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 4/235 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/235 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/235 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 208 constraints, problems are : Problem set: 0 solved, 5 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 146/146 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 34/68 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 56/124 variables, 25/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/130 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/132 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/133 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 82/215 variables, 133/193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/215 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/215 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/215 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 9/224 variables, 6/208 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/224 variables, 2/210 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/224 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 7/231 variables, 3/213 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/231 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/231 variables, 2/216 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/231 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 4/235 variables, 4/220 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/235 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/235 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 220 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 146/146 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3891ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 1 properties in 1640 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 89/89 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 146 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 142 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 141 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 139 transition count 85
Applied a total of 12 rules in 24 ms. Remains 139 /146 variables (removed 7) and now considering 85/89 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 139/146 places, 85/89 transitions.
RANDOM walk for 40000 steps (1878 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (341 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (361 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (341 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 821092 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 3
Probabilistic random walk after 821092 steps, saw 126755 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17642841195101351861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4978837882622293362.kers'
[2026-05-24 22:36:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17642841195101351861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4978837882622293362.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 85 rows 131 cols 388 entries
Finished phase 1 with 34 SingleSign rule and 45 generalized
[2026-05-24 22:36:10] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4978837882622293362.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/59 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 52/111 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/119 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/122 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 76/198 variables, 122/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/211 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/213 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/213 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/213 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 7/220 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/220 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/220 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 4/224 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/224 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/224 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 200 constraints, problems are : Problem set: 0 solved, 3 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/59 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 52/111 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/119 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/122 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 76/198 variables, 122/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 13/211 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/211 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/213 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/213 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/213 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/213 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 7/220 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/220 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/220 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 4/224 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/224 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/224 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 204 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2001ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 976 ms.
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 85/85 transitions.
Applied a total of 0 rules in 7 ms. Remains 139 /139 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 139/139 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2026-05-24 22:36:13] [INFO ] Invariant cache hit.
[2026-05-24 22:36:13] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-24 22:36:13] [INFO ] Invariant cache hit.
[2026-05-24 22:36:13] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2026-05-24 22:36:13] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-24 22:36:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 23/45 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 85/223 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 1/224 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/224 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 204 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7670 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 85/223 variables, 138/205 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 82/287 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 15 (OVERLAPS) 1/224 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 224/224 variables, and 289 constraints, problems are : Problem set: 0 solved, 82 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37706ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 37707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38142 ms. Remains : 139/139 places, 85/85 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 139 transition count 85
Applied a total of 1 rules in 10 ms. Remains 139 /139 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14375298501482848893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-720972042609682558.kers'
[2026-05-24 22:36:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14375298501482848893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-720972042609682558.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 85 rows 131 cols 389 entries
Finished phase 1 with 34 SingleSign rule and 45 generalized
[2026-05-24 22:36:51] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-720972042609682558.kers
Total runtime 2 ms.
[2026-05-24 22:36:51] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2026-05-24 22:36:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2026-05-24 22:36:51] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-24 22:36:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-24 22:36:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2026-05-24 22:36:51] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-24 22:36:51] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-24 22:36:51] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 488 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-24 22:36:51] [INFO ] Flatten gal took : 19 ms
[2026-05-24 22:36:51] [INFO ] Flatten gal took : 21 ms
[2026-05-24 22:36:51] [INFO ] Input system was already deterministic with 232 transitions.
Support contains 101 out of 279 places (down from 102) after GAL structural reductions.
Computed a total of 79 stabilizing places and 72 stable transitions
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 265 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 265 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 265 transition count 215
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 259 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 259 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 259 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 258 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 258 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 258 transition count 202
Applied a total of 51 rules in 17 ms. Remains 258 /279 variables (removed 21) and now considering 202/232 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17708948057241664747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15457954844846017889.kers'
[2026-05-24 22:36:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17708948057241664747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15457954844846017889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 258 cols 621 entries
Finished phase 1 with 144 SingleSign rule and 53 generalized
[2026-05-24 22:36:51] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15457954844846017889.kers
Total runtime 2 ms.
[2026-05-24 22:36:52] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-24 22:36:52] [INFO ] Invariant cache hit.
[2026-05-24 22:36:52] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-24 22:36:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/460 variables, 258/319 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 362 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 202/460 variables, 258/373 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 201/574 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 20/594 constraints. Problems are: Problem set: 0 solved, 201 unsolved
SMT process timed out in 60054ms, After SMT, problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 258/279 places, 202/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60773 ms. Remains : 258/279 places, 202/232 transitions.
[2026-05-24 22:37:52] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:37:52] [INFO ] Flatten gal took : 21 ms
[2026-05-24 22:37:52] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-24 22:37:52] [INFO ] Flatten gal took : 16 ms
[2026-05-24 22:37:52] [INFO ] Flatten gal took : 16 ms
[2026-05-24 22:37:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3374469781578469140.gal : 7 ms
[2026-05-24 22:37:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15561145759279606610.ctl : 5 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/CTLFireability3374469781578469140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15561145759279606610.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.
Detected timeout of ITS tools.
[2026-05-24 22:38:22] [INFO ] Flatten gal took : 14 ms
[2026-05-24 22:38:22] [INFO ] Applying decomposition
[2026-05-24 22:38:22] [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/graph16001590288384830008.txt' '-o' '/tmp/graph16001590288384830008.bin' '-w' '/tmp/graph16001590288384830008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16001590288384830008.bin' '-l' '-1' '-v' '-w' '/tmp/graph16001590288384830008.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:38:23] [INFO ] Decomposing Gal with order
[2026-05-24 22:38:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:38:23] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-24 22:38:23] [INFO ] Flatten gal took : 145 ms
[2026-05-24 22:38:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 25 ms.
[2026-05-24 22:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12402197808583756260.gal : 16 ms
[2026-05-24 22:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4175523454831598921.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/CTLFireability12402197808583756260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4175523454831598921.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 266 transition count 219
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 266 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 266 transition count 216
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 261 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 261 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 44 place count 261 transition count 206
Applied a total of 44 rules in 11 ms. Remains 261 /279 variables (removed 18) and now considering 206/232 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3879786520887048460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9111361050424167927.kers'
[2026-05-24 22:38:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3879786520887048460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9111361050424167927.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 261 cols 629 entries
Finished phase 1 with 149 SingleSign rule and 51 generalized
[2026-05-24 22:38:53] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9111361050424167927.kers
Total runtime 2 ms.
[2026-05-24 22:38:53] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-24 22:38:53] [INFO ] Invariant cache hit.
[2026-05-24 22:38:54] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-24 22:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/261 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 206/467 variables, 261/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 10/356 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 358 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/261 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 17/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 206/467 variables, 261/391 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 205/596 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 602 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 261/279 places, 206/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60957 ms. Remains : 261/279 places, 206/232 transitions.
[2026-05-24 22:39:54] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:39:54] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:39:54] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-24 22:39:54] [INFO ] Flatten gal took : 15 ms
[2026-05-24 22:39:54] [INFO ] Flatten gal took : 16 ms
[2026-05-24 22:39:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1103038010150083794.gal : 4 ms
[2026-05-24 22:39:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5900731137952780160.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/CTLFireability1103038010150083794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5900731137952780160.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.
Detected timeout of ITS tools.
[2026-05-24 22:40:24] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:40:24] [INFO ] Applying decomposition
[2026-05-24 22:40:24] [INFO ] Flatten gal took : 10 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/graph14294674110452356621.txt' '-o' '/tmp/graph14294674110452356621.bin' '-w' '/tmp/graph14294674110452356621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14294674110452356621.bin' '-l' '-1' '-v' '-w' '/tmp/graph14294674110452356621.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:40:24] [INFO ] Decomposing Gal with order
[2026-05-24 22:40:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:40:24] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-24 22:40:24] [INFO ] Flatten gal took : 39 ms
[2026-05-24 22:40:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2026-05-24 22:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13111674989722242465.gal : 10 ms
[2026-05-24 22:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3093969621454514309.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/CTLFireability13111674989722242465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3093969621454514309.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,8.54134e+18,4.12198,97804,8531,252,237469,1585,740,175842,149,3714,0
Converting to forward existential form...Done !
original formula: ((AG(AX((i9.i1.u50.p199==0))) + EG(AG(EX((i5.i0.u23.p113==1))))) + A(E(((i11.u68.p259==1)||((((i9.i2.u45.p179==1)&&(i9.i2.u45.p181==1))&&...738
=> equivalent forward existential formula: [(EY(FwdU(((Init * !(!((E(!(((((EX(EG((i8.i3.u63.p231==1))) + ((i9.i2.u45.p180==1)&&(i9.i2.u52.p206==1))) + ((i5...1485
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t57, t88, t127, t152, t167, t200, i0.i0.u34.t80, i0.i1.u21.t99, i1.i0.u6.t133, i1.i0...814
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 263 transition count 216
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 263 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 263 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 258 transition count 208
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 258 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 258 transition count 204
Applied a total of 49 rules in 13 ms. Remains 258 /279 variables (removed 21) and now considering 204/232 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15774511790764795451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1098346971863594861.kers'
[2026-05-24 22:40:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15774511790764795451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1098346971863594861.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 258 cols 627 entries
Finished phase 1 with 144 SingleSign rule and 53 generalized
[2026-05-24 22:40:54] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1098346971863594861.kers
Total runtime 2 ms.
[2026-05-24 22:40:54] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 22:40:54] [INFO ] Invariant cache hit.
[2026-05-24 22:40:55] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 22:40:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/462 variables, 258/319 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 14/353 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 13/367 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 367 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 204/462 variables, 258/375 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 203/578 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 585 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 258/279 places, 204/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 258/279 places, 204/232 transitions.
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 14 ms
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 12 ms
[2026-05-24 22:41:55] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 12 ms
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:41:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13232686023094594826.gal : 3 ms
[2026-05-24 22:41:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6668078479290896553.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/CTLFireability13232686023094594826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6668078479290896553.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.
Detected timeout of ITS tools.
[2026-05-24 22:42:25] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:42:25] [INFO ] Applying decomposition
[2026-05-24 22:42:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13019815516369849441.txt' '-o' '/tmp/graph13019815516369849441.bin' '-w' '/tmp/graph13019815516369849441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13019815516369849441.bin' '-l' '-1' '-v' '-w' '/tmp/graph13019815516369849441.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:42:25] [INFO ] Decomposing Gal with order
[2026-05-24 22:42:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:42:25] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-24 22:42:25] [INFO ] Flatten gal took : 20 ms
[2026-05-24 22:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-24 22:42:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9084149065106755317.gal : 4 ms
[2026-05-24 22:42:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3584840333281354706.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/CTLFireability9084149065106755317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3584840333281354706.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 271 transition count 212
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 257 transition count 212
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 257 transition count 202
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 247 transition count 202
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 62 place count 234 transition count 189
Iterating global reduction 2 with 13 rules applied. Total rules applied 75 place count 234 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 234 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 79 place count 234 transition count 183
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 232 transition count 183
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 225 transition count 176
Iterating global reduction 3 with 7 rules applied. Total rules applied 97 place count 225 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 106 place count 225 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 109 place count 223 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 109 place count 223 transition count 164
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 113 place count 221 transition count 164
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 255 place count 150 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 148 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 147 transition count 91
Applied a total of 258 rules in 58 ms. Remains 147 /279 variables (removed 132) and now considering 91/232 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1541089952181596341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4492572956759535813.kers'
[2026-05-24 22:42:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1541089952181596341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4492572956759535813.kers]
Culling duplicate invariants (modulo rational): removing 25 columns.
Culled 25 columns in 0 ms.
// Phase 1: matrix 91 rows 122 cols 310 entries
Finished phase 1 with 64 SingleSign rule and 25 generalized
[2026-05-24 22:42:55] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4492572956759535813.kers
Total runtime 8 ms.
[2026-05-24 22:42:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 22:42:56] [INFO ] Invariant cache hit.
[2026-05-24 22:42:56] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2026-05-24 22:42:56] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2026-05-24 22:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 2/146 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 91/237 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 209 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8830 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 2/146 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 91/237 variables, 146/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 88/296 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 297 constraints, problems are : Problem set: 0 solved, 88 unsolved in 22570 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31415ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 31416ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/279 places, 91/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32101 ms. Remains : 147/279 places, 91/232 transitions.
[2026-05-24 22:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:43:27] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-24 22:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:43:27] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:43:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11967387937302110078.gal : 1 ms
[2026-05-24 22:43:27] [INFO ] Time to serialize properties into /tmp/CTLFireability110828573619048976.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/CTLFireability11967387937302110078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability110828573619048976.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.
Detected timeout of ITS tools.
[2026-05-24 22:43:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:43:58] [INFO ] Applying decomposition
[2026-05-24 22:43:58] [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/graph16457842957371083991.txt' '-o' '/tmp/graph16457842957371083991.bin' '-w' '/tmp/graph16457842957371083991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16457842957371083991.bin' '-l' '-1' '-v' '-w' '/tmp/graph16457842957371083991.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:43:58] [INFO ] Decomposing Gal with order
[2026-05-24 22:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:43:58] [INFO ] Removed a total of 8 redundant transitions.
[2026-05-24 22:43:58] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:43:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 22:43:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9361429893344778150.gal : 2 ms
[2026-05-24 22:43:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4102832695999347509.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/CTLFireability9361429893344778150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4102832695999347509.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,3.23957e+12,0.229258,10852,1275,191,17268,557,313,18102,104,1916,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(((u16.p7==1)&&(u16.p151==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((u16.p7==1)&&(u16.p151==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t44, t78, t81, t84, u0.t52, u16.t63, u51.t1, u51.t86, i0.t8, i0.u2.t13, i0.u2.t17, i1.t6...329
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 274 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 273 transition count 216
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 261 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 260 transition count 215
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 260 transition count 204
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 249 transition count 204
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 61 place count 237 transition count 192
Iterating global reduction 3 with 12 rules applied. Total rules applied 73 place count 237 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 77 place count 237 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 77 place count 237 transition count 186
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 235 transition count 186
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 87 place count 229 transition count 180
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 229 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 101 place count 229 transition count 172
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 104 place count 227 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 104 place count 227 transition count 169
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 108 place count 225 transition count 169
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 234 place count 162 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 160 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 159 transition count 104
Applied a total of 237 rules in 73 ms. Remains 159 /279 variables (removed 120) and now considering 104/232 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11657645816345282341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9158431560405618525.kers'
[2026-05-24 22:44:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11657645816345282341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9158431560405618525.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 157 cols 429 entries
Finished phase 1 with 56 SingleSign rule and 45 generalized
[2026-05-24 22:44:28] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9158431560405618525.kers
Total runtime 2 ms.
[2026-05-24 22:44:28] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-24 22:44:28] [INFO ] Invariant cache hit.
[2026-05-24 22:44:28] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2026-05-24 22:44:28] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-24 22:44:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 2/159 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 104/263 variables, 159/226 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 18 (OVERLAPS) 0/263 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 232 constraints, problems are : Problem set: 0 solved, 100 unsolved in 16427 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/157 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 2/159 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 104/263 variables, 159/234 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 100/334 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 337 constraints, problems are : Problem set: 0 solved, 100 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46449ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 46449ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/279 places, 104/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47080 ms. Remains : 159/279 places, 104/232 transitions.
[2026-05-24 22:45:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:15] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 22:45:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8952736689381162160.gal : 1 ms
[2026-05-24 22:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5479910578063507630.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/CTLFireability8952736689381162160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5479910578063507630.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.
Detected timeout of ITS tools.
[2026-05-24 22:45:45] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:45] [INFO ] Applying decomposition
[2026-05-24 22:45:45] [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/graph7611744862593689195.txt' '-o' '/tmp/graph7611744862593689195.bin' '-w' '/tmp/graph7611744862593689195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7611744862593689195.bin' '-l' '-1' '-v' '-w' '/tmp/graph7611744862593689195.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:45:45] [INFO ] Decomposing Gal with order
[2026-05-24 22:45:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:45:45] [INFO ] Removed a total of 14 redundant transitions.
[2026-05-24 22:45:45] [INFO ] Flatten gal took : 21 ms
[2026-05-24 22:45:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-24 22:45:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11443254123446848928.gal : 2 ms
[2026-05-24 22:45:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10496756490672168273.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/CTLFireability11443254123446848928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10496756490672168273.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.89609e+13,0.636748,17704,2227,256,32430,1332,381,37213,119,3860,0
Converting to forward existential form...Done !
original formula: A(E(EF(((i3.u9.p99==1)&&(i1.u2.p47==1))) U A((u54.p293==1) U !(((u54.p13==1)&&(u54.p292==1))))) U EG((AF(((EF(((u17.p17==1)&&(u17.p144==1...271
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!(EG(!(((E(TRUE U ((u17.p17==1)&&(u17.p144==1))) + (i11.i2.u29.p198==1)) + ((i4.u14.p119==1...1076
Reverse transition relation is NOT exact ! Due to transitions t50, t55, t56, t72, t81, t90, t94, t97, u54.t1, u54.t99, u17.t3, u17.t29, i1.t18, i1.u2.t15, ...420
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 263 transition count 216
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 263 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 263 transition count 212
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 256 transition count 205
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 256 transition count 205
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 256 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 255 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 255 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 255 transition count 197
Applied a total of 59 rules in 15 ms. Remains 255 /279 variables (removed 24) and now considering 197/232 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5465704385465574062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-365319357984781987.kers'
[2026-05-24 22:46:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5465704385465574062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-365319357984781987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 255 cols 607 entries
Finished phase 1 with 142 SingleSign rule and 52 generalized
[2026-05-24 22:46:15] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-365319357984781987.kers
Total runtime 2 ms.
[2026-05-24 22:46:15] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 22:46:15] [INFO ] Invariant cache hit.
[2026-05-24 22:46:16] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2026-05-24 22:46:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 197/452 variables, 255/340 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 18/358 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/452 variables, and 360 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 197/452 variables, 255/363 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 196/559 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 18/577 constraints. Problems are: Problem set: 0 solved, 196 unsolved
SMT process timed out in 60044ms, After SMT, problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 255/279 places, 197/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 255/279 places, 197/232 transitions.
[2026-05-24 22:47:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:47:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:47:16] [INFO ] Input system was already deterministic with 197 transitions.
[2026-05-24 22:47:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:47:16] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14774861787624661980.gal : 2 ms
[2026-05-24 22:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4368621837644555878.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/CTLFireability14774861787624661980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4368621837644555878.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.
Detected timeout of ITS tools.
[2026-05-24 22:47:46] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:47:46] [INFO ] Applying decomposition
[2026-05-24 22:47:46] [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/graph10465948801745161769.txt' '-o' '/tmp/graph10465948801745161769.bin' '-w' '/tmp/graph10465948801745161769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10465948801745161769.bin' '-l' '-1' '-v' '-w' '/tmp/graph10465948801745161769.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:47:46] [INFO ] Decomposing Gal with order
[2026-05-24 22:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:47:46] [INFO ] Removed a total of 13 redundant transitions.
[2026-05-24 22:47:46] [INFO ] Flatten gal took : 16 ms
[2026-05-24 22:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 22:47:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18016042773932767209.gal : 3 ms
[2026-05-24 22:47:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16542699396854671586.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/CTLFireability18016042773932767209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16542699396854671586.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,5.20603e+18,3.9764,87876,7196,299,247593,1938,611,178117,148,5052,0
Converting to forward existential form...Done !
original formula: E(EG(AF(!(EX((i11.u11.p70==1))))) U ((i7.u67.p267==1)&&(u74.p296==1)))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EG(!(!(EX((i11.u11.p70==1)))))))) * ((i7.u67.p267==1)&&(u74.p296==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t145, t158, t159, t191, u33.t76, u74.t17, u74.t136, i1.t121, i1.u6.t126, i1.u6....736
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 271 transition count 212
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 257 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 257 transition count 201
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 246 transition count 201
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 64 place count 233 transition count 188
Iterating global reduction 2 with 13 rules applied. Total rules applied 77 place count 233 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 233 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 233 transition count 182
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 85 place count 231 transition count 182
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 92 place count 224 transition count 175
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 224 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 108 place count 224 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 111 place count 222 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 111 place count 222 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 115 place count 220 transition count 163
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 255 place count 150 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 148 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 147 transition count 91
Applied a total of 258 rules in 42 ms. Remains 147 /279 variables (removed 132) and now considering 91/232 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4688558113617509932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3647284703845066836.kers'
[2026-05-24 22:48:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4688558113617509932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3647284703845066836.kers]
Culling duplicate invariants (modulo rational): removing 24 columns.
Culled 24 columns in 0 ms.
// Phase 1: matrix 91 rows 123 cols 308 entries
Finished phase 1 with 69 SingleSign rule and 20 generalized
[2026-05-24 22:48:16] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3647284703845066836.kers
Total runtime 3 ms.
[2026-05-24 22:48:16] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 22:48:16] [INFO ] Invariant cache hit.
[2026-05-24 22:48:17] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2026-05-24 22:48:17] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2026-05-24 22:48:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 2/146 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 91/237 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 207 constraints, problems are : Problem set: 0 solved, 87 unsolved in 9824 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 2/146 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 91/237 variables, 146/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 87/294 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 1/238 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (OVERLAPS) 0/238 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 295 constraints, problems are : Problem set: 0 solved, 87 unsolved in 25807 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35640ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 35641ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/279 places, 91/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36125 ms. Remains : 147/279 places, 91/232 transitions.
[2026-05-24 22:48:52] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:48:52] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:48:52] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-24 22:48:52] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:48:52] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:48:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10729606324816345418.gal : 1 ms
[2026-05-24 22:48:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15325734621656817346.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10729606324816345418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15325734621656817346.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 855 steps (24 resets) in 12 ms. (65 steps per ms) remains 0/1 properties
FORMULA DES-PT-05b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 263 transition count 216
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 263 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 263 transition count 213
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 256 transition count 206
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 256 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 256 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 255 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 255 transition count 198
Applied a total of 58 rules in 14 ms. Remains 255 /279 variables (removed 24) and now considering 198/232 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6034109605890019243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18443737565514376286.kers'
[2026-05-24 22:48:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6034109605890019243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18443737565514376286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 255 cols 611 entries
Finished phase 1 with 141 SingleSign rule and 53 generalized
[2026-05-24 22:48:52] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-18443737565514376286.kers
Total runtime 12 ms.
[2026-05-24 22:48:52] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 22:48:52] [INFO ] Invariant cache hit.
[2026-05-24 22:48:53] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2026-05-24 22:48:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/453 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 16/332 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/453 variables, and 351 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 35/96 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 13/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 198/453 variables, 255/367 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 197/564 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 569 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 255/279 places, 198/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60864 ms. Remains : 255/279 places, 198/232 transitions.
[2026-05-24 22:49:53] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:49:53] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:49:53] [INFO ] Input system was already deterministic with 198 transitions.
[2026-05-24 22:49:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:49:53] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:49:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9018354109028872132.gal : 3 ms
[2026-05-24 22:49:53] [INFO ] Time to serialize properties into /tmp/CTLFireability12881290739613923982.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/CTLFireability9018354109028872132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12881290739613923982.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.
Detected timeout of ITS tools.
[2026-05-24 22:50:23] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:50:23] [INFO ] Applying decomposition
[2026-05-24 22:50:23] [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/graph5667882540839593434.txt' '-o' '/tmp/graph5667882540839593434.bin' '-w' '/tmp/graph5667882540839593434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5667882540839593434.bin' '-l' '-1' '-v' '-w' '/tmp/graph5667882540839593434.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:50:23] [INFO ] Decomposing Gal with order
[2026-05-24 22:50:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:50:23] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-24 22:50:23] [INFO ] Flatten gal took : 13 ms
[2026-05-24 22:50:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2026-05-24 22:50:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13612483282503421016.gal : 4 ms
[2026-05-24 22:50:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17405338131480357071.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/CTLFireability13612483282503421016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17405338131480357071.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,4.63643e+18,1.82111,53396,3739,278,131057,2429,682,117779,135,5445,0
Converting to forward existential form...Done !
original formula: AG(((EG(((i3.i1.u14.p79==1)&&(i13.u73.p279==1))) + (i12.i2.u60.p234==1)) + AG(((AX(((i4.u28.p122==0)||(i4.u30.p132==0))) * (i13.u68.p266=...198
=> equivalent forward existential formula: (([(EY(FwdU((FwdU(Init,TRUE) * !((EG(((i3.i1.u14.p79==1)&&(i13.u73.p279==1))) + (i12.i2.u60.p234==1)))),TRUE)) *...502
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t145, t158, t159, t191, u34.t76, i0.u32.t79, i1.t121, i1.u6.t126, i1.u6.t127, i...760
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 262 transition count 215
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 262 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 262 transition count 211
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 254 transition count 203
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 254 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 254 transition count 196
Applied a total of 61 rules in 9 ms. Remains 254 /279 variables (removed 25) and now considering 196/232 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6467419853499997700.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-930489205868304781.kers'
[2026-05-24 22:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6467419853499997700.kers, --Pflows, --basisKERS=/tmp/petrispot-output-930489205868304781.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 254 cols 603 entries
Finished phase 1 with 141 SingleSign rule and 52 generalized
[2026-05-24 22:50:53] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-930489205868304781.kers
Total runtime 6 ms.
[2026-05-24 22:50:54] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 22:50:54] [INFO ] Invariant cache hit.
[2026-05-24 22:50:54] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-24 22:50:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/450 variables, 254/315 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 16/339 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 361 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 196/450 variables, 254/371 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 195/566 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 577 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 254/279 places, 196/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60875 ms. Remains : 254/279 places, 196/232 transitions.
[2026-05-24 22:51:54] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:51:54] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:51:54] [INFO ] Input system was already deterministic with 196 transitions.
[2026-05-24 22:51:54] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:51:54] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:51:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7972208004789230517.gal : 1 ms
[2026-05-24 22:51:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16781979522406574198.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/CTLFireability7972208004789230517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16781979522406574198.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.
Detected timeout of ITS tools.
[2026-05-24 22:52:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:52:24] [INFO ] Applying decomposition
[2026-05-24 22:52:24] [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/graph18261963064473892063.txt' '-o' '/tmp/graph18261963064473892063.bin' '-w' '/tmp/graph18261963064473892063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18261963064473892063.bin' '-l' '-1' '-v' '-w' '/tmp/graph18261963064473892063.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:52:24] [INFO ] Decomposing Gal with order
[2026-05-24 22:52:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:52:24] [INFO ] Removed a total of 10 redundant transitions.
[2026-05-24 22:52:24] [INFO ] Flatten gal took : 12 ms
[2026-05-24 22:52:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 22:52:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8445906851508259073.gal : 12 ms
[2026-05-24 22:52:24] [INFO ] Time to serialize properties into /tmp/CTLFireability443286182100447880.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/CTLFireability8445906851508259073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability443286182100447880.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,3.96732e+18,4.85831,103220,6826,307,241061,1956,682,233776,142,7076,0
Converting to forward existential form...Done !
original formula: AF(((i2.u9.p57==1) * ((EX((i10.u58.p231==0)) + EG(((i0.u31.p10==1)&&(i0.u31.p151==1)))) + (i6.i0.u27.p126==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((i2.u9.p57==1) * ((EX((i10.u58.p231==0)) + EG(((i0.u31.p10==1)&&(i0.u31.p151==1)))) + (i6.i0.u27.p...175
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t87, t145, t157, t158, t190, u30.t79, i0.u31.t76, i1.t121, i1.u6.t126, i1.u6.t127, i...746
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 262 transition count 215
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 262 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 262 transition count 211
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 254 transition count 203
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 254 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 253 transition count 194
Applied a total of 64 rules in 13 ms. Remains 253 /279 variables (removed 26) and now considering 194/232 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10640721031134423144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16363090110236238081.kers'
[2026-05-24 22:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10640721031134423144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16363090110236238081.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 22:52:54] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16363090110236238081.kers
Total runtime 3 ms.
[2026-05-24 22:52:55] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-24 22:52:55] [INFO ] Invariant cache hit.
[2026-05-24 22:52:55] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 22:52:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 60036ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 253/279 places, 194/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 253/279 places, 194/232 transitions.
[2026-05-24 22:53:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:53:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:53:55] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-24 22:53:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:53:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:53:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8016836918837384087.gal : 1 ms
[2026-05-24 22:53:55] [INFO ] Time to serialize properties into /tmp/CTLFireability810760618391253298.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/CTLFireability8016836918837384087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability810760618391253298.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.
Detected timeout of ITS tools.
[2026-05-24 22:54:25] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:54:25] [INFO ] Applying decomposition
[2026-05-24 22:54:25] [INFO ] Flatten gal took : 6 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/graph10307921166695277260.txt' '-o' '/tmp/graph10307921166695277260.bin' '-w' '/tmp/graph10307921166695277260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10307921166695277260.bin' '-l' '-1' '-v' '-w' '/tmp/graph10307921166695277260.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:54:25] [INFO ] Decomposing Gal with order
[2026-05-24 22:54:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:54:25] [INFO ] Removed a total of 12 redundant transitions.
[2026-05-24 22:54:25] [INFO ] Flatten gal took : 12 ms
[2026-05-24 22:54:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 22:54:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1150237430201003135.gal : 3 ms
[2026-05-24 22:54:25] [INFO ] Time to serialize properties into /tmp/CTLFireability12255844803232646099.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/CTLFireability1150237430201003135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12255844803232646099.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,3.47069e+18,2.3758,61868,4338,229,130195,2055,664,214195,130,5679,0
Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t143, t155, t156, t188, i0.u14.t109, i1.t115, i2.t119, i2.u7.t124, i2.u7.t125, ...722
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 265 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 265 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 265 transition count 215
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 258 transition count 208
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 258 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 258 transition count 202
Applied a total of 51 rules in 10 ms. Remains 258 /279 variables (removed 21) and now considering 202/232 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15558579754717299459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8687576833935320269.kers'
[2026-05-24 22:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15558579754717299459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8687576833935320269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 258 cols 619 entries
Finished phase 1 with 146 SingleSign rule and 51 generalized
[2026-05-24 22:54:55] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8687576833935320269.kers
Total runtime 3 ms.
[2026-05-24 22:54:56] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-24 22:54:56] [INFO ] Invariant cache hit.
[2026-05-24 22:54:56] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-24 22:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/460 variables, 258/319 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 15/334 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 14/368 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 369 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 202/460 variables, 258/383 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 201/584 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 585 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60038ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60039ms
Starting structural reductions in LTL mode, iteration 1 : 258/279 places, 202/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 258/279 places, 202/232 transitions.
[2026-05-24 22:55:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:55:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:55:56] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-24 22:55:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:55:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:55:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6759839620079157275.gal : 1 ms
[2026-05-24 22:55:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12858995629646875054.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/CTLFireability6759839620079157275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12858995629646875054.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.
Detected timeout of ITS tools.
[2026-05-24 22:56:26] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:56:26] [INFO ] Applying decomposition
[2026-05-24 22:56:26] [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/graph8960660686874598422.txt' '-o' '/tmp/graph8960660686874598422.bin' '-w' '/tmp/graph8960660686874598422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8960660686874598422.bin' '-l' '-1' '-v' '-w' '/tmp/graph8960660686874598422.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:56:26] [INFO ] Decomposing Gal with order
[2026-05-24 22:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:56:26] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-24 22:56:26] [INFO ] Flatten gal took : 12 ms
[2026-05-24 22:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2026-05-24 22:56:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6550738194642834037.gal : 4 ms
[2026-05-24 22:56:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3021401579364748891.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/CTLFireability6550738194642834037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3021401579364748891.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,7.50577e+18,6.11835,115460,4718,263,257955,1891,698,249184,142,4396,0
Converting to forward existential form...Done !
original formula: AG(A(AX((!(AX((i3.i0.u10.p60==1))) + ((i4.i0.u16.p81==1)&&(i4.i1.u75.p279==1)))) U E(EF((i2.u7.p44==1)) U AF(((i11.i2.u70.p266==1)||(i2.u...169
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(E(TRUE U (i2.u7.p44==1)) U !(EG(!(((i11.i2.u70.p266==1)||(i2.u7.p49==1)))))))) * !(...455
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t56, t149, t163, t164, t196, u36.t76, i0.u34.t79, i2.t124, i2.u6.t130, i2.u6.t131, i...840
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 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 271 transition count 212
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 257 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 257 transition count 201
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 246 transition count 201
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 234 transition count 189
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 234 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 234 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 79 place count 234 transition count 183
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 83 place count 232 transition count 183
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 226 transition count 177
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 226 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 103 place count 226 transition count 169
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 106 place count 224 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 106 place count 224 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 223 transition count 167
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 248 place count 153 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 152 transition count 96
Applied a total of 249 rules in 51 ms. Remains 152 /279 variables (removed 127) and now considering 96/232 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3214142519355072056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1177927315169160154.kers'
[2026-05-24 22:56:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3214142519355072056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1177927315169160154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 152 cols 424 entries
Finished phase 1 with 44 SingleSign rule and 49 generalized
[2026-05-24 22:56:56] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1177927315169160154.kers
Total runtime 1 ms.
[2026-05-24 22:56:57] [INFO ] Implicit Places using invariants in 174 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 151/279 places, 96/232 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 151/279 places, 96/232 transitions.
[2026-05-24 22:56:57] [INFO ] Flatten gal took : 15 ms
[2026-05-24 22:56:57] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:56:57] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-24 22:56:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:56:57] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability11902584011300866087.gal : 2 ms
[2026-05-24 22:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9083257852894780810.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/CTLFireability11902584011300866087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9083257852894780810.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.
Detected timeout of ITS tools.
[2026-05-24 22:57:27] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:57:27] [INFO ] Applying decomposition
[2026-05-24 22:57:27] [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/graph1752014766357526500.txt' '-o' '/tmp/graph1752014766357526500.bin' '-w' '/tmp/graph1752014766357526500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1752014766357526500.bin' '-l' '-1' '-v' '-w' '/tmp/graph1752014766357526500.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:57:27] [INFO ] Decomposing Gal with order
[2026-05-24 22:57:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:57:27] [INFO ] Removed a total of 15 redundant transitions.
[2026-05-24 22:57:27] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:57:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-24 22:57:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15612476962145582376.gal : 2 ms
[2026-05-24 22:57:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17319452848565525778.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/CTLFireability15612476962145582376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17319452848565525778.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,4.49824e+12,0.965571,31852,6241,223,77116,868,398,64810,113,2468,0
Converting to forward existential form...Done !
original formula: AF(AG(((i2.i1.u12.p30==1) * EG((i2.i1.u12.p131==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i2.i1.u12.p30==1) * EG((i2.i1.u12.p131==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t64, t66, t82, t86, t89, u15.t21, u16.t67, u51.t0, u51.t91, i0.t7, i0.u2.t12, i0.u2...347
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 263 transition count 216
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 263 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 263 transition count 212
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 255 transition count 204
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 255 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 59 place count 255 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 254 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 254 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 254 transition count 195
Applied a total of 62 rules in 12 ms. Remains 254 /279 variables (removed 25) and now considering 195/232 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13943096215999215077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12525255100461790170.kers'
[2026-05-24 22:57:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13943096215999215077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12525255100461790170.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 254 cols 601 entries
Finished phase 1 with 141 SingleSign rule and 52 generalized
[2026-05-24 22:57:57] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12525255100461790170.kers
Total runtime 1 ms.
[2026-05-24 22:57:57] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-24 22:57:57] [INFO ] Invariant cache hit.
[2026-05-24 22:57:58] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 22:57:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/449 variables, 254/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/449 variables, and 361 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 254/254 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 44/44 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/253 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/253 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/254 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 195/449 variables, 254/371 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 194/565 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 10/575 constraints. Problems are: Problem set: 0 solved, 194 unsolved
SMT process timed out in 60035ms, After SMT, problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 60036ms
Starting structural reductions in LTL mode, iteration 1 : 254/279 places, 195/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 254/279 places, 195/232 transitions.
[2026-05-24 22:58:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:58:58] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:58:58] [INFO ] Input system was already deterministic with 195 transitions.
[2026-05-24 22:58:58] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:58:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11879191872771852174.gal : 1 ms
[2026-05-24 22:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11226663636266136682.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/CTLFireability11879191872771852174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11226663636266136682.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.
Detected timeout of ITS tools.
[2026-05-24 22:59:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:59:28] [INFO ] Applying decomposition
[2026-05-24 22:59:28] [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/graph205229774329492682.txt' '-o' '/tmp/graph205229774329492682.bin' '-w' '/tmp/graph205229774329492682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph205229774329492682.bin' '-l' '-1' '-v' '-w' '/tmp/graph205229774329492682.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:59:28] [INFO ] Decomposing Gal with order
[2026-05-24 22:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:59:28] [INFO ] Removed a total of 9 redundant transitions.
[2026-05-24 22:59:28] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-24 22:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability226431074155525313.gal : 3 ms
[2026-05-24 22:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5428142172346842130.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/CTLFireability226431074155525313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5428142172346842130.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,3.61692e+18,2.91902,75100,8530,323,152574,2165,624,284275,135,5514,0
Converting to forward existential form...Done !
original formula: (EF((AX(FALSE) + EG(EX(EF((i0.u2.p4==1)))))) + (AX((AG(AF((i11.u71.p280==1))) + (i3.u7.p49==1))) * EG(AG(A(EF(((i8.i1.i1.u51.p213==1)&&(i...221
=> equivalent forward existential formula: ([FwdG(FwdU((EY((Init * !(E(TRUE U (!(EX(!(FALSE))) + EG(EX(E(TRUE U (i0.u2.p4==1))))))))) * !((i3.u7.p49==1))),...507
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t88, t144, t157, t189, u74.t17, u74.t135, i0.u31.t77, i2.u29.t80, i3.t120, i3.u6.t12...728
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 266 transition count 219
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 266 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 266 transition count 217
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 260 transition count 211
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 260 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 260 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 259 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 259 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 259 transition count 204
Applied a total of 48 rules in 12 ms. Remains 259 /279 variables (removed 20) and now considering 204/232 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4981653217199528897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10803165710916089916.kers'
[2026-05-24 22:59:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4981653217199528897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10803165710916089916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 259 cols 627 entries
Finished phase 1 with 145 SingleSign rule and 53 generalized
[2026-05-24 22:59:58] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10803165710916089916.kers
Total runtime 2 ms.
[2026-05-24 22:59:58] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 22:59:58] [INFO ] Invariant cache hit.
[2026-05-24 22:59:58] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 22:59:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/463 variables, 259/320 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 11/331 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 358 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 204/463 variables, 259/375 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 203/578 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 589 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 66/66 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 259/279 places, 204/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 259/279 places, 204/232 transitions.
[2026-05-24 23:00:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 23:00:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:00:59] [INFO ] Input system was already deterministic with 204 transitions.
[2026-05-24 23:00:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:00:59] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7749809400918988796.gal : 2 ms
[2026-05-24 23:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8540729892928617001.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/CTLFireability7749809400918988796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8540729892928617001.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.
Detected timeout of ITS tools.
[2026-05-24 23:01:29] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:01:29] [INFO ] Applying decomposition
[2026-05-24 23:01:29] [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/graph12117672157571325013.txt' '-o' '/tmp/graph12117672157571325013.bin' '-w' '/tmp/graph12117672157571325013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12117672157571325013.bin' '-l' '-1' '-v' '-w' '/tmp/graph12117672157571325013.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:01:29] [INFO ] Decomposing Gal with order
[2026-05-24 23:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:01:29] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 23:01:29] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2026-05-24 23:01:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9375898714821871764.gal : 4 ms
[2026-05-24 23:01:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1696341866733924790.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/CTLFireability9375898714821871764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1696341866733924790.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.03368e+19,28.0095,512636,22004,246,1.45241e+06,1184,730,881915,124,3907,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 262 transition count 215
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 262 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 262 transition count 211
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 254 transition count 203
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 254 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 253 transition count 194
Applied a total of 64 rules in 12 ms. Remains 253 /279 variables (removed 26) and now considering 194/232 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13501327829985252292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4897310590434587201.kers'
[2026-05-24 23:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13501327829985252292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4897310590434587201.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 253 cols 599 entries
Finished phase 1 with 140 SingleSign rule and 52 generalized
[2026-05-24 23:01:59] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4897310590434587201.kers
Total runtime 2 ms.
[2026-05-24 23:01:59] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 23:01:59] [INFO ] Invariant cache hit.
[2026-05-24 23:02:00] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 23:02:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 347 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 32/93 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 194/447 variables, 253/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 193/558 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 11/569 constraints. Problems are: Problem set: 0 solved, 193 unsolved
SMT process timed out in 60040ms, After SMT, problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Starting structural reductions in LTL mode, iteration 1 : 253/279 places, 194/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60860 ms. Remains : 253/279 places, 194/232 transitions.
[2026-05-24 23:03:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 23:03:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:03:00] [INFO ] Input system was already deterministic with 194 transitions.
[2026-05-24 23:03:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 23:03:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:03:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1819221349908028494.gal : 2 ms
[2026-05-24 23:03:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12262684787823322279.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/CTLFireability1819221349908028494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12262684787823322279.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.
Detected timeout of ITS tools.
[2026-05-24 23:03:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:03:30] [INFO ] Applying decomposition
[2026-05-24 23:03:30] [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/graph3743012899011844207.txt' '-o' '/tmp/graph3743012899011844207.bin' '-w' '/tmp/graph3743012899011844207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3743012899011844207.bin' '-l' '-1' '-v' '-w' '/tmp/graph3743012899011844207.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:03:30] [INFO ] Decomposing Gal with order
[2026-05-24 23:03:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:03:30] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-24 23:03:30] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2026-05-24 23:03:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9223445657020043192.gal : 3 ms
[2026-05-24 23:03:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15428098775117937412.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/CTLFireability9223445657020043192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15428098775117937412.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,3.47069e+18,4.79932,100108,6493,294,240844,2538,640,249714,142,7160,0
Converting to forward existential form...Done !
original formula: AX((EG(((((i2.u7.p27==0)||(i2.u7.p50==0))||((i0.u1.p5==0)||(i0.u31.p151==0)))||(((i6.u34.p163==0)||(i6.u34.p165==0))||(i1.u6.p49==0)))) *...221
=> equivalent forward existential formula: ([(EY(Init) * !(EG(((((i2.u7.p27==0)||(i2.u7.p50==0))||((i0.u1.p5==0)||(i0.u31.p151==0)))||(((i6.u34.p163==0)||(...297
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t99, t143, t155, t156, i0.u31.t76, i1.t119, i1.u5.t124, i1.u5.t125, i1.u6.t121,...729
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 279/279 places, 232/232 transitions.
Graph (complete) has 522 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 271 transition count 215
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 260 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 259 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 25 place count 259 transition count 204
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 45 place count 249 transition count 204
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 58 place count 236 transition count 191
Iterating global reduction 3 with 13 rules applied. Total rules applied 71 place count 236 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 236 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 236 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 235 transition count 187
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 83 place count 228 transition count 180
Iterating global reduction 4 with 7 rules applied. Total rules applied 90 place count 228 transition count 180
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 99 place count 228 transition count 171
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 102 place count 226 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 102 place count 226 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 104 place count 225 transition count 169
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 226 place count 164 transition count 108
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 229 place count 164 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 162 transition count 106
Applied a total of 231 rules in 38 ms. Remains 162 /279 variables (removed 117) and now considering 106/232 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2940565391196789108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-777227858980773976.kers'
[2026-05-24 23:04:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2940565391196789108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-777227858980773976.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 106 rows 155 cols 417 entries
Finished phase 1 with 57 SingleSign rule and 46 generalized
[2026-05-24 23:04:00] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-777227858980773976.kers
Total runtime 2 ms.
[2026-05-24 23:04:00] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-24 23:04:00] [INFO ] Invariant cache hit.
[2026-05-24 23:04:00] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2026-05-24 23:04:00] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-24 23:04:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 3/160 variables, 27/51 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 106/267 variables, 161/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/268 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 17 (OVERLAPS) 0/268 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/268 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/268 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 20 (OVERLAPS) 0/268 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 231 constraints, problems are : Problem set: 0 solved, 101 unsolved in 13594 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 3/160 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 106/267 variables, 161/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 101/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/268 variables, and 336 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 161/162 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 43610ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 43611ms
Starting structural reductions in SI_CTL mode, iteration 1 : 162/279 places, 106/232 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44202 ms. Remains : 162/279 places, 106/232 transitions.
[2026-05-24 23:04:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:04:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:04:44] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-24 23:04:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:04:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 23:04:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5935720630891275205.gal : 1 ms
[2026-05-24 23:04:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10038032252863733076.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/CTLFireability5935720630891275205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10038032252863733076.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.
Detected timeout of ITS tools.
[2026-05-24 23:05:14] [INFO ] Flatten gal took : 2 ms
[2026-05-24 23:05:14] [INFO ] Applying decomposition
[2026-05-24 23:05:14] [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/graph3694565469779739030.txt' '-o' '/tmp/graph3694565469779739030.bin' '-w' '/tmp/graph3694565469779739030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3694565469779739030.bin' '-l' '-1' '-v' '-w' '/tmp/graph3694565469779739030.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:05:14] [INFO ] Decomposing Gal with order
[2026-05-24 23:05:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:05:14] [INFO ] Removed a total of 21 redundant transitions.
[2026-05-24 23:05:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 23:05:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 23:05:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8281767667673680725.gal : 2 ms
[2026-05-24 23:05:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3129243842196210941.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/CTLFireability8281767667673680725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3129243842196210941.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,5.46311e+13,0.385403,15612,2080,227,30754,591,417,25875,116,2065,0
Converting to forward existential form...Done !
original formula: AG((EF((!(E(((((i0.u1.p36==1)&&(i0.u2.p43==1))&&((i1.u3.p65==1)&&(i2.u5.p67==1)))&&((i16.i0.u7.p75==1)&&(i2.u8.p86==1))) U ((i15.i1.u52.p...251
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (!(E(((((i0.u1.p36==1)&&(i0.u2.p43==1))&&((i1.u3.p65==1)&&(i2.u5.p67==1)))&&((i1...344
(forward)formula 0,0,0.408077,15872,1,0,30754,591,424,25875,121,2065,1405
FORMULA DES-PT-05b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
[2026-05-24 23:05:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:05:15] [INFO ] Flatten gal took : 8 ms
[2026-05-24 23:05:15] [INFO ] Applying decomposition
[2026-05-24 23:05:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7202436667141575943.txt' '-o' '/tmp/graph7202436667141575943.bin' '-w' '/tmp/graph7202436667141575943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7202436667141575943.bin' '-l' '-1' '-v' '-w' '/tmp/graph7202436667141575943.weights' '-q' '0' '-e' '0.001'
[2026-05-24 23:05:15] [INFO ] Decomposing Gal with order
[2026-05-24 23:05:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:05:15] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-24 23:05:15] [INFO ] Flatten gal took : 17 ms
[2026-05-24 23:05:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2026-05-24 23:05:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6810065384851110374.gal : 4 ms
[2026-05-24 23:05:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14650623978560088522.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6810065384851110374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14650623978560088522.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.14237e+19,14.495,310720,8612,321,611764,2172,694,920090,142,5641,0
Converting to forward existential form...Done !
original formula: (EX(AF(!(A(EG((i9.u57.p199==1)) U (i10.i0.i1.u64.p220==1))))) * (E(!(A(((i13.u19.p81==1)&&(i11.u82.p279==1)) U (i3.u25.p101==1))) U !(AF(...297
=> equivalent forward existential formula: ([(Init * !(EX(!(EG(!(!(!((E(!((i10.i0.i1.u64.p220==1)) U (!(EG((i9.u57.p199==1))) * !((i10.i0.i1.u64.p220==1)))...703
Reverse transition relation is NOT exact ! Due to transitions t0, t60, t93, t140, t169, t223, u42.t78, u85.t17, u85.t160, i0.u20.t113, i0.u20.t114, i1.u40....906
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-24 23:08:30] [INFO ] Applying decomposition
[2026-05-24 23:08:30] [INFO ] Flatten gal took : 5 ms
[2026-05-24 23:08:30] [INFO ] Decomposing Gal with order
[2026-05-24 23:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 23:08:30] [INFO ] Removed a total of 35 redundant transitions.
[2026-05-24 23:08:30] [INFO ] Flatten gal took : 11 ms
[2026-05-24 23:08:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 9 ms.
[2026-05-24 23:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability6875090522768692929.gal : 4 ms
[2026-05-24 23:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability762162053997212612.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6875090522768692929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability762162053997212612.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.14237e+19,623.383,6777016,67699,256,9.54136e+06,1355,660,5.58884e+07,150,6621,0
Converting to forward existential form...Done !
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="DES-PT-05b"
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 DES-PT-05b, 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 r082-smll-177946993700354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;