About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP04C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7411.279 | 3600000.00 | 3758666.00 | 11114.40 | TF?TFTFFTTFFT??T | 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.r338-smll-178021499200234.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 ErlangenMainframeV2-PT-bP04C04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.5K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 222K May 26 18:17 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1780372840556
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-02 04:00:43] [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-06-02 04:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 04:00:43] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2026-06-02 04:00:43] [INFO ] Transformed 239 places.
[2026-06-02 04:00:43] [INFO ] Transformed 511 transitions.
[2026-06-02 04:00:43] [INFO ] Found NUPN structural information;
[2026-06-02 04:00:43] [INFO ] Parsed PT model containing 239 places and 511 transitions and 3954 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 77 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 511/511 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 197 transition count 469
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 197 transition count 469
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 103 place count 178 transition count 450
Iterating global reduction 0 with 19 rules applied. Total rules applied 122 place count 178 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 177 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 177 transition count 449
Applied a total of 124 rules in 93 ms. Remains 177 /239 variables (removed 62) and now considering 449/511 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16690409407440363706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-215104676277400525.kers'
[2026-06-02 04:00:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16690409407440363706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-215104676277400525.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 177 cols 3830 entries
Finished phase 1 with 158 SingleSign rule and 3 generalized
[2026-06-02 04:00:43] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-215104676277400525.kers
Total runtime 6 ms.
[2026-06-02 04:00:44] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-06-02 04:00:44] [INFO ] Invariant cache hit.
[2026-06-02 04:00:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-06-02 04:00:44] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/177 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/626 variables, 177/204 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/626 variables, and 204 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 448/367 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/177 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/626 variables, 177/204 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 367/571 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/626 variables, and 580 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 448/367 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61322ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 61416ms
Starting structural reductions in LTL mode, iteration 1 : 177/239 places, 449/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62375 ms. Remains : 177/239 places, 449/511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 177 /177 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2026-06-02 04:01:46] [INFO ] Invariant cache hit.
[2026-06-02 04:01:46] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-06-02 04:01:46] [INFO ] Invariant cache hit.
[2026-06-02 04:01:46] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 177/177 places, 449/449 transitions.
Support contains 77 out of 177 places after structural reductions.
[2026-06-02 04:01:47] [INFO ] Flatten gal took : 229 ms
[2026-06-02 04:01:47] [INFO ] Flatten gal took : 136 ms
[2026-06-02 04:01:47] [INFO ] Input system was already deterministic with 449 transitions.
RANDOM walk for 40000 steps (8 resets) in 3335 ms. (11 steps per ms) remains 53/87 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
[2026-06-02 04:01:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/117 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 33/150 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 48 unsolved
Problem AtomicPropp45 is UNSAT
At refinement iteration 5 (OVERLAPS) 27/177 variables, 5/16 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/17 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 449/626 variables, 177/194 constraints. Problems are: Problem set: 3 solved, 47 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/626 variables, and 194 constraints, problems are : Problem set: 3 solved, 47 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 50/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 56/95 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 54/149 variables, 3/12 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 28/177 variables, 5/17 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 3/20 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/22 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 449/626 variables, 177/199 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 19/218 constraints. Problems are: Problem set: 3 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/626 variables, and 218 constraints, problems are : Problem set: 3 solved, 47 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 47/19 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10279ms problems are : Problem set: 3 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 122 edges and 177 vertex of which 10 / 177 are part of one of the 4 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 171 transition count 408
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 49 rules applied. Total rules applied 80 place count 141 transition count 389
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 93 place count 130 transition count 387
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 128 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 127 transition count 385
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 98 place count 127 transition count 376
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 116 place count 118 transition count 376
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 123 place count 111 transition count 361
Iterating global reduction 5 with 7 rules applied. Total rules applied 130 place count 111 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 130 place count 111 transition count 360
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 110 transition count 360
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 182 place count 85 transition count 335
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 184 place count 83 transition count 323
Iterating global reduction 5 with 2 rules applied. Total rules applied 186 place count 83 transition count 323
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 196 place count 78 transition count 352
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 211 place count 78 transition count 337
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 212 place count 77 transition count 335
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 77 transition count 335
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 220 place count 77 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 76 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 76 transition count 342
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 229 place count 76 transition count 336
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 235 place count 70 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 70 transition count 335
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 239 place count 70 transition count 335
Applied a total of 239 rules in 318 ms. Remains 70 /177 variables (removed 107) and now considering 335/449 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 70/177 places, 335/449 transitions.
RANDOM walk for 40000 steps (8 resets) in 4081 ms. (9 steps per ms) remains 24/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
[2026-06-02 04:02:00] [INFO ] Flow matrix only has 333 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3990235730308541163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5568660356484081648.kers'
[2026-06-02 04:02:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3990235730308541163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5568660356484081648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 70 cols 3584 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-06-02 04:02:00] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5568660356484081648.kers
Total runtime 4 ms.
[2026-06-02 04:02:00] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 6/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 17/70 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 333/403 variables, 70/87 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 119 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 24/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 15/47 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 6/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 17/70 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 333/403 variables, 70/87 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 127 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4762 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 24/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6348ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 7 properties in 1004 ms.
Support contains 28 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 335/335 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 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 68 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 68 transition count 331
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 66 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 65 transition count 330
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 65 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 63 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 63 transition count 327
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 19 place count 61 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 38 place count 61 transition count 317
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 61 transition count 315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 59 transition count 315
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 59 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 59 transition count 314
Applied a total of 44 rules in 71 ms. Remains 59 /70 variables (removed 11) and now considering 314/335 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 59/70 places, 314/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
[2026-06-02 04:02:08] [INFO ] Flow matrix only has 313 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12179793659646254241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1791233781857233341.kers'
[2026-06-02 04:02:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12179793659646254241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1791233781857233341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 59 cols 3486 entries
Finished phase 1 with 40 SingleSign rule and 3 generalized
[2026-06-02 04:02:08] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1791233781857233341.kers
Total runtime 4 ms.
[2026-06-02 04:02:08] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/59 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 313/372 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 34/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 22/59 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 313/372 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/372 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 110 constraints, problems are : Problem set: 0 solved, 2 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 566ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 56 ms.
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 314/314 transitions.
Graph (trivial) has 23 edges and 59 vertex of which 2 / 59 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 57 transition count 311
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3 place count 57 transition count 307
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 53 transition count 307
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 49 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 49 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 47 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 47 transition count 152
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 2 with 6 rules applied. Total rules applied 29 place count 44 transition count 149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 40 transition count 163
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 40 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 40 transition count 147
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 40 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 38 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 37 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 36 transition count 144
Applied a total of 59 rules in 64 ms. Remains 36 /59 variables (removed 23) and now considering 144/314 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 36/59 places, 144/314 transitions.
RANDOM walk for 1331 steps (0 resets) in 20 ms. (63 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-06-02 04:02:09] [INFO ] Flatten gal took : 98 ms
[2026-06-02 04:02:09] [INFO ] Flatten gal took : 87 ms
[2026-06-02 04:02:09] [INFO ] Input system was already deterministic with 449 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 154 edges and 177 vertex of which 12 / 177 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 169 transition count 404
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 57 rules applied. Total rules applied 94 place count 133 transition count 383
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 383
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 106 place count 121 transition count 375
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 123 place count 112 transition count 375
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 139 place count 96 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 156 place count 95 transition count 283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 156 place count 95 transition count 281
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 160 place count 93 transition count 281
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 170 place count 83 transition count 118
Ensure Unique test removed 3 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 183 place count 80 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 75 transition count 100
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 75 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 74 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 74 transition count 98
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 249 place count 47 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 253 place count 43 transition count 62
Iterating global reduction 3 with 4 rules applied. Total rules applied 257 place count 43 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 43 transition count 55
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 272 place count 39 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 place count 38 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 275 place count 36 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 279 place count 36 transition count 46
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 2 rules applied. Total rules applied 281 place count 36 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 283 place count 34 transition count 44
Applied a total of 283 rules in 72 ms. Remains 34 /177 variables (removed 143) and now considering 44/449 (removed 405) transitions.
[2026-06-02 04:02:09] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13088400037424192443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16176450166646267059.kers'
[2026-06-02 04:02:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13088400037424192443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16176450166646267059.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 37 rows 30 cols 92 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-06-02 04:02:09] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16176450166646267059.kers
Total runtime 1 ms.
[2026-06-02 04:02:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-06-02 04:02:09] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
[2026-06-02 04:02:09] [INFO ] Invariant cache hit.
[2026-06-02 04:02:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-06-02 04:02:09] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2026-06-02 04:02:09] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
[2026-06-02 04:02:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 37/71 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/72 variables, and 43 constraints, problems are : Problem set: 0 solved, 28 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 37/71 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/72 variables, and 71 constraints, problems are : Problem set: 0 solved, 28 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1478ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1478ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/177 places, 44/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1669 ms. Remains : 34/177 places, 44/449 transitions.
[2026-06-02 04:02:11] [INFO ] Flatten gal took : 3 ms
[2026-06-02 04:02:11] [INFO ] Flatten gal took : 2 ms
[2026-06-02 04:02:11] [INFO ] Input system was already deterministic with 44 transitions.
RANDOM walk for 403 steps (7 resets) in 5 ms. (67 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 04:02:11] [INFO ] Flatten gal took : 2 ms
[2026-06-02 04:02:11] [INFO ] Flatten gal took : 2 ms
[2026-06-02 04:02:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4819320074966031975.gal : 2 ms
[2026-06-02 04:02:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality857649086435044153.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/ReachabilityCardinality4819320074966031975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality857649086435044153.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 146 edges and 177 vertex of which 10 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 170 transition count 406
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 56 rules applied. Total rules applied 92 place count 135 transition count 385
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 104 place count 123 transition count 385
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 104 place count 123 transition count 376
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 123 place count 113 transition count 376
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 140 place count 96 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 3 with 18 rules applied. Total rules applied 158 place count 95 transition count 283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 158 place count 95 transition count 281
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 162 place count 93 transition count 281
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 169 place count 86 transition count 174
Ensure Unique test removed 3 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 179 place count 83 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 182 place count 80 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 185 place count 80 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 79 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 79 transition count 130
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 237 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 51 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 51 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 248 place count 51 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 49 transition count 91
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 49 transition count 91
Applied a total of 254 rules in 89 ms. Remains 49 /177 variables (removed 128) and now considering 91/449 (removed 358) transitions.
[2026-06-02 04:02:11] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11823313421995878368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1713216741498810869.kers'
[2026-06-02 04:02:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11823313421995878368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1713216741498810869.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 49 cols 624 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-06-02 04:02:11] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1713216741498810869.kers
Total runtime 2 ms.
[2026-06-02 04:02:11] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-06-02 04:02:11] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2026-06-02 04:02:11] [INFO ] Invariant cache hit.
[2026-06-02 04:02:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 04:02:11] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2026-06-02 04:02:11] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2026-06-02 04:02:11] [INFO ] Flow matrix only has 86 transitions (discarded 5 similar events)
[2026-06-02 04:02:11] [INFO ] Invariant cache hit.
[2026-06-02 04:02:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 85/134 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 64 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 85/134 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 154 constraints, problems are : Problem set: 0 solved, 90 unsolved in 7074 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12237ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 12238ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/177 places, 91/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12546 ms. Remains : 49/177 places, 91/449 transitions.
[2026-06-02 04:02:24] [INFO ] Flatten gal took : 13 ms
[2026-06-02 04:02:24] [INFO ] Flatten gal took : 11 ms
[2026-06-02 04:02:24] [INFO ] Input system was already deterministic with 91 transitions.
[2026-06-02 04:02:24] [INFO ] Flatten gal took : 27 ms
[2026-06-02 04:02:24] [INFO ] Flatten gal took : 10 ms
[2026-06-02 04:02:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17493129936711537059.gal : 23 ms
[2026-06-02 04:02:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13741974146290456566.ctl : 16 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/CTLFireability17493129936711537059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13741974146290456566.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.42829e+06,0.178638,5788,2,667,5,6298,6,0,285,6034,0
Converting to forward existential form...Done !
original formula: EG(AG(((((p2==0)||(p17==0))||((p36==0)||(p59==0)))||(((p85==0)||(p125==0))||(p232==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((((p2==0)||(p17==0))||((p36==0)||(p59==0)))||(((p85==0)||(p125==0))||(p232==0)))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t19, t41, t42, t50, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
(forward)formula 0,0,1.31625,28684,1,0,155,120333,206,92,3450,89631,219
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 366
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 366
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 148 transition count 358
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 148 transition count 358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 144 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 144 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 142 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 142 transition count 337
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 140 transition count 335
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 140 transition count 335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 139 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 139 transition count 334
Applied a total of 76 rules in 15 ms. Remains 139 /177 variables (removed 38) and now considering 334/449 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2244889962823194666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3475797519222168595.kers'
[2026-06-02 04:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2244889962823194666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3475797519222168595.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 139 cols 2874 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-06-02 04:02:25] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3475797519222168595.kers
Total runtime 3 ms.
[2026-06-02 04:02:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-06-02 04:02:25] [INFO ] Invariant cache hit.
[2026-06-02 04:02:25] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-06-02 04:02:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/473 variables, 139/155 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 155 constraints, problems are : Problem set: 0 solved, 333 unsolved in 24500 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/473 variables, 139/155 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 333/488 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 492 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55040ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 55041ms
Starting structural reductions in LTL mode, iteration 1 : 139/177 places, 334/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55387 ms. Remains : 139/177 places, 334/449 transitions.
[2026-06-02 04:03:21] [INFO ] Flatten gal took : 28 ms
[2026-06-02 04:03:21] [INFO ] Flatten gal took : 29 ms
[2026-06-02 04:03:21] [INFO ] Input system was already deterministic with 334 transitions.
[2026-06-02 04:03:21] [INFO ] Flatten gal took : 25 ms
[2026-06-02 04:03:21] [INFO ] Flatten gal took : 25 ms
[2026-06-02 04:03:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8548741748751896225.gal : 23 ms
[2026-06-02 04:03:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11081090118676866963.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/CTLFireability8548741748751896225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11081090118676866963.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.73046e+09,1.94951,39944,2,10057,5,116978,6,0,892,124584,0
Converting to forward existential form...Done !
original formula: !(E((!((((((p4==1)&&(p16==1))&&((p46==1)&&(p65==1)))&&((p77==1)&&(p131==1))) + !((AG((p188==1)) + (p108==1))))) + !(E(!(EG((((p103==1)&&(...359
=> equivalent forward existential formula: [(FwdU(Init,(!((((((p4==1)&&(p16==1))&&((p46==1)&&(p65==1)))&&((p77==1)&&(p131==1))) + !((!(E(TRUE U !((p188==1)...425
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t27, t67, t70, t79, t85, t87, t91, t92, t96, t97, t101, t105, t106, t109, t110...870
Detected timeout of ITS tools.
[2026-06-02 04:03:51] [INFO ] Flatten gal took : 25 ms
[2026-06-02 04:03:51] [INFO ] Applying decomposition
[2026-06-02 04:03:51] [INFO ] Flatten gal took : 24 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/graph6782106494020186296.txt' '-o' '/tmp/graph6782106494020186296.bin' '-w' '/tmp/graph6782106494020186296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6782106494020186296.bin' '-l' '-1' '-v' '-w' '/tmp/graph6782106494020186296.weights' '-q' '0' '-e' '0.001'
[2026-06-02 04:03:51] [INFO ] Decomposing Gal with order
[2026-06-02 04:03:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:03:51] [INFO ] Removed a total of 138 redundant transitions.
[2026-06-02 04:03:51] [INFO ] Flatten gal took : 132 ms
[2026-06-02 04:03:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 12 ms.
[2026-06-02 04:03:51] [INFO ] Time to serialize gal into /tmp/CTLFireability633972315054828692.gal : 8 ms
[2026-06-02 04:03:51] [INFO ] Time to serialize properties into /tmp/CTLFireability568340674295462803.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/CTLFireability633972315054828692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability568340674295462803.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 -...260
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.73046e+09,23.8955,488308,897,4513,49595,210503,391,1.02631e+06,357,6.86827e+06,0
Converting to forward existential form...Done !
original formula: !(E((!((((((u13.p4==1)&&(u13.p16==1))&&((u13.p46==1)&&(u13.p65==1)))&&((u13.p77==1)&&(i0.u3.p131==1))) + !((AG((i7.i1.u24.p188==1)) + (i2...478
=> equivalent forward existential formula: [(FwdU(Init,(!((((((u13.p4==1)&&(u13.p16==1))&&((u13.p46==1)&&(u13.p65==1)))&&((u13.p77==1)&&(i0.u3.p131==1))) +...544
Reverse transition relation is NOT exact ! Due to transitions t12, t27, t67, t92, t109, u5.t96, u5.t319, u5.t320, u13.t106, u13.t126, u13.t128, u13.t129, u...1191
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 157 transition count 395
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 157 transition count 395
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 147 transition count 332
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 147 transition count 332
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 140 transition count 284
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 140 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 135 transition count 203
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 135 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 133 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 133 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 132 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 132 transition count 200
Applied a total of 90 rules in 16 ms. Remains 132 /177 variables (removed 45) and now considering 200/449 (removed 249) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14969812103946111603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13748079618498505687.kers'
[2026-06-02 04:04:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14969812103946111603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13748079618498505687.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 132 cols 1046 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-06-02 04:04:21] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13748079618498505687.kers
Total runtime 2 ms.
[2026-06-02 04:04:22] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-06-02 04:04:22] [INFO ] Invariant cache hit.
[2026-06-02 04:04:22] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-06-02 04:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/148 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 0/332 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 148 constraints, problems are : Problem set: 0 solved, 199 unsolved in 13878 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/332 variables, 132/148 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 199/347 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 9/356 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 360 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43948ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 43951ms
Starting structural reductions in LTL mode, iteration 1 : 132/177 places, 200/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44364 ms. Remains : 132/177 places, 200/449 transitions.
[2026-06-02 04:05:06] [INFO ] Flatten gal took : 18 ms
[2026-06-02 04:05:06] [INFO ] Flatten gal took : 16 ms
[2026-06-02 04:05:06] [INFO ] Input system was already deterministic with 200 transitions.
[2026-06-02 04:05:06] [INFO ] Flatten gal took : 16 ms
[2026-06-02 04:05:06] [INFO ] Flatten gal took : 16 ms
[2026-06-02 04:05:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17489223480810666881.gal : 4 ms
[2026-06-02 04:05:06] [INFO ] Time to serialize properties into /tmp/CTLFireability304590001336863555.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/CTLFireability17489223480810666881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability304590001336863555.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.48874e+09,1.02716,22388,2,5471,5,68533,6,0,730,77267,0
Converting to forward existential form...Done !
original formula: AX(EX(EF(((((p4==1)&&(p27==1))&&((p39==1)&&(p54==1)))&&((p84==1)&&(p131==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U ((((p4==1)&&(p27==1))&&((p39==1)&&(p54==1)))&&((p84==1)&&(p131==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t27, t67, t70, t77, t83, t87, t89, t90, t93, t94, t95, t98, t100, t102, t103, ...393
(forward)formula 0,1,29.8803,640080,1,0,417,3.72723e+06,421,218,6874,2.68581e+06,506
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 163 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 163 transition count 435
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 157 transition count 429
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 157 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 156 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 156 transition count 428
Applied a total of 42 rules in 15 ms. Remains 156 /177 variables (removed 21) and now considering 428/449 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13237342336090961146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15617024878256138715.kers'
[2026-06-02 04:05:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13237342336090961146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15617024878256138715.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 428 rows 156 cols 3788 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-06-02 04:05:36] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15617024878256138715.kers
Total runtime 6 ms.
[2026-06-02 04:05:36] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-06-02 04:05:36] [INFO ] Invariant cache hit.
[2026-06-02 04:05:36] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-06-02 04:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/584 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 176 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 427/346 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/584 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 346/522 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 529 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 427/346 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60792ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60795ms
Starting structural reductions in LTL mode, iteration 1 : 156/177 places, 428/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61212 ms. Remains : 156/177 places, 428/449 transitions.
[2026-06-02 04:06:37] [INFO ] Flatten gal took : 33 ms
[2026-06-02 04:06:37] [INFO ] Flatten gal took : 31 ms
[2026-06-02 04:06:37] [INFO ] Input system was already deterministic with 428 transitions.
[2026-06-02 04:06:37] [INFO ] Flatten gal took : 32 ms
[2026-06-02 04:06:37] [INFO ] Flatten gal took : 33 ms
[2026-06-02 04:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15959804974283557646.gal : 8 ms
[2026-06-02 04:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17643133160391530978.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/CTLFireability15959804974283557646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17643133160391530978.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48367e+10,2.81942,52264,2,12512,5,139653,6,0,1054,171466,0
Converting to forward existential form...Done !
original formula: E((E((((EG(((((p149==1)&&(p183==1))&&(p228==1))||(p62==1))) * (p4==1)) * ((p27==1)&&(p35==1))) * (((p58==1)&&(p77==1))&&(p131==1))) U EF(...1055
=> equivalent forward existential formula: ((([(FwdU(FwdU((FwdU(Init,(E((((EG(((((p149==1)&&(p183==1))&&(p228==1))||(p62==1))) * (p4==1)) * ((p27==1)&&(p35...3952
Reverse transition relation is NOT exact ! Due to transitions t14, t15, t19, t22, t27, t31, t54, t59, t73, t74, t75, t78, t85, t91, t93, t97, t98, t102, t1...818
(forward)formula 0,0,19.4979,401924,1,0,1088,1.55396e+06,915,537,16659,1.47827e+06,1205
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 136 edges and 177 vertex of which 10 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 170 transition count 409
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 1 with 51 rules applied. Total rules applied 84 place count 138 transition count 390
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 127 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 126 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 125 transition count 387
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 100 place count 125 transition count 379
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 116 place count 117 transition count 379
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 129 place count 104 transition count 332
Iterating global reduction 5 with 13 rules applied. Total rules applied 142 place count 104 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 142 place count 104 transition count 331
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 144 place count 103 transition count 331
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 149 place count 98 transition count 233
Iterating global reduction 5 with 5 rules applied. Total rules applied 154 place count 98 transition count 233
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 156 place count 96 transition count 173
Iterating global reduction 5 with 2 rules applied. Total rules applied 158 place count 96 transition count 173
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 95 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 95 transition count 171
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 206 place count 72 transition count 148
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 209 place count 69 transition count 138
Iterating global reduction 5 with 3 rules applied. Total rules applied 212 place count 69 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 69 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 220 place count 67 transition count 132
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 67 transition count 132
Applied a total of 223 rules in 50 ms. Remains 67 /177 variables (removed 110) and now considering 132/449 (removed 317) transitions.
[2026-06-02 04:06:57] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1878047070955621933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14519633604516159629.kers'
[2026-06-02 04:06:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1878047070955621933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14519633604516159629.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 67 cols 1062 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-06-02 04:06:57] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14519633604516159629.kers
Total runtime 1 ms.
[2026-06-02 04:06:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-06-02 04:06:57] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
[2026-06-02 04:06:57] [INFO ] Invariant cache hit.
[2026-06-02 04:06:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 04:06:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-06-02 04:06:57] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2026-06-02 04:06:57] [INFO ] Flow matrix only has 126 transitions (discarded 6 similar events)
[2026-06-02 04:06:57] [INFO ] Invariant cache hit.
[2026-06-02 04:06:57] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 125/192 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 86 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8915 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 125/192 variables, 67/83 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 131/216 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/193 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/193 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 219 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 67/67 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39022ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 39023ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/177 places, 132/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39306 ms. Remains : 67/177 places, 132/449 transitions.
[2026-06-02 04:07:36] [INFO ] Flatten gal took : 12 ms
[2026-06-02 04:07:36] [INFO ] Flatten gal took : 11 ms
[2026-06-02 04:07:36] [INFO ] Input system was already deterministic with 132 transitions.
[2026-06-02 04:07:36] [INFO ] Flatten gal took : 11 ms
[2026-06-02 04:07:36] [INFO ] Flatten gal took : 11 ms
[2026-06-02 04:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15540877353905732855.gal : 3 ms
[2026-06-02 04:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16614775398714513591.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/CTLFireability15540877353905732855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16614775398714513591.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3109e+07,0.494772,13248,2,1542,5,22593,6,0,398,25276,0
Converting to forward existential form...Done !
original formula: EG((A(((p207==1) + A(EG((p81==1)) U !(((((p4==1)&&(p20==1))&&((p35==1)&&(p58==1)))&&((p77==1)&&(p131==1)))))) U EF((AF((p163==1)) + (p233...248
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(E(TRUE U (!(EG(!((p163==1)))) + (p233==1)))) U (!(((p207==1) + !((E(!(!(((((p4==1)&&(p20==1))...589
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t92, t93, t96, t97, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t108, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.24987,129440,1,0,524,493598,311,331,5499,628906,551
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 158 transition count 379
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 158 transition count 379
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 150 transition count 371
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 150 transition count 371
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 146 transition count 349
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 146 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 145 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 145 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 144 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 144 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 143 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 143 transition count 341
Applied a total of 68 rules in 19 ms. Remains 143 /177 variables (removed 34) and now considering 341/449 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16910805852825608263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14156996859411813826.kers'
[2026-06-02 04:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16910805852825608263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14156996859411813826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 143 cols 2904 entries
Finished phase 1 with 125 SingleSign rule and 2 generalized
[2026-06-02 04:07:43] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14156996859411813826.kers
Total runtime 3 ms.
[2026-06-02 04:07:43] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-06-02 04:07:43] [INFO ] Invariant cache hit.
[2026-06-02 04:07:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-06-02 04:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 341/484 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/484 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 159 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 341/484 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 340/499 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 507 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60632ms
Starting structural reductions in LTL mode, iteration 1 : 143/177 places, 341/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61009 ms. Remains : 143/177 places, 341/449 transitions.
[2026-06-02 04:08:44] [INFO ] Flatten gal took : 27 ms
[2026-06-02 04:08:44] [INFO ] Flatten gal took : 29 ms
[2026-06-02 04:08:44] [INFO ] Input system was already deterministic with 341 transitions.
[2026-06-02 04:08:44] [INFO ] Flatten gal took : 28 ms
[2026-06-02 04:08:44] [INFO ] Flatten gal took : 28 ms
[2026-06-02 04:08:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7825134861209642758.gal : 6 ms
[2026-06-02 04:08:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6784928140140280145.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/CTLFireability7825134861209642758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6784928140140280145.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14344e+10,1.46915,35064,2,8395,5,95349,6,0,915,102175,0
Converting to forward existential form...Done !
original formula: (AX(!(E(EG(((((p4==1)&&(p27==1))&&((p46==1)&&(p65==1)))&&(((p84==1)&&(p131==1))&&(p226==1)))) U (EF(((((p2==1)&&(p28==1))&&((p47==1)&&(p6...334
=> equivalent forward existential formula: (([(FwdU(FwdU(EY(Init),EG(((((p4==1)&&(p27==1))&&((p46==1)&&(p65==1)))&&(((p84==1)&&(p131==1))&&(p226==1))))),TR...793
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t22, t30, t71, t74, t81, t87, t93, t94, t98, t99, t103, t107, t108, t111, t112...1170
Using saturation style SCC detection
(forward)formula 0,0,9.79797,183736,1,0,756,721840,738,355,11928,626722,878
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 163 transition count 435
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 163 transition count 435
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 156 transition count 428
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 156 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 155 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 155 transition count 427
Applied a total of 44 rules in 13 ms. Remains 155 /177 variables (removed 22) and now considering 427/449 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10089725716081337460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3932558405712433883.kers'
[2026-06-02 04:08:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10089725716081337460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3932558405712433883.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 427 rows 155 cols 3786 entries
Finished phase 1 with 136 SingleSign rule and 3 generalized
[2026-06-02 04:08:54] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3932558405712433883.kers
Total runtime 6 ms.
[2026-06-02 04:08:54] [INFO ] Implicit Places using invariants in 143 ms returned []
[2026-06-02 04:08:54] [INFO ] Invariant cache hit.
[2026-06-02 04:08:54] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2026-06-02 04:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/582 variables, 155/176 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/582 variables, and 176 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 426/345 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/582 variables, 155/176 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 345/521 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/582 variables, and 529 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 426/345 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60803ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60806ms
Starting structural reductions in LTL mode, iteration 1 : 155/177 places, 427/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61309 ms. Remains : 155/177 places, 427/449 transitions.
[2026-06-02 04:09:55] [INFO ] Flatten gal took : 20 ms
[2026-06-02 04:09:55] [INFO ] Flatten gal took : 22 ms
[2026-06-02 04:09:55] [INFO ] Input system was already deterministic with 427 transitions.
[2026-06-02 04:09:55] [INFO ] Flatten gal took : 21 ms
[2026-06-02 04:09:55] [INFO ] Flatten gal took : 22 ms
[2026-06-02 04:09:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17254164618155040597.gal : 4 ms
[2026-06-02 04:09:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15249191731011753773.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/CTLFireability17254164618155040597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15249191731011753773.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58317e+10,2.00662,41120,2,10514,5,112409,6,0,1049,127904,0
Converting to forward existential form...Done !
original formula: (EG(((((((E(((((p2==1)&&(p17==1))&&((p47==1)&&(p55==1)))&&(((p78==1)&&(p125==1))&&(p221==1))) U ((((p4==1)&&(p27==1))&&((p35==1)&&(p58==1...950
=> equivalent forward existential formula: ([(Init * !(EG(((((((E(((((p2==1)&&(p17==1))&&((p47==1)&&(p55==1)))&&(((p78==1)&&(p125==1))&&(p221==1))) U ((((p...1083
(forward)formula 0,0,2.31154,41120,1,0,8,112409,9,2,3041,127904,2
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 143 edges and 177 vertex of which 10 / 177 are part of one of the 4 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 170 transition count 406
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 56 rules applied. Total rules applied 92 place count 135 transition count 385
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 104 place count 123 transition count 385
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 104 place count 123 transition count 377
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 120 place count 115 transition count 377
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 133 place count 102 transition count 330
Iterating global reduction 3 with 13 rules applied. Total rules applied 146 place count 102 transition count 330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 146 place count 102 transition count 328
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 150 place count 100 transition count 328
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 97 transition count 300
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 97 transition count 300
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 204 place count 73 transition count 276
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 207 place count 70 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 210 place count 70 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 70 transition count 266
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 218 place count 70 transition count 266
Applied a total of 218 rules in 49 ms. Remains 70 /177 variables (removed 107) and now considering 266/449 (removed 183) transitions.
[2026-06-02 04:09:58] [INFO ] Flow matrix only has 260 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9512646759160623726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12995569767839173103.kers'
[2026-06-02 04:09:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9512646759160623726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12995569767839173103.kers]
Normalized transition count is 259 out of 260 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 70 cols 2902 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-06-02 04:09:58] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12995569767839173103.kers
Total runtime 4 ms.
[2026-06-02 04:09:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-06-02 04:09:58] [INFO ] Flow matrix only has 260 transitions (discarded 6 similar events)
[2026-06-02 04:09:58] [INFO ] Invariant cache hit.
[2026-06-02 04:09:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 04:09:58] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2026-06-02 04:09:58] [INFO ] Redundant transitions in 16 ms returned []
Running 265 sub problems to find dead transitions.
[2026-06-02 04:09:58] [INFO ] Flow matrix only has 260 transitions (discarded 6 similar events)
[2026-06-02 04:09:58] [INFO ] Invariant cache hit.
[2026-06-02 04:09:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 259/329 variables, 70/86 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 89 constraints, problems are : Problem set: 0 solved, 265 unsolved in 22208 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 259/329 variables, 70/86 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 265/353 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/330 variables, and 354 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 70/70 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52950ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 52951ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/177 places, 266/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53338 ms. Remains : 70/177 places, 266/449 transitions.
[2026-06-02 04:10:51] [INFO ] Flatten gal took : 14 ms
[2026-06-02 04:10:51] [INFO ] Flatten gal took : 14 ms
[2026-06-02 04:10:51] [INFO ] Input system was already deterministic with 266 transitions.
[2026-06-02 04:10:51] [INFO ] Flatten gal took : 14 ms
[2026-06-02 04:10:51] [INFO ] Flatten gal took : 19 ms
[2026-06-02 04:10:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1439693881739401191.gal : 4 ms
[2026-06-02 04:10:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15866546285695012977.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/CTLFireability1439693881739401191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15866546285695012977.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26068e+07,0.8762,19248,2,2694,5,33934,6,0,544,35193,0
Converting to forward existential form...Done !
original formula: A(((((p2==1)&&(p17==1))&&((p47==1)&&(p66==1)))&&(((p85==1)&&(p125==1))&&(p232==1))) U E(((!(((((p2==1)&&(p17==1))&&((p47==1)&&(p66==1)))&...507
=> equivalent forward existential formula: [((Init * !(EG(!(E(((!(((((p2==1)&&(p17==1))&&((p47==1)&&(p66==1)))&&(((p78==1)&&(p125==1))&&(p232==1)))) + !(E(...1460
Reverse transition relation is NOT exact ! Due to transitions t23, t127, t128, t129, t130, t131, t132, t133, t134, t135, t136, t137, t138, t139, t140, t141...407
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.4214,552680,1,0,711,2.06815e+06,576,492,10781,2.12924e+06,895
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 154 transition count 358
Ensure Unique test removed 1 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 47 place count 153 transition count 358
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 55 place count 145 transition count 350
Iterating global reduction 0 with 8 rules applied. Total rules applied 63 place count 145 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 67 place count 141 transition count 342
Ensure Unique test removed 3 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 138 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 137 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 137 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 136 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 136 transition count 286
Applied a total of 78 rules in 17 ms. Remains 136 /177 variables (removed 41) and now considering 286/449 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6845038879213865551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3181152565278763313.kers'
[2026-06-02 04:11:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6845038879213865551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3181152565278763313.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 136 cols 1620 entries
Finished phase 1 with 123 SingleSign rule and 1 generalized
[2026-06-02 04:11:21] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3181152565278763313.kers
Total runtime 7 ms.
[2026-06-02 04:11:21] [INFO ] Implicit Places using invariants in 148 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/177 places, 286/449 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 286/286 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 184 ms. Remains : 135/177 places, 286/449 transitions.
[2026-06-02 04:11:21] [INFO ] Flatten gal took : 17 ms
[2026-06-02 04:11:21] [INFO ] Flatten gal took : 19 ms
[2026-06-02 04:11:21] [INFO ] Input system was already deterministic with 286 transitions.
[2026-06-02 04:11:21] [INFO ] Flatten gal took : 16 ms
[2026-06-02 04:11:21] [INFO ] Flatten gal took : 16 ms
[2026-06-02 04:11:21] [INFO ] Time to serialize gal into /tmp/CTLFireability294280603630376143.gal : 4 ms
[2026-06-02 04:11:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12844436713092637445.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/CTLFireability294280603630376143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12844436713092637445.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01783e+10,1.95465,46888,2,13086,5,175040,6,0,828,118419,0
Converting to forward existential form...Done !
original formula: !(A(!(AG(EX(((p97==1)||(((p160==1)&&(p194==1))&&(p228==1)))))) U (AG(EX(((((p2==1)&&(p17==1))&&((p36==1)&&(p66==1)))&&(((p74==1)&&(p125==...281
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,!((!(E(TRUE U !(EX(((((p2==1)&&(p17==1))&&((p36==1)&&(p66==1)))&&(((p74==1)&&(p125==1))&&(p2...971
Reverse transition relation is NOT exact ! Due to transitions t12, t17, t20, t28, t70, t73, t80, t86, t92, t93, t97, t98, t101, t105, t106, t109, t110, t11...925
(forward)formula 0,1,14.8582,289440,1,0,535,1.41704e+06,608,277,8132,1.17179e+06,642
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 156 transition count 377
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 156 transition count 377
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 145 transition count 278
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 145 transition count 278
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 140 transition count 250
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 140 transition count 250
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 136 transition count 205
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 136 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 134 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 134 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 133 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 133 transition count 202
Applied a total of 88 rules in 14 ms. Remains 133 /177 variables (removed 44) and now considering 202/449 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14586201833776595064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11800042696773108660.kers'
[2026-06-02 04:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14586201833776595064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11800042696773108660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 133 cols 1050 entries
Finished phase 1 with 115 SingleSign rule and 2 generalized
[2026-06-02 04:11:36] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11800042696773108660.kers
Total runtime 3 ms.
[2026-06-02 04:11:36] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-06-02 04:11:36] [INFO ] Invariant cache hit.
[2026-06-02 04:11:37] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-06-02 04:11:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/335 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 149 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16331 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 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/132 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/335 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 201/350 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 354 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46417ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 46418ms
Starting structural reductions in LTL mode, iteration 1 : 133/177 places, 202/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46814 ms. Remains : 133/177 places, 202/449 transitions.
[2026-06-02 04:12:23] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:23] [INFO ] Flatten gal took : 7 ms
[2026-06-02 04:12:23] [INFO ] Input system was already deterministic with 202 transitions.
[2026-06-02 04:12:23] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:23] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13798817817332961117.gal : 2 ms
[2026-06-02 04:12:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15482694702719835595.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/CTLFireability13798817817332961117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15482694702719835595.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.17458e+09,0.920532,22644,2,5491,5,71550,6,0,736,80236,0
Converting to forward existential form...Done !
original formula: EF(((p9==1) * EX(((((p4==1)&&(p27==1))&&((p46==1)&&(p58==1)))&&((p84==1)&&(p131==1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p9==1))) * ((((p4==1)&&(p27==1))&&((p46==1)&&(p58==1)))&&((p84==1)&&(p131==1))))] != FA...158
(forward)formula 0,0,0.944623,22644,1,0,9,71550,9,2,1119,80236,3
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 140 edges and 177 vertex of which 10 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 170 transition count 408
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 51 rules applied. Total rules applied 85 place count 137 transition count 390
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 96 place count 127 transition count 389
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 99 place count 126 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 125 transition count 387
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 100 place count 125 transition count 377
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 121 place count 114 transition count 377
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 138 place count 97 transition count 284
Ensure Unique test removed 1 places
Iterating global reduction 5 with 18 rules applied. Total rules applied 156 place count 96 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 156 place count 96 transition count 282
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 160 place count 94 transition count 282
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 167 place count 87 transition count 175
Ensure Unique test removed 3 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 177 place count 84 transition count 175
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 180 place count 81 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 183 place count 81 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 184 place count 80 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 185 place count 80 transition count 131
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 227 place count 59 transition count 110
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 230 place count 56 transition count 103
Iterating global reduction 5 with 3 rules applied. Total rules applied 233 place count 56 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 236 place count 56 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 55 transition count 99
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 55 transition count 99
Applied a total of 240 rules in 42 ms. Remains 55 /177 variables (removed 122) and now considering 99/449 (removed 350) transitions.
[2026-06-02 04:12:24] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9309999323847827322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11881411125593110991.kers'
[2026-06-02 04:12:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9309999323847827322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11881411125593110991.kers]
Normalized transition count is 95 out of 96 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 55 cols 654 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-06-02 04:12:24] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11881411125593110991.kers
Total runtime 2 ms.
[2026-06-02 04:12:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-02 04:12:24] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2026-06-02 04:12:24] [INFO ] Invariant cache hit.
[2026-06-02 04:12:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 04:12:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-06-02 04:12:24] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2026-06-02 04:12:24] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2026-06-02 04:12:24] [INFO ] Invariant cache hit.
[2026-06-02 04:12:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 95/150 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 70 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6893 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 95/150 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 98/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 10984 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17909ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 17909ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/177 places, 99/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18123 ms. Remains : 55/177 places, 99/449 transitions.
[2026-06-02 04:12:42] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:42] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:42] [INFO ] Input system was already deterministic with 99 transitions.
[2026-06-02 04:12:42] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:42] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2218584639806649604.gal : 2 ms
[2026-06-02 04:12:42] [INFO ] Time to serialize properties into /tmp/CTLFireability18034422824775043934.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/CTLFireability2218584639806649604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18034422824775043934.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.81536e+06,0.110419,6900,2,583,5,9505,6,0,317,9819,0
Converting to forward existential form...Done !
original formula: !(A(((((p2==1)&&(p21==1))&&((p36==1)&&(p66==1)))&&(((p74==1)&&(p125==1))&&(p232==1))) U EG(((EF((((p51==1)&&(p95==1))&&(p125==1))) + AF((...180
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(((E(TRUE U (((p51==1)&&(p95==1))&&(p125==1))) + !(EG(!((p10==1))))) + (p144==1))))) * !(((((p...447
Reverse transition relation is NOT exact ! Due to transitions t15, t17, t22, t47, t48, t50, t59, Intersection with reachable at each step enabled. (destro...194
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.74935,23900,1,0,204,96026,240,117,3711,75337,284
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 154 edges and 177 vertex of which 12 / 177 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 169 transition count 404
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 57 rules applied. Total rules applied 94 place count 133 transition count 383
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 383
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 106 place count 121 transition count 376
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 114 transition count 376
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 133 place count 101 transition count 312
Iterating global reduction 3 with 13 rules applied. Total rules applied 146 place count 101 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 146 place count 101 transition count 310
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 150 place count 99 transition count 310
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 93 transition count 190
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 93 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 91 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 91 transition count 150
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 220 place count 64 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 223 place count 61 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 226 place count 61 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 233 place count 61 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 241 place count 57 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 56 transition count 104
Applied a total of 242 rules in 37 ms. Remains 56 /177 variables (removed 121) and now considering 104/449 (removed 345) transitions.
[2026-06-02 04:12:43] [INFO ] Flow matrix only has 97 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2661706280943934609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5311185295979195360.kers'
[2026-06-02 04:12:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2661706280943934609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5311185295979195360.kers]
Normalized transition count is 96 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 96 rows 54 cols 662 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-06-02 04:12:43] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5311185295979195360.kers
Total runtime 2 ms.
[2026-06-02 04:12:43] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-06-02 04:12:43] [INFO ] Flow matrix only has 97 transitions (discarded 7 similar events)
[2026-06-02 04:12:43] [INFO ] Invariant cache hit.
[2026-06-02 04:12:43] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2026-06-02 04:12:43] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2026-06-02 04:12:43] [INFO ] Flow matrix only has 97 transitions (discarded 7 similar events)
[2026-06-02 04:12:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 96/152 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/153 variables, and 72 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 96/152 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 86/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/153 variables, and 158 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5799 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10177ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 10178ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/177 places, 104/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10467 ms. Remains : 56/177 places, 104/449 transitions.
[2026-06-02 04:12:53] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:53] [INFO ] Flatten gal took : 7 ms
[2026-06-02 04:12:53] [INFO ] Input system was already deterministic with 104 transitions.
[2026-06-02 04:12:53] [INFO ] Flatten gal took : 6 ms
[2026-06-02 04:12:53] [INFO ] Flatten gal took : 9 ms
[2026-06-02 04:12:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8012110815892532447.gal : 2 ms
[2026-06-02 04:12:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15188285225693366574.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/ReachabilityCardinality8012110815892532447.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15188285225693366574.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15188285225693366574.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 192
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :192 after 608
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :608 after 5120
Reachability property ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-12 is true.
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.19424e+06,0.134325,5716,2,671,12,4646,6,0,327,3932,0
Total reachable state count : 1194240
Verifying 1 reachability properties.
Reachability property ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-12 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-12,1,0.136086,5924,2,57,12,4646,7,0,345,3932,0
RANDOM walk for 40000 steps (1100 resets) in 945 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2291275 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :0 out of 1
Probabilistic random walk after 2291275 steps, saw 338855 distinct states, run finished after 3009 ms. (steps per millisecond=761 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 162 transition count 434
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 162 transition count 434
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 156 transition count 428
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 156 transition count 428
Applied a total of 42 rules in 6 ms. Remains 156 /177 variables (removed 21) and now considering 428/449 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7185525045998035435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16573743410538295512.kers'
[2026-06-02 04:12:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7185525045998035435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16573743410538295512.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 428 rows 156 cols 3788 entries
Finished phase 1 with 137 SingleSign rule and 3 generalized
[2026-06-02 04:12:57] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16573743410538295512.kers
Total runtime 6 ms.
[2026-06-02 04:12:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-06-02 04:12:57] [INFO ] Invariant cache hit.
[2026-06-02 04:12:57] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-06-02 04:12:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/584 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/584 variables, and 172 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 427/346 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 428/584 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 346/518 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 584/584 variables, and 519 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 427/346 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60639ms
Starting structural reductions in LTL mode, iteration 1 : 156/177 places, 428/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60966 ms. Remains : 156/177 places, 428/449 transitions.
[2026-06-02 04:13:58] [INFO ] Flatten gal took : 36 ms
[2026-06-02 04:13:58] [INFO ] Flatten gal took : 37 ms
[2026-06-02 04:13:58] [INFO ] Input system was already deterministic with 428 transitions.
[2026-06-02 04:13:58] [INFO ] Flatten gal took : 36 ms
[2026-06-02 04:13:58] [INFO ] Flatten gal took : 36 ms
[2026-06-02 04:13:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3517559006643816184.gal : 7 ms
[2026-06-02 04:13:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1946232926833806764.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/CTLFireability3517559006643816184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1946232926833806764.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11277e+10,2.17627,48940,2,11280,5,133436,6,0,1054,152414,0
Converting to forward existential form...Done !
original formula: (A(!((AG(((AX((p1==1)) + (p14==1)) + ((((p4==1)&&(p27==1))&&((p35==1)&&(p65==1)))&&((p84==1)&&(p131==1))))) + EF((((((p2==1)&&(p21==1))&&...1038
=> equivalent forward existential formula: ([((Init * !(EG(!((!((E((p143==1) U (((p160==1)&&(p183==1))&&(p228==1))) * !((((p160==1)&&(p175==1))&&(p228==1))...2271
Reverse transition relation is NOT exact ! Due to transitions t13, t18, t21, t29, t74, t77, t84, t91, t97, t98, t102, t103, t107, t110, t112, t113, t116, t...777
Detected timeout of ITS tools.
[2026-06-02 04:14:28] [INFO ] Flatten gal took : 31 ms
[2026-06-02 04:14:28] [INFO ] Applying decomposition
[2026-06-02 04:14:28] [INFO ] Flatten gal took : 31 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/graph17283830623569286178.txt' '-o' '/tmp/graph17283830623569286178.bin' '-w' '/tmp/graph17283830623569286178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17283830623569286178.bin' '-l' '-1' '-v' '-w' '/tmp/graph17283830623569286178.weights' '-q' '0' '-e' '0.001'
[2026-06-02 04:14:28] [INFO ] Decomposing Gal with order
[2026-06-02 04:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:14:28] [INFO ] Removed a total of 136 redundant transitions.
[2026-06-02 04:14:28] [INFO ] Flatten gal took : 63 ms
[2026-06-02 04:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2026-06-02 04:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11073635465206933780.gal : 11 ms
[2026-06-02 04:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15104384885956030691.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/CTLFireability11073635465206933780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15104384885956030691.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 160 transition count 424
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 160 transition count 424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 152 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 152 transition count 416
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 150 transition count 414
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 150 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 149 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 149 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 148 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 148 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 147 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 147 transition count 406
Applied a total of 60 rules in 13 ms. Remains 147 /177 variables (removed 30) and now considering 406/449 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7353699005917149166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6649929535274916284.kers'
[2026-06-02 04:14:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7353699005917149166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6649929535274916284.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 406 rows 147 cols 3684 entries
Finished phase 1 with 128 SingleSign rule and 3 generalized
[2026-06-02 04:14:58] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6649929535274916284.kers
Total runtime 9 ms.
[2026-06-02 04:14:59] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-06-02 04:14:59] [INFO ] Invariant cache hit.
[2026-06-02 04:14:59] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-06-02 04:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (OVERLAPS) 406/553 variables, 147/163 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 163 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 405/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (OVERLAPS) 406/553 variables, 147/163 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 324/487 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 487 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 405/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60724ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60726ms
Starting structural reductions in LTL mode, iteration 1 : 147/177 places, 406/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 147/177 places, 406/449 transitions.
[2026-06-02 04:16:00] [INFO ] Flatten gal took : 33 ms
[2026-06-02 04:16:00] [INFO ] Flatten gal took : 36 ms
[2026-06-02 04:16:00] [INFO ] Input system was already deterministic with 406 transitions.
[2026-06-02 04:16:00] [INFO ] Flatten gal took : 57 ms
[2026-06-02 04:16:00] [INFO ] Flatten gal took : 37 ms
[2026-06-02 04:16:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1365916773300854198.gal : 8 ms
[2026-06-02 04:16:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2586868013032403432.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/CTLFireability1365916773300854198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2586868013032403432.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22966e+10,2.16488,39344,2,10726,5,99636,6,0,996,112248,0
Converting to forward existential form...Done !
original formula: AG(A((AX((p68==1)) * (((p226==1) + E(((((p4==1)&&(p27==1))&&((p39==1)&&(p65==1)))&&((p73==1)&&(p131==1))) U ((((p4==1)&&(p16==1))&&((p35=...412
=> equivalent forward existential formula: ([(FwdU(((FwdU(FwdU(Init,TRUE),!((!(E(TRUE U !(!(!(EG(!(((((p2==1)&&(p17==1))&&((p36==1)&&(p55==1)))&&(((p74==1)...1024
Reverse transition relation is NOT exact ! Due to transitions t2, t12, t16, t19, t22, t30, t70, t73, t80, t86, t92, t93, t97, t98, t102, t106, t107, t110, ...784
Detected timeout of ITS tools.
[2026-06-02 04:16:30] [INFO ] Flatten gal took : 21 ms
[2026-06-02 04:16:30] [INFO ] Applying decomposition
[2026-06-02 04:16:30] [INFO ] Flatten gal took : 21 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/graph8912174996307397221.txt' '-o' '/tmp/graph8912174996307397221.bin' '-w' '/tmp/graph8912174996307397221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8912174996307397221.bin' '-l' '-1' '-v' '-w' '/tmp/graph8912174996307397221.weights' '-q' '0' '-e' '0.001'
[2026-06-02 04:16:30] [INFO ] Decomposing Gal with order
[2026-06-02 04:16:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:16:30] [INFO ] Removed a total of 102 redundant transitions.
[2026-06-02 04:16:30] [INFO ] Flatten gal took : 33 ms
[2026-06-02 04:16:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2026-06-02 04:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8160218040243646285.gal : 5 ms
[2026-06-02 04:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13913408690737759826.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/CTLFireability8160218040243646285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13913408690737759826.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 SI_CTL mode, iteration 0 : 177/177 places, 449/449 transitions.
Graph (trivial) has 154 edges and 177 vertex of which 12 / 177 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 169 transition count 404
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 57 rules applied. Total rules applied 94 place count 133 transition count 383
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 106 place count 121 transition count 383
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 106 place count 121 transition count 376
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 114 transition count 376
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 132 place count 102 transition count 330
Iterating global reduction 3 with 12 rules applied. Total rules applied 144 place count 102 transition count 330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 144 place count 102 transition count 328
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 148 place count 100 transition count 328
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 154 place count 94 transition count 226
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 94 transition count 226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 91 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 91 transition count 150
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 220 place count 64 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 60 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 60 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 234 place count 60 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 240 place count 57 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 56 transition count 104
Applied a total of 241 rules in 54 ms. Remains 56 /177 variables (removed 121) and now considering 104/449 (removed 345) transitions.
[2026-06-02 04:17:00] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12662675057899665978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9778826036847301390.kers'
[2026-06-02 04:17:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12662675057899665978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9778826036847301390.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 98 rows 54 cols 674 entries
Finished phase 1 with 38 SingleSign rule and 2 generalized
[2026-06-02 04:17:00] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9778826036847301390.kers
Total runtime 2 ms.
[2026-06-02 04:17:00] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-06-02 04:17:00] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2026-06-02 04:17:00] [INFO ] Invariant cache hit.
[2026-06-02 04:17:01] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-06-02 04:17:01] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2026-06-02 04:17:01] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2026-06-02 04:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 98/154 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 72 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 5/56 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 98/154 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 86/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/154 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 159 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6365 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9886ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 9887ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/177 places, 104/449 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10228 ms. Remains : 56/177 places, 104/449 transitions.
[2026-06-02 04:17:10] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:17:10] [INFO ] Flatten gal took : 3 ms
[2026-06-02 04:17:10] [INFO ] Input system was already deterministic with 104 transitions.
[2026-06-02 04:17:10] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:17:10] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:17:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4516459001715081613.gal : 1 ms
[2026-06-02 04:17:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13389801506862277315.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4516459001715081613.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13389801506862277315.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13389801506862277315.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 88
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :88 after 208
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :208 after 1056
Reachability property ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-15 is true.
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,15536,0.065703,5660,2,581,10,3504,6,0,327,3010,0
Total reachable state count : 15536
Verifying 1 reachability properties.
RANDOM walk for 40000 steps (1126 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
Reachability property ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-15 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ErlangenMainframeV2-PT-bP04C04-CTLFireability-2024-15,1,0.066766,5816,2,57,10,3504,7,0,345,3010,0
BEST_FIRST walk for 40004 steps (181 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 693681 steps, run visited all 1 properties in 899 ms. (steps per millisecond=771 )
Probabilistic random walk after 693681 steps, saw 153043 distinct states, run finished after 906 ms. (steps per millisecond=765 ) properties seen :1
[2026-06-02 04:17:12] [INFO ] Flatten gal took : 22 ms
[2026-06-02 04:17:12] [INFO ] Flatten gal took : 23 ms
[2026-06-02 04:17:12] [INFO ] Applying decomposition
[2026-06-02 04:17:12] [INFO ] Flatten gal took : 22 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/graph10878161973214136881.txt' '-o' '/tmp/graph10878161973214136881.bin' '-w' '/tmp/graph10878161973214136881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10878161973214136881.bin' '-l' '-1' '-v' '-w' '/tmp/graph10878161973214136881.weights' '-q' '0' '-e' '0.001'
[2026-06-02 04:17:12] [INFO ] Decomposing Gal with order
[2026-06-02 04:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:17:12] [INFO ] Removed a total of 147 redundant transitions.
[2026-06-02 04:17:12] [INFO ] Flatten gal took : 59 ms
[2026-06-02 04:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2026-06-02 04:17:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2962547156417676344.gal : 6 ms
[2026-06-02 04:17:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8719975587990160147.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/CTLFireability2962547156417676344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8719975587990160147.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 3 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.22824e+11,407.553,4585960,1838,34450,224218,3.37374e+06,518,4.46864e+06,514,8.2475e+07,0
Converting to forward existential form...Done !
original formula: !(E((!((((((u1.p4==1)&&(u1.p16==1))&&((u1.p46==1)&&(u1.p65==1)))&&((u1.p77==1)&&(u1.p131==1))) + !((AG((i5.i1.u30.p188==1)) + (i2.u14.p10...456
=> equivalent forward existential formula: [(FwdU(Init,(!((((((u1.p4==1)&&(u1.p16==1))&&((u1.p46==1)&&(u1.p65==1)))&&((u1.p77==1)&&(u1.p131==1))) + !((!(E(...522
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t23, t86, t87, u1.t133, u1.t136, u1.t137, u1.t138, u1.t139, u1.t140, u1.t141, u1.t14...1327
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
[2026-06-02 04:42:41] [INFO ] Applying decomposition
[2026-06-02 04:42:41] [INFO ] Flatten gal took : 24 ms
[2026-06-02 04:42:41] [INFO ] Decomposing Gal with order
[2026-06-02 04:42:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:42:41] [INFO ] Removed a total of 1683 redundant transitions.
[2026-06-02 04:42:41] [INFO ] Flatten gal took : 50 ms
[2026-06-02 04:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 14 ms.
[2026-06-02 04:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12768990101716095227.gal : 2 ms
[2026-06-02 04:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12343981439964262979.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/CTLFireability12768990101716095227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12343981439964262979.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 3 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.22824e+11,0.226673,11352,615,595,11119,3425,291,35382,265,18403,0
Converting to forward existential form...Done !
original formula: !(E((!((((((u1.p4==1)&&(i1.i0.i0.i0.i0.u7.p16==1))&&((i1.i0.i0.i0.i0.u8.p46==1)&&(i1.i0.i0.i0.u9.p65==1)))&&((i1.i0.i0.u10.p77==1)&&(i1.i...690
=> equivalent forward existential formula: [(FwdU(Init,(!((((((u1.p4==1)&&(i1.i0.i0.i0.i0.u7.p16==1))&&((i1.i0.i0.i0.i0.u8.p46==1)&&(i1.i0.i0.i0.u9.p65==1)...756
Reverse transition relation is NOT exact ! Due to transitions t181, u1.t133, i1.i0.i0.t111, i1.i0.i0.u10.t114, i1.i0.i0.u10.t116, i1.i0.i0.u10.t427, i1.i0....933
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="ErlangenMainframeV2-PT-bP04C04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP04C04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499200234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP04C04.tgz
mv ErlangenMainframeV2-PT-bP04C04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;