About the Execution of ITS-Tools for DBSingleClientW-PT-d0m07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2660.027 | 1042584.00 | 1102406.00 | 2868.80 | FTTTFTFTTFFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993500106.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 DBSingleClientW-PT-d0m07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d0m07-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779553787109
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 16:29:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:29:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:29:49] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2026-05-23 16:29:49] [INFO ] Transformed 553 places.
[2026-05-23 16:29:49] [INFO ] Transformed 150 transitions.
[2026-05-23 16:29:49] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 64 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 98 transition count 135
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 98 transition count 135
Applied a total of 26 rules in 43 ms. Remains 98 /109 variables (removed 11) and now considering 135/150 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2101426271346722586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18342576634130031824.kers'
[2026-05-23 16:29:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2101426271346722586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18342576634130031824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 98 cols 406 entries
Finished phase 1 with 94 SingleSign rule and 2 generalized
[2026-05-23 16:29:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18342576634130031824.kers
Total runtime 4 ms.
[2026-05-23 16:29:50] [INFO ] Implicit Places using invariants in 467 ms returned []
[2026-05-23 16:29:50] [INFO ] Invariant cache hit.
[2026-05-23 16:29:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 16:29:50] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-23 16:29:50] [INFO ] Invariant cache hit.
[2026-05-23 16:29:50] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 60/160 constraints. Problems are: Problem set: 0 solved, 134 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 160 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 60/160 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 134/294 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 294 constraints, problems are : Problem set: 0 solved, 134 unsolved in 26949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33998ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 34025ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 135/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35067 ms. Remains : 98/109 places, 135/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-23 16:30:24] [INFO ] Invariant cache hit.
[2026-05-23 16:30:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 16:30:25] [INFO ] Invariant cache hit.
[2026-05-23 16:30:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 16:30:25] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 98/98 places, 135/135 transitions.
Support contains 64 out of 98 places after structural reductions.
[2026-05-23 16:30:25] [INFO ] Flatten gal took : 168 ms
[2026-05-23 16:30:25] [INFO ] Flatten gal took : 22 ms
[2026-05-23 16:30:25] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (9198 resets) in 3475 ms. (11 steps per ms) remains 33/58 properties
BEST_FIRST walk for 4003 steps (442 resets) in 51 ms. (76 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (215 resets) in 55 ms. (71 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (207 resets) in 50 ms. (78 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (176 resets) in 111 ms. (35 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (398 resets) in 113 ms. (35 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (197 resets) in 67 ms. (58 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (201 resets) in 86 ms. (46 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (178 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (209 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (201 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (386 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (154 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (169 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (397 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (203 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (194 resets) in 36 ms. (108 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (200 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (187 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (402 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (207 resets) in 50 ms. (78 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (197 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (211 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (195 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (199 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (198 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (189 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (204 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (412 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (398 resets) in 28 ms. (137 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (215 resets) in 63 ms. (62 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (336 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (203 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
[2026-05-23 16:30:27] [INFO ] Invariant cache hit.
[2026-05-23 16:30:27] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/65 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 16/81 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 124/205 variables, 81/83 constraints. Problems are: Problem set: 5 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 49/132 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 28/233 variables, 17/149 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 11/160 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 3/163 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 4/167 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/167 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 0/167 constraints. Problems are: Problem set: 5 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 167 constraints, problems are : Problem set: 5 solved, 27 unsolved in 4864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 30/62 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 17/79 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 120/199 variables, 79/81 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 45/126 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/127 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/127 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 34/233 variables, 19/146 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 15/161 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 26/187 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 7/194 constraints. Problems are: Problem set: 5 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 194 constraints, problems are : Problem set: 5 solved, 27 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 27/32 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9921ms problems are : Problem set: 5 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 135/135 transitions.
Graph (complete) has 292 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 91 transition count 127
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 91 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 91 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 90 transition count 123
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 90 transition count 123
Applied a total of 20 rules in 40 ms. Remains 90 /98 variables (removed 8) and now considering 123/135 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 90/98 places, 123/135 transitions.
RANDOM walk for 40000 steps (9153 resets) in 531 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (382 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (203 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (203 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (198 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (408 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (209 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (222 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (166 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (199 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (216 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (412 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (144 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (182 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (383 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (219 resets) in 15 ms. (250 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4004 steps (200 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (188 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (403 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (188 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (171 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (191 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (203 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (182 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (429 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (225 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (396 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12321567115084197434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13956484836864754000.kers'
[2026-05-23 16:30:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12321567115084197434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13956484836864754000.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 90 cols 373 entries
Finished phase 1 with 85 SingleSign rule and 3 generalized
[2026-05-23 16:30:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13956484836864754000.kers
Total runtime 2 ms.
[2026-05-23 16:30:37] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 112/184 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 29/213 variables, 18/134 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 11/145 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1937 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 112/184 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 42/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 29/213 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 11/146 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 23/169 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 169 constraints, problems are : Problem set: 0 solved, 24 unsolved in 6308 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8300ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 4 properties in 1293 ms.
Support contains 26 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 122
Applied a total of 2 rules in 18 ms. Remains 89 /90 variables (removed 1) and now considering 122/123 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 89/90 places, 122/123 transitions.
RANDOM walk for 40000 steps (9177 resets) in 328 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (200 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (181 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (175 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (193 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (197 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (389 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (154 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (184 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (416 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (171 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (200 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (383 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (202 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (186 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (193 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (415 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (197 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (420 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 43113 steps, run visited all 20 properties in 427 ms. (steps per millisecond=100 )
Probabilistic random walk after 43113 steps, saw 19164 distinct states, run finished after 435 ms. (steps per millisecond=99 ) properties seen :20
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 16:30:48] [INFO ] Flatten gal took : 25 ms
[2026-05-23 16:30:48] [INFO ] Flatten gal took : 15 ms
[2026-05-23 16:30:48] [INFO ] Input system was already deterministic with 135 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 328 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 98
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 71 transition count 90
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 70 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 69 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 68 transition count 81
Applied a total of 65 rules in 21 ms. Remains 68 /98 variables (removed 30) and now considering 81/135 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2994539644882431240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7818120762113344886.kers'
[2026-05-23 16:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2994539644882431240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7818120762113344886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 68 cols 263 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-23 16:30:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7818120762113344886.kers
Total runtime 1 ms.
[2026-05-23 16:30:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 16:30:48] [INFO ] Invariant cache hit.
[2026-05-23 16:30:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 16:30:48] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-23 16:30:48] [INFO ] Invariant cache hit.
[2026-05-23 16:30:48] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/149 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 97 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/149 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 80/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 177 constraints, problems are : Problem set: 0 solved, 80 unsolved in 11655 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14886ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 14887ms
Starting structural reductions in LTL mode, iteration 1 : 68/98 places, 81/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15163 ms. Remains : 68/98 places, 81/135 transitions.
[2026-05-23 16:31:03] [INFO ] Flatten gal took : 10 ms
[2026-05-23 16:31:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:31:03] [INFO ] Input system was already deterministic with 81 transitions.
[2026-05-23 16:31:03] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:31:03] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:31:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6194410601846645696.gal : 3 ms
[2026-05-23 16:31:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11699535815622461449.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6194410601846645696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11699535815622461449.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.25603e+06,2.85681,68964,2,10624,5,273283,6,0,353,228705,0
Converting to forward existential form...Done !
original formula: AG((EF(AG(((s6>=1)&&(l0>=1)))) * E(AX(AF(((s1>=1)&&(l502>=1)))) U ((EX(((s1>=1)&&(l127>=1))) * EX(((p20>=1)&&(l115>=1)))) * ((s1>=1)&&(l1...166
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((s6>=1)&&(l0>=1))))))))] = FALSE * [(FwdU(Init,TRUE) * !(E(!(EX(!(...283
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t29, t49, t52, t53, t54, t58, t59, t60, t61, t62, t63, t64, t65, t6...326
(forward)formula 0,0,17.9903,387564,1,0,296,2.2226e+06,191,122,2430,1.80103e+06,341
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 99
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 98
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 69 transition count 90
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 66 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 66 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 77
Applied a total of 74 rules in 48 ms. Remains 64 /98 variables (removed 34) and now considering 77/135 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3515636084685457991.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2276357191208181658.kers'
[2026-05-23 16:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3515636084685457991.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2276357191208181658.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 64 cols 247 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:31:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2276357191208181658.kers
Total runtime 1 ms.
[2026-05-23 16:31:21] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-23 16:31:21] [INFO ] Invariant cache hit.
[2026-05-23 16:31:22] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 16:31:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2026-05-23 16:31:22] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-23 16:31:22] [INFO ] Invariant cache hit.
[2026-05-23 16:31:22] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 94 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/141 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 76/170 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 170 constraints, problems are : Problem set: 0 solved, 76 unsolved in 9221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12362ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 12363ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/98 places, 77/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12719 ms. Remains : 64/98 places, 77/135 transitions.
[2026-05-23 16:31:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:31:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:31:34] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-23 16:31:34] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:31:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:31:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10152647232129779974.gal : 5 ms
[2026-05-23 16:31:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10985237792091291912.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10152647232129779974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10985237792091291912.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.19648e+06,1.79994,48228,2,10855,5,159889,6,0,333,190724,0
Converting to forward existential form...Done !
original formula: EG(((EF((((s1>=1)&&(l335>=1))&&((s1>=1)&&(l149>=1)))) + AF((((s1>=1)&&(l116>=1))||((s1>=1)&&(l90>=1))))) + ((s1>=1)&&(l345>=1))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((s1>=1)&&(l335>=1))&&((s1>=1)&&(l149>=1)))) + !(EG(!((((s1>=1)&&(l116>=1))||((s1>=1)&&(l...202
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t51, t56, t5...351
Detected timeout of ITS tools.
[2026-05-23 16:32:04] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:32:04] [INFO ] Applying decomposition
[2026-05-23 16:32:04] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15152829245249015688.txt' '-o' '/tmp/graph15152829245249015688.bin' '-w' '/tmp/graph15152829245249015688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15152829245249015688.bin' '-l' '-1' '-v' '-w' '/tmp/graph15152829245249015688.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:32:04] [INFO ] Decomposing Gal with order
[2026-05-23 16:32:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:32:04] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-23 16:32:04] [INFO ] Flatten gal took : 88 ms
[2026-05-23 16:32:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 11 ms.
[2026-05-23 16:32:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12392085793012708490.gal : 4 ms
[2026-05-23 16:32:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13978932506391779495.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/CTLFireability12392085793012708490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13978932506391779495.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19648e+06,1.52344,37764,820,458,40108,4507,229,161761,82,48119,0
Converting to forward existential form...Done !
original formula: EG(((EF((((i3.u0.s1>=1)&&(i3.u0.l335>=1))&&((i3.u0.s1>=1)&&(u7.l149>=1)))) + AF((((i3.u0.s1>=1)&&(i3.u2.l116>=1))||((i3.u0.s1>=1)&&(u7.l9...198
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((i3.u0.s1>=1)&&(i3.u0.l335>=1))&&((i3.u0.s1>=1)&&(u7.l149>=1)))) + !(EG(!((((i3.u0.s1>=1...253
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t30, t51, t56, t57, t58, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, ...309
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,10.4257,193408,1,0,252150,26101,1042,852956,510,239119,430035
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 81 transition count 106
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 81 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 81 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 76 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 76 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 75 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 75 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 74 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 74 transition count 96
Applied a total of 50 rules in 11 ms. Remains 74 /98 variables (removed 24) and now considering 96/135 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3931645718980860788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2614316084564072066.kers'
[2026-05-23 16:32:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3931645718980860788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2614316084564072066.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 74 cols 303 entries
Finished phase 1 with 70 SingleSign rule and 2 generalized
[2026-05-23 16:32:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2614316084564072066.kers
Total runtime 2 ms.
[2026-05-23 16:32:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-23 16:32:15] [INFO ] Invariant cache hit.
[2026-05-23 16:32:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-23 16:32:15] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-23 16:32:15] [INFO ] Invariant cache hit.
[2026-05-23 16:32:15] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/170 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 36/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 117 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/170 variables, 74/81 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 36/117 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 95/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 212 constraints, problems are : Problem set: 0 solved, 95 unsolved in 18381 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24638ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 24639ms
Starting structural reductions in LTL mode, iteration 1 : 74/98 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25084 ms. Remains : 74/98 places, 96/135 transitions.
[2026-05-23 16:32:40] [INFO ] Flatten gal took : 11 ms
[2026-05-23 16:32:40] [INFO ] Flatten gal took : 11 ms
[2026-05-23 16:32:40] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-23 16:32:40] [INFO ] Flatten gal took : 10 ms
[2026-05-23 16:32:40] [INFO ] Flatten gal took : 10 ms
[2026-05-23 16:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability16519715603109282032.gal : 3 ms
[2026-05-23 16:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5797717662589897037.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16519715603109282032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5797717662589897037.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.07992e+06,6.45633,150900,2,16571,5,664687,6,0,392,400032,0
Converting to forward existential form...Done !
original formula: E((!(A(((!(((s1>=1)&&(l36>=1))) * EX(((s1>=1)&&(l491>=1)))) * A(((s1>=1)&&(l91>=1)) U ((s1>=1)&&(l353>=1)))) U ((E(((s1>=1)&&(l491>=1)) U...353
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(!((E(!(((E(((s1>=1)&&(l491>=1)) U ((s1>=1)&&(l127>=1))) + EX(((s1>=1)&&(l124>=1)))) + (((s1>...863
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t47, t48, t49, t57, t58, t59, t61, t62, t63, t65, t72, t7...366
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-23 16:33:10] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:33:10] [INFO ] Applying decomposition
[2026-05-23 16:33:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18389323348647072726.txt' '-o' '/tmp/graph18389323348647072726.bin' '-w' '/tmp/graph18389323348647072726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18389323348647072726.bin' '-l' '-1' '-v' '-w' '/tmp/graph18389323348647072726.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:33:10] [INFO ] Decomposing Gal with order
[2026-05-23 16:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:33:10] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-23 16:33:10] [INFO ] Flatten gal took : 22 ms
[2026-05-23 16:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 7 ms.
[2026-05-23 16:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3301506818799510293.gal : 3 ms
[2026-05-23 16:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability17593367333187454215.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/CTLFireability3301506818799510293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17593367333187454215.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.07992e+06,2.47335,63876,1362,927,67054,28710,294,255689,120,236153,0
Converting to forward existential form...Done !
original formula: E((!(A(((!(((i5.u0.s1>=1)&&(i2.u5.l36>=1))) * EX(((i5.u0.s1>=1)&&(i0.u14.l491>=1)))) * A(((i5.u0.s1>=1)&&(i3.u7.l91>=1)) U ((i5.u0.s1>=1)...493
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(!((E(!(((E(((i5.u0.s1>=1)&&(i0.u14.l491>=1)) U ((i5.u0.s1>=1)&&(u9.l127>=1))) + EX(((i5.u0.s...1167
Reverse transition relation is NOT exact ! Due to transitions t6, t24, t25, t29, t47, t48, t49, t56, t57, t58, t59, t61, t62, t63, t72, t73, t74, t75, t76,...354
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,18.7384,371328,1,0,314575,102721,1396,1.93247e+06,751,2.12439e+06,353514
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 99
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 78 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 72 transition count 91
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 72 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 70 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 69 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 68 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 68 transition count 83
Applied a total of 64 rules in 18 ms. Remains 68 /98 variables (removed 30) and now considering 83/135 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14163970784343227418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7211489915981178688.kers'
[2026-05-23 16:33:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14163970784343227418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7211489915981178688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 68 cols 271 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-23 16:33:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7211489915981178688.kers
Total runtime 0 ms.
[2026-05-23 16:33:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 16:33:29] [INFO ] Invariant cache hit.
[2026-05-23 16:33:29] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 16:33:29] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2026-05-23 16:33:30] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2026-05-23 16:33:30] [INFO ] Invariant cache hit.
[2026-05-23 16:33:30] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/151 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 97 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/151 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 82/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 179 constraints, problems are : Problem set: 0 solved, 82 unsolved in 9991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13319ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 13320ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/98 places, 83/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13702 ms. Remains : 68/98 places, 83/135 transitions.
[2026-05-23 16:33:43] [INFO ] Flatten gal took : 9 ms
[2026-05-23 16:33:43] [INFO ] Flatten gal took : 10 ms
[2026-05-23 16:33:43] [INFO ] Input system was already deterministic with 83 transitions.
[2026-05-23 16:33:43] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:33:43] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:33:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16587200087225764535.gal : 2 ms
[2026-05-23 16:33:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11804346631772488760.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/CTLFireability16587200087225764535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11804346631772488760.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.22983e+06,3.87564,92192,2,9989,5,400845,6,0,355,285704,0
Converting to forward existential form...Done !
original formula: EG((EG((((s1<1)||(l353<1))||((s1<1)||(l110<1)))) + AG((((s1<1)||(l485<1))||((s1<1)||(l505<1))))))
=> equivalent forward existential formula: [FwdG(Init,(EG((((s1<1)||(l353<1))||((s1<1)||(l110<1)))) + !(E(TRUE U !((((s1<1)||(l485<1))||((s1<1)||(l505<1)))...170
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t46, t47, t54, t56, t60, t61, t62, t63, t64, t65, t66, t67, t6...326
Detected timeout of ITS tools.
[2026-05-23 16:34:13] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:34:13] [INFO ] Applying decomposition
[2026-05-23 16:34:13] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16737015024297311317.txt' '-o' '/tmp/graph16737015024297311317.bin' '-w' '/tmp/graph16737015024297311317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16737015024297311317.bin' '-l' '-1' '-v' '-w' '/tmp/graph16737015024297311317.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:34:13] [INFO ] Decomposing Gal with order
[2026-05-23 16:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:34:13] [INFO ] Removed a total of 80 redundant transitions.
[2026-05-23 16:34:13] [INFO ] Flatten gal took : 11 ms
[2026-05-23 16:34:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 4 ms.
[2026-05-23 16:34:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5142396478222694848.gal : 2 ms
[2026-05-23 16:34:13] [INFO ] Time to serialize properties into /tmp/CTLFireability13459793314531838490.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/CTLFireability5142396478222694848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13459793314531838490.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22983e+06,2.25622,63408,1271,461,54833,5402,273,477615,82,39572,0
Converting to forward existential form...Done !
original formula: EG((EG((((i3.u0.s1<1)||(i1.u10.l353<1))||((i3.u0.s1<1)||(i2.u5.l110<1)))) + AG((((i3.u0.s1<1)||(i4.u12.l485<1))||((i3.u0.s1<1)||(i5.u3.l5...165
=> equivalent forward existential formula: [FwdG(Init,(EG((((i3.u0.s1<1)||(i1.u10.l353<1))||((i3.u0.s1<1)||(i2.u5.l110<1)))) + !(E(TRUE U !((((i3.u0.s1<1)|...220
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t28, t42, t45, t46, t47, t54, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t71, ...326
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,15.9938,337332,1,0,394608,23119,1182,2.26811e+06,529,228077,680294
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 79 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 71 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 71 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 69 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 69 transition count 82
Applied a total of 63 rules in 6 ms. Remains 69 /98 variables (removed 29) and now considering 82/135 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8030195180371972804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15617536960963993790.kers'
[2026-05-23 16:34:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8030195180371972804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15617536960963993790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 69 cols 276 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-23 16:34:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15617536960963993790.kers
Total runtime 1 ms.
[2026-05-23 16:34:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 16:34:29] [INFO ] Invariant cache hit.
[2026-05-23 16:34:29] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 16:34:30] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-23 16:34:30] [INFO ] Invariant cache hit.
[2026-05-23 16:34:30] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/151 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (OVERLAPS) 0/151 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 114 constraints, problems are : Problem set: 0 solved, 81 unsolved in 10891 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/151 variables, 69/91 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 81/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 195 constraints, problems are : Problem set: 0 solved, 81 unsolved in 16925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27867ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 27868ms
Starting structural reductions in LTL mode, iteration 1 : 69/98 places, 82/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28266 ms. Remains : 69/98 places, 82/135 transitions.
[2026-05-23 16:34:57] [INFO ] Flatten gal took : 11 ms
[2026-05-23 16:34:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:34:57] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-23 16:34:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:34:57] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:34:57] [INFO ] Time to serialize gal into /tmp/CTLFireability8137748982743269301.gal : 2 ms
[2026-05-23 16:34:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16454384938648011009.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/CTLFireability8137748982743269301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16454384938648011009.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93391e+06,3.66799,85988,2,12620,5,310581,6,0,358,302512,0
Converting to forward existential form...Done !
original formula: A((EF((!(((((p22>=1)&&(l0>=1))&&((s1>=1)&&(l90>=1)))||((s1>=1)&&(l510>=1)))) + !(AG(((p36>=1)&&(l137>=1)))))) + AG(!(E(AX(((s1>=1)&&(l110...215
=> equivalent forward existential formula: [((Init * !(EG(!(((s1>=1)&&(l484>=1)))))) * !(E(!(((s1>=1)&&(l484>=1))) U (!((E(TRUE U (!(((((p22>=1)&&(l0>=1))&...374
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t6...316
(forward)formula 0,0,29.2789,610092,1,0,444,3.37908e+06,207,197,2555,2.62519e+06,550
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 96
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 96
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 68 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 68 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 68 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 66 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 63 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 63 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 63 transition count 76
Applied a total of 73 rules in 15 ms. Remains 63 /98 variables (removed 35) and now considering 76/135 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4614556008233688193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5993418809084411614.kers'
[2026-05-23 16:35:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4614556008233688193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5993418809084411614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 63 cols 247 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:35:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5993418809084411614.kers
Total runtime 1 ms.
[2026-05-23 16:35:27] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 16:35:27] [INFO ] Invariant cache hit.
[2026-05-23 16:35:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:35:27] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-23 16:35:27] [INFO ] Invariant cache hit.
[2026-05-23 16:35:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/139 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (OVERLAPS) 0/139 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 101 constraints, problems are : Problem set: 0 solved, 75 unsolved in 8435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/139 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 75/176 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 176 constraints, problems are : Problem set: 0 solved, 75 unsolved in 9596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18069ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 18069ms
Starting structural reductions in LTL mode, iteration 1 : 63/98 places, 76/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18374 ms. Remains : 63/98 places, 76/135 transitions.
[2026-05-23 16:35:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:35:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:35:45] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-23 16:35:45] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:35:45] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:35:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17265873775825631955.gal : 2 ms
[2026-05-23 16:35:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1481308262776831424.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/CTLFireability17265873775825631955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1481308262776831424.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09866e+06,1.53159,32064,2,8253,5,115146,6,0,328,109314,0
Converting to forward existential form...Done !
original formula: AF((AX(EG(EX(((s1>=1)&&(l338>=1))))) * EG((EG((((s2>=1)&&(l496>=1))||((s1>=1)&&(l110>=1)))) + AG(((p30<1)||(l0<1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG(EX(((s1>=1)&&(l338>=1))))))) * EG((EG((((s2>=1)&&(l496>=1))||((s1>=1)&&(l110>=1)))) + !(...200
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t6...301
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,24.0965,534944,1,0,687,2.88568e+06,195,398,2343,2.88723e+06,684
FORMULA DBSingleClientW-PT-d0m07-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 : 98/98 places, 135/135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 85 transition count 116
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 85 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 85 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 83 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 83 transition count 112
Applied a total of 32 rules in 4 ms. Remains 83 /98 variables (removed 15) and now considering 112/135 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12975811761787289086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4807160591602107323.kers'
[2026-05-23 16:36:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12975811761787289086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4807160591602107323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 83 cols 345 entries
Finished phase 1 with 79 SingleSign rule and 2 generalized
[2026-05-23 16:36:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4807160591602107323.kers
Total runtime 1 ms.
[2026-05-23 16:36:10] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-23 16:36:10] [INFO ] Invariant cache hit.
[2026-05-23 16:36:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 16:36:10] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-23 16:36:10] [INFO ] Invariant cache hit.
[2026-05-23 16:36:10] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 46/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 131 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 46/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 111/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 242 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35531ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 35533ms
Starting structural reductions in LTL mode, iteration 1 : 83/98 places, 112/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35936 ms. Remains : 83/98 places, 112/135 transitions.
[2026-05-23 16:36:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 16:36:46] [INFO ] Flatten gal took : 7 ms
[2026-05-23 16:36:46] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 16:36:46] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:36:46] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:36:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3171783391478676954.gal : 3 ms
[2026-05-23 16:36:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12606785790766628453.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/CTLFireability3171783391478676954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12606785790766628453.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12937e+07,8.83893,158804,2,11260,5,571638,6,0,444,431838,0
Converting to forward existential form...Done !
original formula: E(((AF(((s1>=1)&&(l339>=1))) + (((EF(((s1>=1)&&(l110>=1))) * !(AF(((s1>=1)&&(l342>=1))))) * (AX(((s1>=1)&&(l0>=1))) * (EX(((p36>=1)&&(l13...658
=> equivalent forward existential formula: (([FwdG(FwdU((FwdU(Init,((!(EG(!(((s1>=1)&&(l339>=1))))) + (((E(TRUE U ((s1>=1)&&(l110>=1))) * !(!(EG(!(((s1>=1)...2169
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55,...462
Detected timeout of ITS tools.
[2026-05-23 16:37:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 16:37:16] [INFO ] Applying decomposition
[2026-05-23 16:37:16] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4065609344085441088.txt' '-o' '/tmp/graph4065609344085441088.bin' '-w' '/tmp/graph4065609344085441088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4065609344085441088.bin' '-l' '-1' '-v' '-w' '/tmp/graph4065609344085441088.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:37:16] [INFO ] Decomposing Gal with order
[2026-05-23 16:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:37:16] [INFO ] Removed a total of 119 redundant transitions.
[2026-05-23 16:37:16] [INFO ] Flatten gal took : 14 ms
[2026-05-23 16:37:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 6 ms.
[2026-05-23 16:37:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7872568351989613229.gal : 2 ms
[2026-05-23 16:37:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11445137599926449720.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/CTLFireability7872568351989613229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11445137599926449720.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12937e+07,7.33032,113076,2194,554,131368,10363,327,448694,91,51797,0
Converting to forward existential form...Done !
original formula: E(((AF(((i0.u1.s1>=1)&&(i6.u0.l339>=1))) + (((EF(((i0.u1.s1>=1)&&(i0.u1.l110>=1))) * !(AF(((i0.u1.s1>=1)&&(i3.u9.l342>=1))))) * (AX(((i0....939
=> equivalent forward existential formula: (([FwdG(FwdU((FwdU(Init,((!(EG(!(((i0.u1.s1>=1)&&(i6.u0.l339>=1))))) + (((E(TRUE U ((i0.u1.s1>=1)&&(i0.u1.l110>=...2944
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t8, t9, t24, t53, t55, t63, t65, t66, t67, t70, t71, t72, t74, t75, t76, t84, t85...399
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 77 transition count 97
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 77 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 77 transition count 96
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 69 transition count 88
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 67 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 76
Applied a total of 73 rules in 18 ms. Remains 64 /98 variables (removed 34) and now considering 76/135 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11618607370961598792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5908593008402188350.kers'
[2026-05-23 16:37:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11618607370961598792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5908593008402188350.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 64 cols 245 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:37:46] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5908593008402188350.kers
Total runtime 3 ms.
[2026-05-23 16:37:46] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 16:37:46] [INFO ] Invariant cache hit.
[2026-05-23 16:37:46] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:37:46] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2026-05-23 16:37:46] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2026-05-23 16:37:46] [INFO ] Invariant cache hit.
[2026-05-23 16:37:46] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 94 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5409 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/140 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 75/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 169 constraints, problems are : Problem set: 0 solved, 75 unsolved in 10431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15881ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 15882ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/98 places, 76/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16258 ms. Remains : 64/98 places, 76/135 transitions.
[2026-05-23 16:38:02] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:38:02] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:38:02] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-23 16:38:02] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:02] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1592786766387612275.gal : 2 ms
[2026-05-23 16:38:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13154739193745965399.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/CTLFireability1592786766387612275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13154739193745965399.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61246e+06,2.03341,51288,2,10916,5,181573,6,0,332,199225,0
Converting to forward existential form...Done !
original formula: (EF(((s1>=1)&&(l488>=1))) + AG(AF(((!(E(((p25>=1)&&(l0>=1)) U ((s1>=1)&&(l338>=1)))) * ((s1<1)||(l7<1))) * ((s1>=1)&&(l336>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U ((s1>=1)&&(l488>=1))))),TRUE),!(((!(E(((p25>=1)&&(l0>=1)) U ((s1>=1)&&(l338>=1))))...210
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t47, t48, t49, t50, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...311
(forward)formula 0,1,10.9574,205748,1,0,224,990647,186,97,2336,902813,252
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 103
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 102
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 72 transition count 95
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 72 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 72 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 71 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 70 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 70 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 69 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 69 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 87
Applied a total of 62 rules in 9 ms. Remains 69 /98 variables (removed 29) and now considering 87/135 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8665452078559364104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11658396340084026507.kers'
[2026-05-23 16:38:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8665452078559364104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11658396340084026507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 69 cols 273 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-23 16:38:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11658396340084026507.kers
Total runtime 2 ms.
[2026-05-23 16:38:13] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 16:38:13] [INFO ] Invariant cache hit.
[2026-05-23 16:38:13] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 16:38:14] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-23 16:38:14] [INFO ] Invariant cache hit.
[2026-05-23 16:38:14] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/156 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 33/104 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 112 constraints, problems are : Problem set: 0 solved, 86 unsolved in 10980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 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/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 87/156 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 33/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 86/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/156 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 198 constraints, problems are : Problem set: 0 solved, 86 unsolved in 21145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32171ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 32172ms
Starting structural reductions in LTL mode, iteration 1 : 69/98 places, 87/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32592 ms. Remains : 69/98 places, 87/135 transitions.
[2026-05-23 16:38:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:46] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-23 16:38:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:46] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5615065536701371739.gal : 2 ms
[2026-05-23 16:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11695894704921516811.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/CTLFireability5615065536701371739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11695894704921516811.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,3.49577e+06,2.0174,47504,2,7654,5,176878,6,0,363,143186,0
Converting to forward existential form...Done !
original formula: !(A(EG(AG(((((s1>=1)&&(l502>=1))||((s1>=1)&&(l33>=1)))&&(((s1>=1)&&(l110>=1))||((s1>=1)&&(l504>=1)))))) U AX(((!(((s1>=1)&&(l338>=1))) * ...212
=> equivalent forward existential formula: (([((EY((FwdU(Init,!(!(EX(!(((!(((s1>=1)&&(l338>=1))) * !(EG(!(((p33>=1)&&(l0>=1)))))) + !(!(EG(!(((p15>=1)&&(l0...820
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t45, t46, t47, t52, t55, t56, t57, t59, t60, t61, t65, t66,...354
(forward)formula 0,0,18.438,351744,1,0,418,1.84098e+06,230,171,2538,1.72825e+06,513
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 74 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 74 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 74 transition count 96
Applied a total of 50 rules in 2 ms. Remains 74 /98 variables (removed 24) and now considering 96/135 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6402249684942462984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6680163646752261649.kers'
[2026-05-23 16:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6402249684942462984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6680163646752261649.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 74 cols 310 entries
Finished phase 1 with 70 SingleSign rule and 2 generalized
[2026-05-23 16:39:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6680163646752261649.kers
Total runtime 1 ms.
[2026-05-23 16:39:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 16:39:05] [INFO ] Invariant cache hit.
[2026-05-23 16:39:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 16:39:05] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-23 16:39:05] [INFO ] Invariant cache hit.
[2026-05-23 16:39:05] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/170 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 109 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/170 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 33/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 95/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 204 constraints, problems are : Problem set: 0 solved, 95 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24496ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 24497ms
Starting structural reductions in LTL mode, iteration 1 : 74/98 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24809 ms. Remains : 74/98 places, 96/135 transitions.
[2026-05-23 16:39:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:39:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:39:29] [INFO ] Input system was already deterministic with 96 transitions.
[2026-05-23 16:39:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:39:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:39:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4027586925808703479.gal : 1 ms
[2026-05-23 16:39:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12982180626724740370.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/CTLFireability4027586925808703479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12982180626724740370.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,4.28916e+06,3.35567,75276,2,11286,5,245325,6,0,392,328094,0
Converting to forward existential form...Done !
original formula: AF((A((!(((s1>=1)&&(l489>=1))) * !(EF(((s1>=1)&&(l509>=1))))) U (((EG(((p23>=1)&&(l0>=1))) * EX(((s1>=1)&&(l504>=1)))) * ((((!((p21>=1)&&...260
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((((EG(((p23>=1)&&(l0>=1))) * EX(((s1>=1)&&(l504>=1)))) * ((((!((p21>=1)&&(l126>=1)))||((p30...644
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t57, t58, t61, t62, t6...386
Detected timeout of ITS tools.
[2026-05-23 16:39:59] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:39:59] [INFO ] Applying decomposition
[2026-05-23 16:39:59] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10809948760996146284.txt' '-o' '/tmp/graph10809948760996146284.bin' '-w' '/tmp/graph10809948760996146284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10809948760996146284.bin' '-l' '-1' '-v' '-w' '/tmp/graph10809948760996146284.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:39:59] [INFO ] Decomposing Gal with order
[2026-05-23 16:39:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:39:59] [INFO ] Removed a total of 98 redundant transitions.
[2026-05-23 16:39:59] [INFO ] Flatten gal took : 10 ms
[2026-05-23 16:39:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 5 ms.
[2026-05-23 16:39:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15006545140134317318.gal : 2 ms
[2026-05-23 16:39:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2603555346430842659.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/CTLFireability15006545140134317318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2603555346430842659.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.28916e+06,3.97649,96612,2005,576,112469,6058,287,608347,78,80281,0
Converting to forward existential form...Done !
original formula: AF((A((!(((i0.u1.s1>=1)&&(i6.u13.l489>=1))) * !(EF(((i0.u1.s1>=1)&&(i0.u15.l509>=1))))) U (((EG(((i4.u10.p23>=1)&&(i0.u1.l0>=1))) * EX(((...374
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((((EG(((i4.u10.p23>=1)&&(i0.u1.l0>=1))) * EX(((i0.u1.s1>=1)&&(i4.u14.l504>=1)))) * ((((!((i...910
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t26, t30, t33, t57, t61, t62, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, ...344
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 75 transition count 93
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 75 transition count 92
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 61 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 70
Applied a total of 80 rules in 19 ms. Remains 61 /98 variables (removed 37) and now considering 70/135 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11669032811936566377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14219707481371546109.kers'
[2026-05-23 16:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11669032811936566377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14219707481371546109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 61 cols 232 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 16:40:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14219707481371546109.kers
Total runtime 2 ms.
[2026-05-23 16:40:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 16:40:30] [INFO ] Invariant cache hit.
[2026-05-23 16:40:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 16:40:30] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2026-05-23 16:40:30] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-23 16:40:30] [INFO ] Invariant cache hit.
[2026-05-23 16:40:30] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 84 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 69/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 153 constraints, problems are : Problem set: 0 solved, 69 unsolved in 7030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9053ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 9053ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/98 places, 70/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9341 ms. Remains : 61/98 places, 70/135 transitions.
[2026-05-23 16:40:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:40:39] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:40:39] [INFO ] Input system was already deterministic with 70 transitions.
[2026-05-23 16:40:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:40:39] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:40:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1350994026067555574.gal : 1 ms
[2026-05-23 16:40:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7292480796797879890.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/CTLFireability1350994026067555574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7292480796797879890.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.04624e+06,1.52642,31356,2,6705,5,114231,6,0,314,107927,0
Converting to forward existential form...Done !
original formula: EF(EG(((s1>=1)&&(l335>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((s1>=1)&&(l335>=1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/66/69
(forward)formula 0,0,2.96649,48520,1,0,16,223642,19,2,1807,130448,16
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 76 transition count 94
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 73
Applied a total of 76 rules in 16 ms. Remains 63 /98 variables (removed 35) and now considering 73/135 (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-8026350111422585922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11126954575461012865.kers'
[2026-05-23 16:40:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8026350111422585922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11126954575461012865.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 244 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:40:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11126954575461012865.kers
Total runtime 1 ms.
[2026-05-23 16:40:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 16:40:42] [INFO ] Invariant cache hit.
[2026-05-23 16:40:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 16:40:42] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-05-23 16:40:42] [INFO ] Redundant transitions in 2 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 16:40:42] [INFO ] Invariant cache hit.
[2026-05-23 16:40:42] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 6004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10664ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 10665ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/98 places, 73/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10897 ms. Remains : 63/98 places, 73/135 transitions.
[2026-05-23 16:40:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:40:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:40:53] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:40:53] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:40:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:40:53] [INFO ] Time to serialize gal into /tmp/CTLFireability18092970817730334707.gal : 1 ms
[2026-05-23 16:40:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9167550971354031684.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/CTLFireability18092970817730334707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9167550971354031684.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09711e+06,1.82573,46092,2,9808,5,143716,6,0,325,165578,0
Converting to forward existential form...Done !
original formula: AF((EF(((p37>=1)&&(l122>=1))) + ((s6>=1)&&(l0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p37>=1)&&(l122>=1))) + ((s6>=1)&&(l0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,11.1124,217120,1,0,202,1.06736e+06,174,85,2240,893815,225
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 76 transition count 94
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 76 transition count 93
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 68 transition count 85
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 73
Applied a total of 76 rules in 8 ms. Remains 63 /98 variables (removed 35) and now considering 73/135 (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-7540037095507282033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17248654757608317746.kers'
[2026-05-23 16:41:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7540037095507282033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17248654757608317746.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 63 cols 242 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:41:04] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17248654757608317746.kers
Total runtime 3 ms.
[2026-05-23 16:41:04] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 16:41:04] [INFO ] Invariant cache hit.
[2026-05-23 16:41:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 16:41:04] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 63/98 places, 73/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 63/98 places, 73/135 transitions.
[2026-05-23 16:41:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:41:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:41:04] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-23 16:41:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:41:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:41:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7124642963678405439.gal : 0 ms
[2026-05-23 16:41:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7125095369162819687.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/CTLFireability7124642963678405439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7125095369162819687.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.36142e+06,2.17677,55172,2,10689,5,192039,6,0,325,209285,0
Converting to forward existential form...Done !
original formula: AX(EF(((s1>=1)&&(l489>=1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((s1>=1)&&(l489>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
(forward)formula 0,1,11.7851,234192,1,0,195,1.15539e+06,167,85,2296,946048,220
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 98
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 97
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 70 transition count 89
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 70 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 67 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 64 transition count 76
Applied a total of 72 rules in 6 ms. Remains 64 /98 variables (removed 34) and now considering 76/135 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14267301063565701449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1919454348980887989.kers'
[2026-05-23 16:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14267301063565701449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1919454348980887989.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 64 cols 249 entries
Finished phase 1 with 59 SingleSign rule and 3 generalized
[2026-05-23 16:41:16] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1919454348980887989.kers
Total runtime 1 ms.
[2026-05-23 16:41:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 16:41:16] [INFO ] Invariant cache hit.
[2026-05-23 16:41:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:41:16] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-23 16:41:16] [INFO ] Invariant cache hit.
[2026-05-23 16:41:16] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 102 constraints, problems are : Problem set: 0 solved, 75 unsolved in 6254 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/140 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 24/102 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 75/177 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 177 constraints, problems are : Problem set: 0 solved, 75 unsolved in 8072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14364ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 14365ms
Starting structural reductions in LTL mode, iteration 1 : 64/98 places, 76/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14653 ms. Remains : 64/98 places, 76/135 transitions.
[2026-05-23 16:41:31] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:41:31] [INFO ] Flatten gal took : 5 ms
[2026-05-23 16:41:31] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-23 16:41:31] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:41:31] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:41:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8863122577224013388.gal : 2 ms
[2026-05-23 16:41:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3549747984360597412.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/CTLFireability8863122577224013388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3549747984360597412.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.06855e+06,2.50373,59068,2,10438,5,228155,6,0,332,204497,0
Converting to forward existential form...Done !
original formula: EF((AG(((AX(((p12<1)||(l0<1))) * ((s1<1)||(l336<1))) + AG(((s1<1)||(l354<1))))) * EG(EF(((p23<1)||(l0<1))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(((!(EX(!(((p12<1)||(l0<1))))) * ((s1<1)||(l336<1))) + !(E(TRUE U !(((s1<1)...213
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t41, t42, t48, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...321
(forward)formula 0,1,20.4626,396092,1,0,261,1.78632e+06,182,115,2418,1.73729e+06,301
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 75 transition count 93
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 75 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 75 transition count 92
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 66 transition count 83
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 63 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 62 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 61 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 61 transition count 70
Applied a total of 80 rules in 3 ms. Remains 61 /98 variables (removed 37) and now considering 70/135 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13088526656413471672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7386130000357818366.kers'
[2026-05-23 16:41:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13088526656413471672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7386130000357818366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 61 cols 232 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 16:41:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7386130000357818366.kers
Total runtime 1 ms.
[2026-05-23 16:41:52] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 16:41:52] [INFO ] Invariant cache hit.
[2026-05-23 16:41:52] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 16:41:52] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2026-05-23 16:41:52] [INFO ] Invariant cache hit.
[2026-05-23 16:41:52] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 84 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 21/84 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 69/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 153 constraints, problems are : Problem set: 0 solved, 69 unsolved in 7241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9836ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 9837ms
Starting structural reductions in LTL mode, iteration 1 : 61/98 places, 70/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10080 ms. Remains : 61/98 places, 70/135 transitions.
[2026-05-23 16:42:02] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:42:02] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:42:02] [INFO ] Input system was already deterministic with 70 transitions.
[2026-05-23 16:42:02] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:42:02] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:42:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9058805970039107971.gal : 1 ms
[2026-05-23 16:42:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9027752960043107581.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/CTLFireability9058805970039107971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9027752960043107581.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.04624e+06,1.07061,31352,2,6705,5,114231,6,0,314,107927,0
Converting to forward existential form...Done !
original formula: AG(A(A(EF(((s1>=1)&&(l339>=1))) U !(((s1>=1)&&(l335>=1)))) U AX(FALSE)))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(FALSE))))) * !(!((E(!(!(((s1>=1)&&(l335>=1)))) U (!(E(TRUE U ((s1>=1)&&(l33...307
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t45, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t6...291
(forward)formula 0,0,2.61891,60092,1,0,148,243728,161,60,2142,205421,160
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-23 16:42:04] [INFO ] Flatten gal took : 4 ms
[2026-05-23 16:42:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 16:42:04] [INFO ] Applying decomposition
[2026-05-23 16:42:04] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17088465755852123698.txt' '-o' '/tmp/graph17088465755852123698.bin' '-w' '/tmp/graph17088465755852123698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17088465755852123698.bin' '-l' '-1' '-v' '-w' '/tmp/graph17088465755852123698.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:42:04] [INFO ] Decomposing Gal with order
[2026-05-23 16:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:42:04] [INFO ] Removed a total of 149 redundant transitions.
[2026-05-23 16:42:04] [INFO ] Flatten gal took : 11 ms
[2026-05-23 16:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 5 ms.
[2026-05-23 16:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15299467195499785979.gal : 2 ms
[2026-05-23 16:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability1702446266906205740.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/CTLFireability15299467195499785979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1702446266906205740.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 2 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.78882e+07,37.2643,311656,5326,1260,279778,9083,378,1.26606e+06,126,120622,0
Converting to forward existential form...Done !
original formula: E(((AF(((i6.u1.s1>=1)&&(i5.u9.l339>=1))) + (((EF(((i6.u1.s1>=1)&&(i6.u1.l110>=1))) * !(AF(((i6.u1.s1>=1)&&(i6.u11.l342>=1))))) * (AX(((i6...943
=> equivalent forward existential formula: (([FwdG(FwdU((FwdU(Init,((!(EG(!(((i6.u1.s1>=1)&&(i5.u9.l339>=1))))) + (((E(TRUE U ((i6.u1.s1>=1)&&(i6.u1.l110>=...2968
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t7, t8, t9, t25, t29, t30, t31, t32, t35, t58, t59, t60, t72, t73, t74, t77, t78, t79...504
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,232.599,2256148,1,0,2.49319e+06,85327,1843,1.29325e+07,758,595887,4827273
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF((A((!(((i6.u1.s1>=1)&&(u16.l489>=1))) * !(EF(((i6.u1.s1>=1)&&(i8.u10.l509>=1))))) U (((EG(((i6.u8.p23>=1)&&(i6.u1.l0>=1))) * EX(((i6.u...367
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((((EG(((i6.u8.p23>=1)&&(i6.u1.l0>=1))) * EX(((i6.u1.s1>=1)&&(u20.l504>=1)))) * ((((!((i6.u8...895
(forward)formula 1,0,303.68,2258340,1,0,2.49634e+06,85327,1247,1.29377e+07,473,596114,2013106
FORMULA DBSingleClientW-PT-d0m07-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1040328 ms.
BK_STOP 1779554829693
--------------------
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="DBSingleClientW-PT-d0m07"
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 DBSingleClientW-PT-d0m07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993500106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m07.tgz
mv DBSingleClientW-PT-d0m07 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 ;