Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 43K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779700030374

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:07:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:07:12] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2026-05-25 09:07:12] [INFO ] Transformed 172 places.
[2026-05-25 09:07:12] [INFO ] Transformed 166 transitions.
[2026-05-25 09:07:12] [INFO ] Found NUPN structural information;
[2026-05-25 09:07:12] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 102 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 166 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 166 transition count 162
Applied a total of 10 rules in 21 ms. Remains 166 /172 variables (removed 6) and now considering 162/166 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3632313781331844815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14964719498967903632.kers'
[2026-05-25 09:07:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3632313781331844815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14964719498967903632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 166 cols 454 entries
Finished phase 1 with 128 SingleSign rule and 16 generalized
[2026-05-25 09:07:12] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14964719498967903632.kers
Total runtime 2 ms.
[2026-05-25 09:07:12] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-25 09:07:12] [INFO ] Invariant cache hit.
[2026-05-25 09:07:12] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-05-25 09:07:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 162/328 variables, 166/216 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 221 constraints, problems are : Problem set: 0 solved, 161 unsolved in 21730 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 32/54 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 162/328 variables, 166/222 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 161/383 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 395 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51812ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 51825ms
Starting structural reductions in LTL mode, iteration 1 : 166/172 places, 162/166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52459 ms. Remains : 166/172 places, 162/166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 166 /166 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2026-05-25 09:08:04] [INFO ] Invariant cache hit.
[2026-05-25 09:08:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:08:04] [INFO ] Invariant cache hit.
[2026-05-25 09:08:04] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 166/166 places, 162/162 transitions.
Support contains 102 out of 166 places after structural reductions.
[2026-05-25 09:08:04] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:08:04] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:08:05] [INFO ] Input system was already deterministic with 162 transitions.
Reduction of identical properties reduced properties to check from 83 to 82
RANDOM walk for 40000 steps (823 resets) in 1341 ms. (29 steps per ms) remains 14/82 properties
BEST_FIRST walk for 40003 steps (170 resets) in 286 ms. (139 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (201 resets) in 147 ms. (270 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (203 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (161 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (225 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (182 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (215 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (199 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (188 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (199 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (220 resets) in 73 ms. (540 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (202 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
[2026-05-25 09:08:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/87 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/98 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 5 (OVERLAPS) 68/166 variables, 14/22 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 10/32 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 162/328 variables, 166/198 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/198 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/198 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 198 constraints, problems are : Problem set: 2 solved, 8 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 49/65 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 31/96 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 6 (OVERLAPS) 70/166 variables, 14/23 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 9/32 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/32 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 162/328 variables, 166/198 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 6/204 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/204 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 204 constraints, problems are : Problem set: 4 solved, 6 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2086ms problems are : Problem set: 4 solved, 6 unsolved
Parikh walk visited 3 properties in 332 ms.
Support contains 7 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 163 transition count 138
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 139 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 138 transition count 136
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 54 place count 138 transition count 110
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 107 place count 111 transition count 110
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 110 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 109 transition count 109
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 121 place count 98 transition count 98
Iterating global reduction 5 with 11 rules applied. Total rules applied 132 place count 98 transition count 98
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 132 place count 98 transition count 94
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 140 place count 94 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 93 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 93 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 92 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 92 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 91 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 91 transition count 91
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 190 place count 69 transition count 69
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 202 place count 63 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 63 transition count 88
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 208 place count 63 transition count 83
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 213 place count 58 transition count 83
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 216 place count 58 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 219 place count 55 transition count 80
Applied a total of 219 rules in 56 ms. Remains 55 /166 variables (removed 111) and now considering 80/162 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 55/166 places, 80/162 transitions.
RANDOM walk for 40000 steps (4488 resets) in 379 ms. (105 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (926 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (918 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13430262772969072786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12456769408750122498.kers'
[2026-05-25 09:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13430262772969072786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12456769408750122498.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 80 rows 53 cols 421 entries
Finished phase 1 with 28 SingleSign rule and 10 generalized
[2026-05-25 09:08:08] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12456769408750122498.kers
Total runtime 0 ms.
[2026-05-25 09:08:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/45 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/55 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/135 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/45 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/55 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/135 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 80/80 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 79
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/55 places, 79/80 transitions.
RANDOM walk for 40000 steps (4552 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (966 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (964 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 65677 steps, run visited all 2 properties in 157 ms. (steps per millisecond=418 )
Probabilistic random walk after 65677 steps, saw 15983 distinct states, run finished after 162 ms. (steps per millisecond=405 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-12-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:08:09] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:08:09] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:08:09] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 150 transition count 138
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 150 transition count 138
Applied a total of 29 rules in 6 ms. Remains 150 /166 variables (removed 16) and now considering 138/162 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2265141177279275038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-30391591303431675.kers'
[2026-05-25 09:08:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2265141177279275038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-30391591303431675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 150 cols 355 entries
Finished phase 1 with 118 SingleSign rule and 13 generalized
[2026-05-25 09:08:09] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-30391591303431675.kers
Total runtime 6 ms.
[2026-05-25 09:08:10] [INFO ] Implicit Places using invariants in 975 ms returned []
[2026-05-25 09:08:10] [INFO ] Invariant cache hit.
[2026-05-25 09:08:10] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-25 09:08:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 138/288 variables, 150/179 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 180 constraints, problems are : Problem set: 0 solved, 137 unsolved in 10074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 138/288 variables, 150/180 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 137/317 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/288 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 324 constraints, problems are : Problem set: 0 solved, 137 unsolved in 20729 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 30825ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 30827ms
Starting structural reductions in LTL mode, iteration 1 : 150/166 places, 138/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31940 ms. Remains : 150/166 places, 138/162 transitions.
[2026-05-25 09:08:41] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:08:41] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:08:41] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-25 09:08:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:08:41] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:08:41] [INFO ] Time to serialize gal into /tmp/CTLFireability7123361282907486192.gal : 3 ms
[2026-05-25 09:08:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16510045532068632657.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7123361282907486192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16510045532068632657.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.12378e+08,0.703088,33656,2,7216,5,107411,6,0,740,160787,0


Converting to forward existential form...Done !
original formula: EX(AX((AG(((p29==0)||(p80==0))) + (((p168==1)||(p59==1))&&((((p42==0)||(p114==0))||((p35==0)||(p60==0)))||(p13==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((!(E(TRUE U !(((p29==0)||(p80==0))))) + (((p168==1)||(p59==1))&&((((p42==0)||(p114==0))||((p...200
Reverse transition relation is NOT exact ! Due to transitions t4, t18, t20, t35, t37, t44, t49, t55, t56, t59, t64, t67, t68, t75, t79, t82, t85, t87, t92,...256
Detected timeout of ITS tools.
[2026-05-25 09:09:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:11] [INFO ] Applying decomposition
[2026-05-25 09:09:11] [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/graph5302237116146704355.txt' '-o' '/tmp/graph5302237116146704355.bin' '-w' '/tmp/graph5302237116146704355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5302237116146704355.bin' '-l' '-1' '-v' '-w' '/tmp/graph5302237116146704355.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:09:11] [INFO ] Decomposing Gal with order
[2026-05-25 09:09:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:09:11] [INFO ] Removed a total of 22 redundant transitions.
[2026-05-25 09:09:11] [INFO ] Flatten gal took : 63 ms
[2026-05-25 09:09:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 09:09:11] [INFO ] Time to serialize gal into /tmp/CTLFireability5100197507333115000.gal : 5 ms
[2026-05-25 09:09:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6534675280511293073.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/CTLFireability5100197507333115000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6534675280511293073.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.12378e+08,0.060436,6724,610,39,6277,257,420,5618,57,558,0


Converting to forward existential form...Done !
original formula: EX(AX((AG(((i4.u10.p29==0)||(i8.u27.p80==0))) + (((i3.u58.p168==1)||(i7.u22.p59==1))&&((((i9.u40.p42==0)||(i12.i1.u41.p114==0))||((i7.u22...203
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((!(E(TRUE U !(((i4.u10.p29==0)||(i8.u27.p80==0))))) + (((i3.u58.p168==1)||(i7.u22.p59==1))&&...266
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t37, u51.t18, i0.u14.t75, i2.u5.t68, i2.u5.t87, i4.u9.t85, i6.i0.u1.t92, i7.u12.t82,...366
(forward)formula 0,0,0.833577,42116,1,0,91201,405,2296,105270,236,966,166333
FORMULA MedleyA-PT-12-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 152 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 152 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 151 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 151 transition count 149
Applied a total of 28 rules in 24 ms. Remains 151 /166 variables (removed 15) and now considering 149/162 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13523770637192293899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5258042614606682050.kers'
[2026-05-25 09:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523770637192293899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5258042614606682050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 151 cols 422 entries
Finished phase 1 with 116 SingleSign rule and 15 generalized
[2026-05-25 09:09:12] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5258042614606682050.kers
Total runtime 1 ms.
[2026-05-25 09:09:12] [INFO ] Implicit Places using invariants in 124 ms returned [31, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 128 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/166 places, 149/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 149/166 places, 149/162 transitions.
[2026-05-25 09:09:12] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:09:12] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:12] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 09:09:12] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:09:12] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:09:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11252963168091118938.gal : 5 ms
[2026-05-25 09:09:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9779714937747298719.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/CTLFireability11252963168091118938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9779714937747298719.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81684e+08,2.59409,56228,2,14114,5,209400,6,0,747,277025,0


Converting to forward existential form...Done !
original formula: AF(EX(((!(E(AG((p108==1)) U (((p40==1)&&(p89==1))||(p55==1)))) * (!(A((p171==1) U (p116==1))) + ((p66==1)&&(p76==1)))) * ((((p25==1)&&(p3...210
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(!(E(TRUE U !((p108==1)))) U (((p40==1)&&(p89==1))||(p55==1)))) * (!(!((E(!((p116==1)) U (!...314
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...288
Detected timeout of ITS tools.
[2026-05-25 09:09:43] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:09:43] [INFO ] Applying decomposition
[2026-05-25 09:09:43] [INFO ] Flatten gal took : 15 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/graph18440537511781085305.txt' '-o' '/tmp/graph18440537511781085305.bin' '-w' '/tmp/graph18440537511781085305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18440537511781085305.bin' '-l' '-1' '-v' '-w' '/tmp/graph18440537511781085305.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:09:43] [INFO ] Decomposing Gal with order
[2026-05-25 09:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:09:43] [INFO ] Removed a total of 23 redundant transitions.
[2026-05-25 09:09:43] [INFO ] Flatten gal took : 32 ms
[2026-05-25 09:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2026-05-25 09:09:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6282292699062139776.gal : 4 ms
[2026-05-25 09:09:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8350307917468988000.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/CTLFireability6282292699062139776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8350307917468988000.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81684e+08,0.239941,14888,827,334,12517,2732,459,67316,98,28280,0


Converting to forward existential form...Done !
original formula: AF(EX(((!(E(AG((i5.i1.u36.p108==1)) U (((i2.i1.u12.p40==1)&&(i5.i0.u31.p89==1))||(i4.i0.u17.p55==1)))) * (!(A((i9.u60.p171==1) U (i6.i1.u...327
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(!(E(TRUE U !((i5.i1.u36.p108==1)))) U (((i2.i1.u12.p40==1)&&(i5.i0.u31.p89==1))||(i4.i0.u1...451
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, t65, i0.u5.t0, i0.u5.t1, i0.u5.t2, i0.u5.t3, i0.u5.t4, i0.u5.t5, i0.u5.t6, i0....449
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,12.6512,342496,1,0,585417,10096,2800,1.51755e+06,680,77669,637964
FORMULA MedleyA-PT-12-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 152 transition count 151
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 149 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 148 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 148 transition count 147
Applied a total of 33 rules in 18 ms. Remains 148 /166 variables (removed 18) and now considering 147/162 (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-5438714089594502859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13975532514070630582.kers'
[2026-05-25 09:09:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5438714089594502859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13975532514070630582.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 148 cols 412 entries
Finished phase 1 with 116 SingleSign rule and 13 generalized
[2026-05-25 09:09:55] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13975532514070630582.kers
Total runtime 1 ms.
[2026-05-25 09:09:56] [INFO ] Implicit Places using invariants in 78 ms returned [32, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/166 places, 147/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 146/166 places, 147/162 transitions.
[2026-05-25 09:09:56] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:09:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:56] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-25 09:09:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:09:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10548912904420368284.gal : 0 ms
[2026-05-25 09:09:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8339087639816957472.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/CTLFireability10548912904420368284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8339087639816957472.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.98332e+08,1.73195,45536,2,8865,5,169460,6,0,733,215975,0


Converting to forward existential form...Done !
original formula: A(E(AX((p141==1)) U ((A(A((p140==1) U (p2==1)) U ((p20==1)&&(p141==1))) + AG(EF(((p90==1)&&(p106==1))))) + (((p26==1)&&(p33==1))&&((p38==...196
=> equivalent forward existential formula: [((Init * !(EG(!(((p43==1)&&(p112==1)))))) * !(E(!(((p43==1)&&(p112==1))) U (!(E(!(EX(!((p141==1)))) U ((!((E(!(...453
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...298
Detected timeout of ITS tools.
[2026-05-25 09:10:26] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:10:26] [INFO ] Applying decomposition
[2026-05-25 09:10:26] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10380518551399751042.txt' '-o' '/tmp/graph10380518551399751042.bin' '-w' '/tmp/graph10380518551399751042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10380518551399751042.bin' '-l' '-1' '-v' '-w' '/tmp/graph10380518551399751042.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:10:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:10:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:10:26] [INFO ] Removed a total of 19 redundant transitions.
[2026-05-25 09:10:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:10:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:10:26] [INFO ] Time to serialize gal into /tmp/CTLFireability4777826180596169646.gal : 3 ms
[2026-05-25 09:10:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17789660871843732795.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/CTLFireability4777826180596169646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17789660871843732795.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,7.98332e+08,0.130383,10588,1218,422,12600,2256,420,22269,92,9113,0


Converting to forward existential form...Done !
original formula: A(E(AX((i3.i1.u17.p141==1)) U ((A(A((i7.i1.u50.p140==1) U (i0.u4.p2==1)) U ((i3.i0.u8.p20==1)&&(i3.i1.u17.p141==1))) + AG(EF(((i5.i1.u31....305
=> equivalent forward existential formula: [((Init * !(EG(!(((i6.i0.u13.p43==1)&&(i6.i1.u39.p112==1)))))) * !(E(!(((i6.i0.u13.p43==1)&&(i6.i1.u39.p112==1))...652
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, i1.u7.t0, i1.u7.t1, i1.u7.t2, i1.u7.t3, i1.u7.t4, i1.u7.t5, i1.u7.t6, i1.u7.t7...478
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 148 transition count 136
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 147 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 146 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 146 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 145 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 145 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 144 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 144 transition count 132
Applied a total of 41 rules in 17 ms. Remains 144 /166 variables (removed 22) and now considering 132/162 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16590017072480361079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13829316898215806109.kers'
[2026-05-25 09:10:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16590017072480361079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13829316898215806109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 144 cols 337 entries
Finished phase 1 with 112 SingleSign rule and 13 generalized
[2026-05-25 09:10:56] [INFO ] Computed 19 invariants in 10 ms
Computed 19 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13829316898215806109.kers
Total runtime 11 ms.
[2026-05-25 09:10:56] [INFO ] Implicit Places using invariants in 133 ms returned [30, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 134 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 132/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 142/166 places, 132/162 transitions.
[2026-05-25 09:10:56] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:10:56] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:10:56] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-25 09:10:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:56] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:10:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1229560961069677510.gal : 1 ms
[2026-05-25 09:10:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9955522675670321136.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/CTLFireability1229560961069677510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9955522675670321136.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,5.57454e+08,0.578861,24888,2,4942,5,78453,6,0,702,113587,0


Converting to forward existential form...Done !
original formula: (AF((p2==1)) * (AG(EF(EG(((p121==0)||(p133==0))))) + A((p29==1) U A(!(((p16==1)&&(p142==1))) U EX((((p92==1)&&(p109==1))||(p8==1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((p2==1)))] = FALSE * [(FwdU((Init * !(!((E(!(!((E(!(EX((((p92==1)&&(p109==1))||(p8==1)))) U (!(!((...700
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t72, t76, t79, t82, t88, Intersection ...241
Detected timeout of ITS tools.
[2026-05-25 09:11:26] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:11:26] [INFO ] Applying decomposition
[2026-05-25 09:11:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11491300395166651277.txt' '-o' '/tmp/graph11491300395166651277.bin' '-w' '/tmp/graph11491300395166651277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11491300395166651277.bin' '-l' '-1' '-v' '-w' '/tmp/graph11491300395166651277.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:11:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:11:26] [INFO ] Removed a total of 19 redundant transitions.
[2026-05-25 09:11:26] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:11:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:11:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5125303705365917874.gal : 2 ms
[2026-05-25 09:11:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1383503460534502189.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/CTLFireability5125303705365917874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1383503460534502189.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.57454e+08,0.091246,6980,557,27,7100,252,396,6472,52,426,0


Converting to forward existential form...Done !
original formula: (AF((i0.u3.p2==1)) * (AG(EF(EG(((i10.i1.u43.p121==0)||(i10.i0.u47.p133==0))))) + A((i2.u11.p29==1) U A(!(((i11.u6.p16==1)&&(i4.u51.p142==...225
=> equivalent forward existential formula: ([FwdG(Init,!((i0.u3.p2==1)))] = FALSE * [(FwdU((Init * !(!((E(!(!((E(!(EX((((i9.u31.p92==1)&&(i8.i1.u38.p109==1...984
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t37, i2.u10.t82, i3.i0.u0.t88, i3.i1.u15.t72, i5.u13.t79, i5.u19.t64, i6.i0.t62, i6....344
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,7.40974,232524,1,0,487360,564,2693,555492,255,1484,594603
FORMULA MedleyA-PT-12-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 162 transition count 141
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 142 transition count 139
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 141 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 139 transition count 137
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 50 place count 139 transition count 111
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 103 place count 112 transition count 111
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 111 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 106 place count 110 transition count 110
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 114 place count 102 transition count 102
Iterating global reduction 6 with 8 rules applied. Total rules applied 122 place count 102 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 122 place count 102 transition count 101
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 124 place count 101 transition count 101
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 100 transition count 100
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 100 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 99 transition count 99
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 99 transition count 99
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 168 place count 79 transition count 79
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 79 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 170 place count 78 transition count 78
Applied a total of 170 rules in 24 ms. Remains 78 /166 variables (removed 88) and now considering 78/162 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16251184241354746821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1267470148588632916.kers'
[2026-05-25 09:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16251184241354746821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1267470148588632916.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 78 rows 76 cols 262 entries
Finished phase 1 with 55 SingleSign rule and 6 generalized
[2026-05-25 09:11:34] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1267470148588632916.kers
Total runtime 2 ms.
[2026-05-25 09:11:34] [INFO ] Implicit Places using invariants in 115 ms returned [13, 19, 25, 40, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 117 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 73/166 places, 78/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 73 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 72 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 70 transition count 75
Applied a total of 6 rules in 4 ms. Remains 70 /73 variables (removed 3) and now considering 75/78 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9965506335104418649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-533328400968292698.kers'
[2026-05-25 09:11:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9965506335104418649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-533328400968292698.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 70 cols 249 entries
Finished phase 1 with 54 SingleSign rule and 4 generalized
[2026-05-25 09:11:34] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-533328400968292698.kers
Total runtime 0 ms.
[2026-05-25 09:11:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:11:34] [INFO ] Invariant cache hit.
[2026-05-25 09:11:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 70/166 places, 75/162 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 260 ms. Remains : 70/166 places, 75/162 transitions.
[2026-05-25 09:11:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:34] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-25 09:11:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:11:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1651191736973977634.gal : 0 ms
[2026-05-25 09:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4377127522448295710.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/CTLFireability1651191736973977634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4377127522448295710.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,3.07064e+06,0.094659,7964,2,1964,5,17277,6,0,357,20379,0


Converting to forward existential form...Done !
original formula: E((EG(E((EG((((p26==1)&&(p33==1))&&((p39==1)&&(p47==1)))) * ((p160==1)||(p131==1))) U (((((p25==1)&&(p34==1))&&((p38==1)&&(p47==1)))&&(p1...226
=> equivalent forward existential formula: [((FwdU(Init,(EG(E((EG((((p26==1)&&(p33==1))&&((p39==1)&&(p47==1)))) * ((p160==1)||(p131==1))) U (((((p25==1)&&(...344
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t16, t21, t33, t42, t44, t45, t46, t47, t48, t67, t71, Intersection with rea...231
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.4056,425668,1,0,976,2.56906e+06,198,563,2395,2.69272e+06,1154
FORMULA MedleyA-PT-12-CTLFireability-2024-05 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 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 151 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 149 transition count 148
Applied a total of 31 rules in 33 ms. Remains 149 /166 variables (removed 17) and now considering 148/162 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9502582343827190676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5263606595074501335.kers'
[2026-05-25 09:11:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9502582343827190676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5263606595074501335.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 149 cols 416 entries
Finished phase 1 with 117 SingleSign rule and 13 generalized
[2026-05-25 09:11:50] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5263606595074501335.kers
Total runtime 1 ms.
[2026-05-25 09:11:50] [INFO ] Implicit Places using invariants in 79 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/166 places, 148/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 119 ms. Remains : 147/166 places, 148/162 transitions.
[2026-05-25 09:11:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:11:50] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:11:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability611538775733195672.gal : 1 ms
[2026-05-25 09:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17593017297493097215.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/CTLFireability611538775733195672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17593017297493097215.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,8.14807e+08,1.51245,51052,2,10542,5,197433,6,0,738,244906,0


Converting to forward existential form...Done !
original formula: AG(((AX(((p32==1)||((((p25==0)||(p33==0))||((p39==0)||(p47==0)))&&(p67==0)))) * (p97==0)) * (AF(((EX((p168==1)) * (p28==1)) * (p144==1)))...174
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(((p32==1)||((((p25==0)||(p33==0))||((p39==0)||(p47==0)))&&(p67==0)))))] = FALSE * [(...331
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...288
(forward)formula 0,0,10.6173,265752,1,0,306,1.62105e+06,317,155,4236,952629,344
FORMULA MedleyA-PT-12-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 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 151 transition count 150
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 149 transition count 148
Applied a total of 31 rules in 26 ms. Remains 149 /166 variables (removed 17) and now considering 148/162 (removed 14) transitions.
[2026-05-25 09:12:00] [INFO ] Invariant cache hit.
[2026-05-25 09:12:00] [INFO ] Implicit Places using invariants in 104 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 120 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/166 places, 148/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 147/166 places, 148/162 transitions.
[2026-05-25 09:12:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:01] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:12:01] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:12:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6310593067458751612.gal : 1 ms
[2026-05-25 09:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16252919126586309578.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/CTLFireability6310593067458751612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16252919126586309578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14807e+08,1.41377,51140,2,10542,5,197433,6,0,738,244906,0


Converting to forward existential form...Done !
original formula: (AG(((A((p62==1) U E(((p85==1)||(p32==1)) U AG((p168==1)))) + ((p54==0) * EG((p20==0)))) + ((((p168==0)&&(p1==1))&&(p51==1))||(p135==0)))...331
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!(E(((p85==1)||(p32==1)) U !(E(TRUE U !((p168==1)))))) U (!((p62==1)) * !(E(((p...907
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...288
Detected timeout of ITS tools.
[2026-05-25 09:12:31] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:12:31] [INFO ] Applying decomposition
[2026-05-25 09:12:31] [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/graph13525316733928470000.txt' '-o' '/tmp/graph13525316733928470000.bin' '-w' '/tmp/graph13525316733928470000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13525316733928470000.bin' '-l' '-1' '-v' '-w' '/tmp/graph13525316733928470000.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:12:31] [INFO ] Decomposing Gal with order
[2026-05-25 09:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:12:31] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 09:12:31] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-25 09:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1476691484105062115.gal : 3 ms
[2026-05-25 09:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9357852524515679896.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/CTLFireability1476691484105062115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9357852524515679896.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14807e+08,0.146319,11124,1081,425,13329,2284,450,24014,100,9757,0


Converting to forward existential form...Done !
original formula: (AG(((A((i3.u19.p62==1) U E(((i3.u27.p85==1)||(i2.i1.u11.p32==1)) U AG((i9.u56.p168==1)))) + ((i6.i1.u16.p54==0) * EG((i0.i1.u6.p20==0)))...514
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((!((E(!(E(((i3.u27.p85==1)||(i2.i1.u11.p32==1)) U !(E(TRUE U !((i9.u56.p168==1)))))) ...1272
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, t65, i0.i0.u0.t104, i2.i0.u5.t0, i2.i0.u5.t1, i2.i0.u5.t2, i2.i0.u5.t3, i2.i0....488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,14.1367,449656,1,0,841875,7267,2778,1.10485e+06,706,16650,1032269
FORMULA MedleyA-PT-12-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 148 transition count 136
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 148 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 147 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 147 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 146 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 146 transition count 134
Applied a total of 37 rules in 5 ms. Remains 146 /166 variables (removed 20) and now considering 134/162 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11483047933053779533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7143870072723355796.kers'
[2026-05-25 09:12:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11483047933053779533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7143870072723355796.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 146 cols 343 entries
Finished phase 1 with 114 SingleSign rule and 13 generalized
[2026-05-25 09:12:45] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7143870072723355796.kers
Total runtime 1 ms.
[2026-05-25 09:12:45] [INFO ] Implicit Places using invariants in 72 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/166 places, 134/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 144/166 places, 134/162 transitions.
[2026-05-25 09:12:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:12:45] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-25 09:12:45] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:12:45] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:12:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16924123521059845710.gal : 1 ms
[2026-05-25 09:12:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7640360564631011783.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/CTLFireability16924123521059845710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7640360564631011783.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.8368e+08,0.527161,26632,2,5307,5,85381,6,0,712,122838,0


Converting to forward existential form...Done !
original formula: AF((AF(EG(((p16==1)&&(p142==1)))) + (EX((p67==1)) * (p104==0))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(EG(((p16==1)&&(p142==1)))))) + (EX((p67==1)) * (p104==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t35, t38, t42, t50, t56, t59, t66, t74, t78, t81, t84, t90, Intersection with reach...231
Detected timeout of ITS tools.
[2026-05-25 09:13:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:13:15] [INFO ] Applying decomposition
[2026-05-25 09:13:15] [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/graph6060361188256452921.txt' '-o' '/tmp/graph6060361188256452921.bin' '-w' '/tmp/graph6060361188256452921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6060361188256452921.bin' '-l' '-1' '-v' '-w' '/tmp/graph6060361188256452921.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:13:15] [INFO ] Decomposing Gal with order
[2026-05-25 09:13:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:13:15] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 09:13:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:13:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:13:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3785711003227460318.gal : 2 ms
[2026-05-25 09:13:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15290318771406495666.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/CTLFireability3785711003227460318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15290318771406495666.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.8368e+08,0.052507,6428,474,26,5351,184,418,5291,54,358,0


Converting to forward existential form...Done !
original formula: AF((AF(EG(((i1.u5.p16==1)&&(i1.u52.p142==1)))) + (EX((i7.i0.u23.p67==1)) * (i9.i0.u36.p104==0))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(EG(((i1.u5.p16==1)&&(i1.u52.p142==1)))))) + (EX((i7.i0.u23.p67==1)) * (i9.i0.u36.p104==0)))...166
Reverse transition relation is NOT exact ! Due to transitions t4, t20, i3.u9.t84, i4.u17.t74, i5.i0.u1.t90, i6.u12.t81, i6.u22.t66, i7.t56, i7.i0.u27.t59, ...321
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,4.99975,196560,1,0,438362,347,2398,483743,245,830,507712
FORMULA MedleyA-PT-12-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 162 transition count 141
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 142 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 140 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 139 transition count 137
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 50 place count 139 transition count 114
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 97 place count 115 transition count 114
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 114 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 100 place count 113 transition count 113
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 111 place count 102 transition count 102
Iterating global reduction 6 with 11 rules applied. Total rules applied 122 place count 102 transition count 102
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 122 place count 102 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 130 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 131 place count 97 transition count 97
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 97 transition count 97
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 133 place count 96 transition count 96
Iterating global reduction 6 with 1 rules applied. Total rules applied 134 place count 96 transition count 96
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 135 place count 95 transition count 95
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 95 transition count 95
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 176 place count 75 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 74 transition count 74
Applied a total of 177 rules in 49 ms. Remains 74 /166 variables (removed 92) and now considering 74/162 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13166689940645937191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10867836463402838338.kers'
[2026-05-25 09:13:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13166689940645937191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10867836463402838338.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 72 cols 249 entries
Finished phase 1 with 51 SingleSign rule and 6 generalized
[2026-05-25 09:13:20] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10867836463402838338.kers
Total runtime 1 ms.
[2026-05-25 09:13:20] [INFO ] Implicit Places using invariants in 71 ms returned [12, 18, 25, 37, 42, 47]
[2026-05-25 09:13:20] [INFO ] Actually due to overlaps returned [42, 12, 18, 25, 47]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 73 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 69/166 places, 74/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 68 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 68 transition count 71
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 66 transition count 71
Applied a total of 6 rules in 7 ms. Remains 66 /69 variables (removed 3) and now considering 71/74 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11605117176958444932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-60812647180510083.kers'
[2026-05-25 09:13:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11605117176958444932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-60812647180510083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 66 cols 235 entries
Finished phase 1 with 51 SingleSign rule and 3 generalized
[2026-05-25 09:13:20] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-60812647180510083.kers
Total runtime 0 ms.
[2026-05-25 09:13:20] [INFO ] Implicit Places using invariants in 81 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 65/166 places, 71/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 64 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 63 transition count 69
Applied a total of 4 rules in 5 ms. Remains 63 /65 variables (removed 2) and now considering 69/71 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8777984670610930539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14088350167717353719.kers'
[2026-05-25 09:13:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8777984670610930539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14088350167717353719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 63 cols 236 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-25 09:13:20] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14088350167717353719.kers
Total runtime 0 ms.
[2026-05-25 09:13:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:13:20] [INFO ] Invariant cache hit.
[2026-05-25 09:13:21] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 63/166 places, 69/162 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 407 ms. Remains : 63/166 places, 69/162 transitions.
[2026-05-25 09:13:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:21] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-25 09:13:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1075023867358200951.gal : 1 ms
[2026-05-25 09:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4814256829833956900.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/CTLFireability1075023867358200951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4814256829833956900.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,799248,0.060993,6220,2,1280,5,11074,6,0,324,10951,0


Converting to forward existential form...Done !
original formula: EG((AF(((((p121==1)&&(p133==1))||(p91==1))||((p8==1)||(((p25==1)&&(p34==1))&&((p38==1)&&(p48==1)))))) + EF(EG(((p126==0)&&(p107==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((((p121==1)&&(p133==1))||(p91==1))||((p8==1)||(((p25==1)&&(p34==1))&&((p38==1)&&(p48==1)))))...209
Reverse transition relation is NOT exact ! Due to transitions t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,6.50791,230116,1,0,658,1.55265e+06,171,323,2281,1.20752e+06,829
FORMULA MedleyA-PT-12-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 162 transition count 139
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 140 transition count 137
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 139 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 137 transition count 135
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 54 place count 137 transition count 108
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 108 place count 110 transition count 108
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 111 place count 108 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 107 transition count 107
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 123 place count 96 transition count 96
Iterating global reduction 6 with 11 rules applied. Total rules applied 134 place count 96 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 134 place count 96 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 142 place count 92 transition count 92
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 143 place count 91 transition count 91
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 91 transition count 91
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 90 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 90 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 147 place count 89 transition count 89
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 89 transition count 89
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 184 place count 71 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 70 transition count 70
Applied a total of 185 rules in 19 ms. Remains 70 /166 variables (removed 96) and now considering 70/162 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2408023761595696806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6025075859058719503.kers'
[2026-05-25 09:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2408023761595696806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6025075859058719503.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 68 cols 242 entries
Finished phase 1 with 47 SingleSign rule and 6 generalized
[2026-05-25 09:13:27] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6025075859058719503.kers
Total runtime 1 ms.
[2026-05-25 09:13:27] [INFO ] Implicit Places using invariants in 62 ms returned [11, 17, 23, 35, 39, 43]
[2026-05-25 09:13:27] [INFO ] Actually due to overlaps returned [39, 11, 17, 23, 43]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 64 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/166 places, 70/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 65 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 62 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 62 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 61 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 60 transition count 65
Applied a total of 10 rules in 6 ms. Remains 60 /65 variables (removed 5) and now considering 65/70 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5600522297135891160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10076751335391190929.kers'
[2026-05-25 09:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5600522297135891160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10076751335391190929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 60 cols 224 entries
Finished phase 1 with 45 SingleSign rule and 3 generalized
[2026-05-25 09:13:27] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10076751335391190929.kers
Total runtime 1 ms.
[2026-05-25 09:13:27] [INFO ] Implicit Places using invariants in 77 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/166 places, 65/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 58 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 57 transition count 63
Applied a total of 4 rules in 4 ms. Remains 57 /59 variables (removed 2) and now considering 63/65 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13976124670470289271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1930771406502148328.kers'
[2026-05-25 09:13:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13976124670470289271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1930771406502148328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 57 cols 225 entries
Finished phase 1 with 44 SingleSign rule and 2 generalized
[2026-05-25 09:13:27] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1930771406502148328.kers
Total runtime 0 ms.
[2026-05-25 09:13:27] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:13:27] [INFO ] Invariant cache hit.
[2026-05-25 09:13:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 57/166 places, 63/162 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 393 ms. Remains : 57/166 places, 63/162 transitions.
[2026-05-25 09:13:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:28] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:28] [INFO ] Input system was already deterministic with 63 transitions.
[2026-05-25 09:13:28] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:13:28] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:13:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14891946170549944167.gal : 0 ms
[2026-05-25 09:13:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15484817002035058038.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/CTLFireability14891946170549944167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15484817002035058038.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,428091,0.061511,6984,2,1653,5,14470,6,0,293,15881,0


Converting to forward existential form...Done !
original formula: A((p169==1) U AF((((A((p142==1) U (((p25==1)&&(p33==1))&&((p38==1)&&(p47==1)))) * (p25==1)) * ((p34==1)&&(p38==1))) * (p47==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((((!((E(!((((p25==1)&&(p33==1))&&((p38==1)&&(p47==1)))) U (!((p142==1)) * !((((p25==1)&&...821
Reverse transition relation is NOT exact ! Due to transitions t2, t12, t28, t29, t30, t31, t32, t33, t55, t56, t59, t60, t61, t62, Intersection with reach...229
(forward)formula 0,0,5.41462,155204,1,0,539,1.03729e+06,164,245,2057,737476,622
FORMULA MedleyA-PT-12-CTLFireability-2024-10 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 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 153 transition count 152
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 153 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 152 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 149 transition count 148
Applied a total of 31 rules in 20 ms. Remains 149 /166 variables (removed 17) and now considering 148/162 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3645427478957851977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9245646678816612490.kers'
[2026-05-25 09:13:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3645427478957851977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9245646678816612490.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 149 cols 414 entries
Finished phase 1 with 117 SingleSign rule and 13 generalized
[2026-05-25 09:13:33] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9245646678816612490.kers
Total runtime 2 ms.
[2026-05-25 09:13:33] [INFO ] Implicit Places using invariants in 82 ms returned [33, 39]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/166 places, 148/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 147/166 places, 148/162 transitions.
[2026-05-25 09:13:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:33] [INFO ] Input system was already deterministic with 148 transitions.
[2026-05-25 09:13:33] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:13:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9132123752764363004.gal : 0 ms
[2026-05-25 09:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability863909084138261433.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/CTLFireability9132123752764363004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability863909084138261433.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.60354e+08,1.39072,49152,2,9719,5,180366,6,0,738,242387,0


Converting to forward existential form...Done !
original formula: EG(A(EG((((p25==1)&&(p34==1))&&((p38==1)&&(p47==1)))) U (((p6==1) + !(AX((p3==1)))) + (AX(((p123==1)&&(p136==1))) * !(AF((p122==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((p6==1) + !(!(EX(!((p3==1)))))) + (!(EX(!(((p123==1)&&(p136==1))))) * !(!(EG(!((p122==1)))))...436
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...316
Detected timeout of ITS tools.
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:14:03] [INFO ] Applying decomposition
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11447505936002568169.txt' '-o' '/tmp/graph11447505936002568169.bin' '-w' '/tmp/graph11447505936002568169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11447505936002568169.bin' '-l' '-1' '-v' '-w' '/tmp/graph11447505936002568169.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:14:03] [INFO ] Decomposing Gal with order
[2026-05-25 09:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:14:03] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-25 09:14:03] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3099502189261693215.gal : 2 ms
[2026-05-25 09:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8392271648582474657.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/CTLFireability3099502189261693215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8392271648582474657.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.60354e+08,0.554787,27728,1635,527,46687,6501,456,67193,98,42828,0


Converting to forward existential form...Done !
original formula: EG(A(EG((((i3.u12.p25==1)&&(i3.u12.p34==1))&&((i3.u12.p38==1)&&(i3.u12.p47==1)))) U (((i0.u4.p6==1) + !(AX((i1.u2.p3==1)))) + (AX(((i9.i1...224
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((i0.u4.p6==1) + !(!(EX(!((i1.u2.p3==1)))))) + (!(EX(!(((i9.i1.u43.p123==1)&&(i9.i1.u48.p136=...590
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t52, t65, t125, t128, i1.u2.t100, i1.u2.t104, i3.u12.t0, i3.u12.t1, i3.u12.t2, i3.u...509
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 153 transition count 152
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 153 transition count 152
Applied a total of 23 rules in 3 ms. Remains 153 /166 variables (removed 13) and now considering 152/162 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8299456843777885855.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4567707926946471402.kers'
[2026-05-25 09:14:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8299456843777885855.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4567707926946471402.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 153 cols 428 entries
Finished phase 1 with 121 SingleSign rule and 13 generalized
[2026-05-25 09:14:33] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4567707926946471402.kers
Total runtime 1 ms.
[2026-05-25 09:14:33] [INFO ] Implicit Places using invariants in 84 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/166 places, 152/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 151/166 places, 152/162 transitions.
[2026-05-25 09:14:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:14:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:14:34] [INFO ] Input system was already deterministic with 152 transitions.
[2026-05-25 09:14:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:14:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:14:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10723956933058767278.gal : 0 ms
[2026-05-25 09:14:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8875647277365365690.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/CTLFireability10723956933058767278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8875647277365365690.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.0693e+09,1.60157,57764,2,10491,5,211254,6,0,758,284752,0


Converting to forward existential form...Done !
original formula: ((E(EF(EX((p17==1))) U EG(AG(((p134==1)||(p158==1))))) * AF((p73==1))) * EG(((E(!(E((p82==1) U (p56==1))) U !(A((p108==1) U (((p25==1)&&(...304
=> equivalent forward existential formula: (([(Init * !(E(E(TRUE U EX((p17==1))) U EG(!(E(TRUE U !(((p134==1)||(p158==1)))))))))] = FALSE * [FwdG(Init,!((p...552
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t35, t50, t52, t59...298
Detected timeout of ITS tools.
[2026-05-25 09:15:04] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:15:04] [INFO ] Applying decomposition
[2026-05-25 09:15:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16965794025168797288.txt' '-o' '/tmp/graph16965794025168797288.bin' '-w' '/tmp/graph16965794025168797288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16965794025168797288.bin' '-l' '-1' '-v' '-w' '/tmp/graph16965794025168797288.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:15:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:15:04] [INFO ] Removed a total of 22 redundant transitions.
[2026-05-25 09:15:04] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 22 ms.
[2026-05-25 09:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability475528677968074512.gal : 2 ms
[2026-05-25 09:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9854181950361600893.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/CTLFireability475528677968074512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9854181950361600893.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0693e+09,0.175558,12036,819,396,12031,5862,417,23747,102,29821,0


Converting to forward existential form...Done !
original formula: ((E(EF(EX((i2.u11.p17==1))) U EG(AG(((i8.u47.p134==1)||(i10.u52.p158==1))))) * AF((i3.u24.p73==1))) * EG(((E(!(E((i6.u28.p82==1) U (i7.i0...443
=> equivalent forward existential formula: (([(Init * !(E(E(TRUE U EX((i2.u11.p17==1))) U EG(!(E(TRUE U !(((i8.u47.p134==1)||(i10.u52.p158==1)))))))))] = F...747
Reverse transition relation is NOT exact ! Due to transitions t19, t35, i2.u11.t0, i2.u11.t1, i2.u11.t2, i2.u11.t3, i2.u11.t4, i2.u11.t5, i2.u11.t6, i2.u11...483
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 162
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 150 transition count 137
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 150 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 149 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 149 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 148 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 148 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 147 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 147 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 146 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 146 transition count 133
Applied a total of 38 rules in 8 ms. Remains 146 /166 variables (removed 20) and now considering 133/162 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7286694461781636970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4562718038369858460.kers'
[2026-05-25 09:15:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7286694461781636970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4562718038369858460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 146 cols 341 entries
Finished phase 1 with 113 SingleSign rule and 13 generalized
[2026-05-25 09:15:34] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4562718038369858460.kers
Total runtime 2 ms.
[2026-05-25 09:15:34] [INFO ] Implicit Places using invariants in 106 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 119 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/166 places, 133/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 144 /144 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 144/166 places, 133/162 transitions.
[2026-05-25 09:15:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:15:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:15:34] [INFO ] Input system was already deterministic with 133 transitions.
[2026-05-25 09:15:34] [INFO ] Flatten gal took : 1 ms
[2026-05-25 09:15:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:15:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12219658727756542277.gal : 1 ms
[2026-05-25 09:15:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5106930290948295061.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/CTLFireability12219658727756542277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5106930290948295061.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.22e+08,0.564829,27328,2,6860,5,88493,6,0,711,126366,0


Converting to forward existential form...Done !
original formula: ((AG(((p150==0)||(p170==0))) + (EG((AX((p156==0)) + AX(((p41==0)||(p94==0))))) * EX((p83==0)))) + (EG(AX((p140==1))) * AG((p100==0))))
=> equivalent forward existential formula: ([((Init * !((!(E(TRUE U !(((p150==0)||(p170==0))))) + (EG((!(EX(!((p156==0)))) + !(EX(!(((p41==0)||(p94==0)))))...387
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t14, t21, t36, t39, t43, t51, t57, t60, t63, t64, t66, t74, t75, t78, t81, t84, t85, ...272
Detected timeout of ITS tools.
[2026-05-25 09:16:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:16:04] [INFO ] Applying decomposition
[2026-05-25 09:16:04] [INFO ] Flatten gal took : 1 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/graph8438518786959515345.txt' '-o' '/tmp/graph8438518786959515345.bin' '-w' '/tmp/graph8438518786959515345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8438518786959515345.bin' '-l' '-1' '-v' '-w' '/tmp/graph8438518786959515345.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:16:04] [INFO ] Decomposing Gal with order
[2026-05-25 09:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:16:04] [INFO ] Removed a total of 17 redundant transitions.
[2026-05-25 09:16:04] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:16:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7755509052101951648.gal : 10 ms
[2026-05-25 09:16:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8948105755234152443.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/CTLFireability7755509052101951648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8948105755234152443.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.22e+08,0.049303,6248,431,33,4364,194,423,4791,58,376,0


Converting to forward existential form...Done !
original formula: ((AG(((i11.u53.p150==0)||(i12.u59.p170==0))) + (EG((AX((i12.u59.p156==0)) + AX(((i9.i1.u14.p41==0)||(i9.i0.u15.p94==0))))) * EX((i6.i1.u2...227
=> equivalent forward existential formula: ([((Init * !((!(E(TRUE U !(((i11.u53.p150==0)||(i12.u59.p170==0))))) + (EG((!(EX(!((i12.u59.p156==0)))) + !(EX(!...516
Reverse transition relation is NOT exact ! Due to transitions t4, t21, t110, t113, i0.t75, i0.u17.t74, i1.i0.u0.t90, i3.t85, i3.u10.t84, i5.u12.t81, i5.u21...403
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.99805,184964,1,0,356367,396,2515,570805,280,877,488249
FORMULA MedleyA-PT-12-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 162
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 155 transition count 153
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 155 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 154 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 154 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 153 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 153 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 152 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 152 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 151 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 151 transition count 149
Applied a total of 28 rules in 17 ms. Remains 151 /166 variables (removed 15) and now considering 149/162 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10168879403116714407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9794970793609171198.kers'
[2026-05-25 09:16:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10168879403116714407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9794970793609171198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 151 cols 418 entries
Finished phase 1 with 116 SingleSign rule and 15 generalized
[2026-05-25 09:16:09] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9794970793609171198.kers
Total runtime 2 ms.
[2026-05-25 09:16:09] [INFO ] Implicit Places using invariants in 99 ms returned [31, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 149/166 places, 149/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 149/166 places, 149/162 transitions.
[2026-05-25 09:16:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:16:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:16:09] [INFO ] Input system was already deterministic with 149 transitions.
[2026-05-25 09:16:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:16:09] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:16:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2647155799483897740.gal : 1 ms
[2026-05-25 09:16:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1079787070046648410.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/CTLFireability2647155799483897740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1079787070046648410.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,7.47564e+08,1.80664,58716,2,17740,5,206032,6,0,747,300587,0


Converting to forward existential form...Done !
original formula: AG((EX((AF(((p140==1)||((p90==1)&&(p106==1)))) + (p171==1))) * ((EF((p105==1)) + ((EF(AX((p82==0))) * A(((p40==1)&&(p89==1)) U (p143==1))...315
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((!(EG(!(((p140==1)||((p90==1)&&(p106==1)))))) + (p171==1)))))] = FALSE * [(((FwdU(Init...479
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t19, t32, t34, t36, t51...318
Detected timeout of ITS tools.
[2026-05-25 09:16:39] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:16:39] [INFO ] Applying decomposition
[2026-05-25 09:16:39] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12844146881782815503.txt' '-o' '/tmp/graph12844146881782815503.bin' '-w' '/tmp/graph12844146881782815503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12844146881782815503.bin' '-l' '-1' '-v' '-w' '/tmp/graph12844146881782815503.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:16:39] [INFO ] Decomposing Gal with order
[2026-05-25 09:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:16:39] [INFO ] Removed a total of 19 redundant transitions.
[2026-05-25 09:16:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:16:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16389375950401729174.gal : 1 ms
[2026-05-25 09:16:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10008991564218770888.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/CTLFireability16389375950401729174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10008991564218770888.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,7.47564e+08,0.504157,28972,1102,440,23319,7290,473,167400,96,102253,0


Converting to forward existential form...Done !
original formula: AG((EX((AF(((i7.i0.u48.p140==1)||((i5.i2.u29.p90==1)&&(i5.i1.u36.p106==1)))) + (i8.i1.u58.p171==1))) * ((EF((i5.i2.u35.p105==1)) + ((EF(A...502
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((!(EG(!(((i7.i0.u48.p140==1)||((i5.i2.u29.p90==1)&&(i5.i1.u36.p106==1)))))) + (i8.i1.u...686
Reverse transition relation is NOT exact ! Due to transitions t19, t36, t68, i0.i1.u18.t82, i1.i1.u1.t106, i3.u6.t0, i3.u6.t1, i3.u6.t2, i3.u6.t3, i3.u6.t4...537
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,28.2809,462572,1,0,392135,23469,2754,3.77882e+06,715,145273,424362
FORMULA MedleyA-PT-12-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 162/162 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 164 transition count 162
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 148 transition count 135
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 148 transition count 135
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 147 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 147 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 146 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 146 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 145 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 145 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 144 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 144 transition count 131
Applied a total of 42 rules in 20 ms. Remains 144 /166 variables (removed 22) and now considering 131/162 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4985918880712296284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13307078904289460512.kers'
[2026-05-25 09:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4985918880712296284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13307078904289460512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 131 rows 144 cols 337 entries
Finished phase 1 with 112 SingleSign rule and 12 generalized
[2026-05-25 09:17:08] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13307078904289460512.kers
Total runtime 2 ms.
[2026-05-25 09:17:08] [INFO ] Implicit Places using invariants in 84 ms returned [29, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/166 places, 131/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 142/166 places, 131/162 transitions.
[2026-05-25 09:17:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:17:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:17:08] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-25 09:17:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:17:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15133899226166312166.gal : 1 ms
[2026-05-25 09:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12000533888063557335.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/CTLFireability15133899226166312166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12000533888063557335.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.03363e+08,0.547397,26756,2,5608,5,84071,6,0,701,124374,0


Converting to forward existential form...Done !
original formula: A(!(AX(AG(((!((p150==1)&&(p170==1)))&&(!((p44==1)&&(p95==1))))))) U AG(!(((p70==1)&&(p81==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((p70==1)&&(p81==1)))))))))) * !(E(!(!(E(TRUE U !(!(((p70==1)&&(p81==1))))))) U ...299
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t35, t37, t44, t49, t55, t58, t61, t62, t64, t72, t76, t79, t82, t88, Intersection ...241
Detected timeout of ITS tools.
[2026-05-25 09:17:38] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:17:38] [INFO ] Applying decomposition
[2026-05-25 09:17:38] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9194073052844046750.txt' '-o' '/tmp/graph9194073052844046750.bin' '-w' '/tmp/graph9194073052844046750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9194073052844046750.bin' '-l' '-1' '-v' '-w' '/tmp/graph9194073052844046750.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:17:38] [INFO ] Decomposing Gal with order
[2026-05-25 09:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:17:38] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 09:17:38] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:17:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:17:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3225038002300169779.gal : 2 ms
[2026-05-25 09:17:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13104387131066005767.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/CTLFireability3225038002300169779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13104387131066005767.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.03363e+08,0.059386,6044,467,15,4041,167,434,3930,38,384,0


Converting to forward existential form...Done !
original formula: A(!(AX(AG(((!((i11.u54.p150==1)&&(i12.i1.u60.p170==1)))&&(!((i10.i0.u14.p44==1)&&(i10.i0.u14.p95==1))))))) U AG(!(((i6.i0.u22.p70==1)&&(i...175
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((i6.i0.u22.p70==1)&&(i6.i1.u26.p81==1)))))))))) * !(E(!(!(E(TRUE U !(!(((i6.i0....400
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t37, i1.i0.u1.t88, i3.u9.t82, i4.u15.t72, i5.u12.t79, i5.u19.t64, i6.i0.t62, i6.i0.u...344
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.51808,206496,1,0,464456,167,2575,537970,199,384,617358
FORMULA MedleyA-PT-12-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:17:44] [INFO ] Applying decomposition
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1692739272402168298.txt' '-o' '/tmp/graph1692739272402168298.bin' '-w' '/tmp/graph1692739272402168298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1692739272402168298.bin' '-l' '-1' '-v' '-w' '/tmp/graph1692739272402168298.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:17:44] [INFO ] Decomposing Gal with order
[2026-05-25 09:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:17:44] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-25 09:17:44] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:17:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 09:17:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14309527236487539725.gal : 7 ms
[2026-05-25 09:17:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1594453410410389293.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/CTLFireability14309527236487539725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1594453410410389293.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34074e+09,0.546166,26204,3442,590,41265,3771,461,76764,107,24932,0


Converting to forward existential form...Done !
original formula: A(E(AX((i5.i1.u17.p141==1)) U ((A(A((i9.i1.u51.p140==1) U (i0.u3.p2==1)) U ((i5.i0.u8.p20==1)&&(i5.i1.u17.p141==1))) + AG(EF(((i8.i0.u31....305
=> equivalent forward existential formula: [((Init * !(EG(!(((i4.i1.u14.p43==1)&&(i4.i0.u40.p112==1)))))) * !(E(!(((i4.i1.u14.p43==1)&&(i4.i0.u40.p112==1))...652
Reverse transition relation is NOT exact ! Due to transitions t19, i1.u0.t111, i1.u0.t115, i3.u7.t0, i3.u7.t1, i3.u7.t2, i3.u7.t3, i3.u7.t4, i3.u7.t5, i3.u...642
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,226.678,2440288,1,0,4.42234e+06,21002,915,7.04408e+06,288,141471,2757400
FORMULA MedleyA-PT-12-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(EG((((i3.u7.p25==1)&&(i3.u7.p34==1))&&((i3.u7.p38==1)&&(i3.u7.p47==1)))) U (((i0.u2.p6==1) + !(AX((i1.u0.p3==1)))) + (AX(((i9.i1.u45...220
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((i0.u2.p6==1) + !(!(EX(!((i1.u0.p3==1)))))) + (!(EX(!(((i9.i1.u45.p123==1)&&(i9.i1.u50.p136=...586
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,1,307.743,2688600,1,0,4.54545e+06,21002,1741,7.31718e+06,403,141471,3062029
FORMULA MedleyA-PT-12-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((E(EF(EX((i3.u7.p17==1))) U EG(AG(((i9.i0.u48.p134==1)||(i11.u55.p158==1))))) * AF((i7.u24.p73==1))) * EG(((E(!(E((i6.u28.p82==1) U (i7....437
=> equivalent forward existential formula: (([(Init * !(E(E(TRUE U EX((i3.u7.p17==1))) U EG(!(E(TRUE U !(((i9.i0.u48.p134==1)||(i11.u55.p158==1)))))))))] =...733
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,0,543.693,3257740,1,0,6.07276e+06,21037,1561,9.68865e+06,374,158817,3384127
FORMULA MedleyA-PT-12-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1176957 ms.

BK_STOP 1779701208894

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-12"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-12, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969019900186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;