Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-14, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 46K May 29 14:32 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-14-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-14-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-14-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-14-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-14-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748867299967

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 12:28:22] [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]
[2025-06-02 12:28:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:28:22] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2025-06-02 12:28:22] [INFO ] Transformed 184 places.
[2025-06-02 12:28:22] [INFO ] Transformed 178 transitions.
[2025-06-02 12:28:22] [INFO ] Found NUPN structural information;
[2025-06-02 12:28:22] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 101 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 170 transition count 164
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 170 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 163
Applied a total of 30 rules in 75 ms. Remains 169 /184 variables (removed 15) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 169 cols
[2025-06-02 12:28:22] [INFO ] Computed 24 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:28:23] [INFO ] Implicit Places using invariants in 504 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/184 places, 163/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 168 /168 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 704 ms. Remains : 168/184 places, 163/178 transitions.
Support contains 101 out of 168 places after structural reductions.
[2025-06-02 12:28:23] [INFO ] Flatten gal took : 100 ms
[2025-06-02 12:28:23] [INFO ] Flatten gal took : 35 ms
[2025-06-02 12:28:23] [INFO ] Input system was already deterministic with 163 transitions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (8 resets) in 2558 ms. (15 steps per ms) remains 26/84 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
// Phase 1: matrix 163 rows 168 cols
[2025-06-02 12:28:25] [INFO ] Computed 23 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 79/110 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:25] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:25] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 8 ms to minimize.
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 5/15 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 31/141 variables, 6/21 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 18 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 6 (OVERLAPS) 27/168 variables, 7/28 constraints. Problems are: Problem set: 6 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 14 ms to minimize.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 4/32 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 163/331 variables, 168/200 constraints. Problems are: Problem set: 8 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:26] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 2/202 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/202 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/331 variables, 0/202 constraints. Problems are: Problem set: 8 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 202 constraints, problems are : Problem set: 8 solved, 15 unsolved in 2433 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 87/109 variables, 10/10 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 5/15 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 31/140 variables, 6/21 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 2/23 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/23 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 28/168 variables, 7/30 constraints. Problems are: Problem set: 8 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 4/34 constraints. Problems are: Problem set: 8 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:28] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 13 ms to minimize.
Problem AtomicPropp83 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 1/35 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 163/331 variables, 168/203 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 14/217 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:28] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:28] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 2/219 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 1/220 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:29] [INFO ] Deduced a trap along path composed of 8 places in 42 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:29] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:29] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/331 variables, 3/223 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:29] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 1/224 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:29] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 1/225 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:30] [INFO ] Deduced a trap along path composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/331 variables, 1/226 constraints. Problems are: Problem set: 9 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:28:30] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/331 variables, 1/227 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/331 variables, 0/227 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 0/331 variables, 0/227 constraints. Problems are: Problem set: 9 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 227 constraints, problems are : Problem set: 9 solved, 14 unsolved in 3878 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 14/23 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6360ms problems are : Problem set: 9 solved, 14 unsolved
Parikh walk visited 12 properties in 2484 ms.
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 163/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 168 transition count 157
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 162 transition count 157
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 12 place count 162 transition count 146
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 34 place count 151 transition count 146
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 58 place count 127 transition count 122
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 127 transition count 122
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 82 place count 127 transition count 113
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 118 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 113 transition count 108
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 113 transition count 108
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 156 place count 90 transition count 85
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 79 transition count 108
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 79 transition count 105
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 185 place count 76 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 76 transition count 104
Applied a total of 186 rules in 83 ms. Remains 76 /168 variables (removed 92) and now considering 104/163 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 76/168 places, 104/163 transitions.
RANDOM walk for 26194 steps (1338 resets) in 302 ms. (86 steps per ms) remains 0/2 properties
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2025-06-02 12:28:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:28:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MedleyA-PT-14-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:28:34] [INFO ] Input system was already deterministic with 163 transitions.
Support contains 73 out of 168 places (down from 89) after GAL structural reductions.
FORMULA MedleyA-PT-14-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 143 transition count 138
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 143 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 139 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 139 transition count 134
Applied a total of 58 rules in 12 ms. Remains 139 /168 variables (removed 29) and now considering 134/163 (removed 29) transitions.
// Phase 1: matrix 134 rows 139 cols
[2025-06-02 12:28:34] [INFO ] Computed 23 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:28:34] [INFO ] Implicit Places using invariants in 112 ms returned [37, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/168 places, 134/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 137/168 places, 134/163 transitions.
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 14 ms
[2025-06-02 12:28:34] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:28:34] [INFO ] Flatten gal took : 11 ms
[2025-06-02 12:28:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3709512934167871278.gal : 5 ms
[2025-06-02 12:28:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16829595489114967733.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3709512934167871278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16829595489114967733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.17671e+09,0.551816,19280,2,4478,5,63612,6,0,684,75686,0


Converting to forward existential form...Done !
original formula: E((EF((p161==1)) * AX(!((((p74==1)&&(p92==1))&&((p159==1)&&(p173==1)))))) U (p59==1))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (p161==1)) * !(EX(!(!((((p74==1)&&(p92==1))&&((p159==1)&&(p173==1))))))))) * (p59==1))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t14, t15, t25, t45, t57, t65, t78, t79, t80, t86, t99, t105, t111, t117, t124, t130, ...255
Detected timeout of ITS tools.
[2025-06-02 12:29:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:29:04] [INFO ] Applying decomposition
[2025-06-02 12:29:04] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3706312397313222487.txt' '-o' '/tmp/graph3706312397313222487.bin' '-w' '/tmp/graph3706312397313222487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3706312397313222487.bin' '-l' '-1' '-v' '-w' '/tmp/graph3706312397313222487.weights' '-q' '0' '-e' '0.001'
[2025-06-02 12:29:04] [INFO ] Decomposing Gal with order
[2025-06-02 12:29:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 12:29:04] [INFO ] Removed a total of 23 redundant transitions.
[2025-06-02 12:29:04] [INFO ] Flatten gal took : 100 ms
[2025-06-02 12:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 8 ms.
[2025-06-02 12:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability10612552787563128722.gal : 8 ms
[2025-06-02 12:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12136516615302428853.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10612552787563128722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12136516615302428853.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17671e+09,0.146485,8428,692,120,9355,1089,361,13958,101,2988,0


Converting to forward existential form...Done !
original formula: E((EF((i9.i0.u32.p161==1)) * AX(!((((i4.u15.p74==1)&&(i5.u19.p92==1))&&((i9.i0.u31.p159==1)&&(i9.i1.u35.p173==1)))))) U (i6.u12.p59==1))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (i9.i0.u32.p161==1)) * !(EX(!(!((((i4.u15.p74==1)&&(i5.u19.p92==1))&&((i9.i0.u31.p159==1)&...212
Reverse transition relation is NOT exact ! Due to transitions t5, t15, t25, t45, t65, t80, t99, t105, t111, t117, t124, t130, i0.u29.t86, i0.u36.t3, i2.t12...321
(forward)formula 0,1,8.43859,212204,1,0,502752,3669,1896,508743,593,18878,631529
FORMULA MedleyA-PT-14-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 167 transition count 157
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 162 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 161 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 12 place count 161 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 36 place count 149 transition count 144
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 58 place count 127 transition count 122
Iterating global reduction 3 with 22 rules applied. Total rules applied 80 place count 127 transition count 122
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 80 place count 127 transition count 116
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 121 transition count 116
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 117 transition count 112
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 117 transition count 112
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 3 with 40 rules applied. Total rules applied 140 place count 97 transition count 92
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 96 transition count 91
Applied a total of 141 rules in 40 ms. Remains 96 /168 variables (removed 72) and now considering 91/163 (removed 72) transitions.
// Phase 1: matrix 91 rows 96 cols
[2025-06-02 12:29:13] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:13] [INFO ] Implicit Places using invariants in 168 ms returned [7, 12, 24, 41, 61, 66, 77]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 170 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/168 places, 91/163 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 89 transition count 88
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 86 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 85 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 85 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 83 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 82 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 82 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 80 transition count 82
Applied a total of 18 rules in 14 ms. Remains 80 /89 variables (removed 9) and now considering 82/91 (removed 9) transitions.
// Phase 1: matrix 82 rows 80 cols
[2025-06-02 12:29:13] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 12:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 12:29:13] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [15, 38, 59]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 269 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 77/168 places, 82/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 497 ms. Remains : 77/168 places, 82/163 transitions.
[2025-06-02 12:29:13] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:29:13] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:29:13] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-02 12:29:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:29:13] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:29:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7661931015107886193.gal : 1 ms
[2025-06-02 12:29:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7290304630655047212.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7661931015107886193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7290304630655047212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,456304,0.161758,8948,2,742,5,20527,6,0,390,25175,0


Converting to forward existential form...Done !
original formula: E(!(EF((p38==1))) U (E((p86==1) U (p59==1)) + (EG(E((p150!=1) U ((p170==1)||(p73==1)))) * (p98==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(E(TRUE U (p38==1)))),(p86==1)) * (p59==1))] != FALSE + [FwdG((FwdU(Init,!(E(TRUE U (p38==1))...218
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t10, t13, t51, t55, t62, Intersection with reachable at each step enabled. (dest...196
Hit Full ! (commute/partial/dont) 79/0/3
(forward)formula 0,0,1.67068,50712,1,0,289,284847,206,165,2506,257745,375
FORMULA MedleyA-PT-14-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 144 transition count 139
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 144 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 139 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 139 transition count 134
Applied a total of 58 rules in 8 ms. Remains 139 /168 variables (removed 29) and now considering 134/163 (removed 29) transitions.
// Phase 1: matrix 134 rows 139 cols
[2025-06-02 12:29:15] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:15] [INFO ] Implicit Places using invariants in 129 ms returned [37, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 132 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/168 places, 134/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 137/168 places, 134/163 transitions.
[2025-06-02 12:29:15] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:29:15] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:29:15] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 12:29:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9483084064508837964.gal : 3 ms
[2025-06-02 12:29:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12064022435481145341.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9483084064508837964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12064022435481145341.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.50093e+09,0.525629,17760,2,3091,5,50544,6,0,684,68149,0


Converting to forward existential form...Done !
original formula: AG(AX((!(E((p81==1) U (p87==1))) * AX((p83==0)))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),(p81==1)) * (p87==1))] = FALSE * [(EY(EY(FwdU(Init,TRUE))) * !((p83==0)))] = FALSE)
(forward)formula 0,0,0.568329,18016,1,0,10,50544,9,2,1149,68149,3
FORMULA MedleyA-PT-14-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 143 transition count 138
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 143 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 138 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 138 transition count 133
Applied a total of 60 rules in 9 ms. Remains 138 /168 variables (removed 30) and now considering 133/163 (removed 30) transitions.
// Phase 1: matrix 133 rows 138 cols
[2025-06-02 12:29:16] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:16] [INFO ] Implicit Places using invariants in 132 ms returned [37, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/168 places, 133/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 136/168 places, 133/163 transitions.
[2025-06-02 12:29:16] [INFO ] Flatten gal took : 13 ms
[2025-06-02 12:29:16] [INFO ] Flatten gal took : 12 ms
[2025-06-02 12:29:16] [INFO ] Input system was already deterministic with 133 transitions.
[2025-06-02 12:29:16] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10121377021292040629.gal : 1 ms
[2025-06-02 12:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8673075403275978369.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10121377021292040629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8673075403275978369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.14891e+09,0.74103,21204,2,5534,5,72414,6,0,679,83633,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U AX((A((p71==1) U ((p63==1)&&(p95==1))) + EX((p150==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((!((E(!(((p63==1)&&(p95==1))) U (!((p71==1)) * !(((p63==1)&&(p95==1))))) + EG(!(((p63==1...509
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t14, t16, t26, t34, t46, t54, t65, t73, t78, t79, t80, t86, t99, t105, t111, t117, t1...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.0957,370252,1,0,339,2.27913e+06,297,163,4208,1.43343e+06,379
FORMULA MedleyA-PT-14-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 144 transition count 139
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 144 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 140 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 140 transition count 135
Applied a total of 56 rules in 8 ms. Remains 140 /168 variables (removed 28) and now considering 135/163 (removed 28) transitions.
// Phase 1: matrix 135 rows 140 cols
[2025-06-02 12:29:31] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:32] [INFO ] Implicit Places using invariants in 178 ms returned [38, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 135/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 138/168 places, 135/163 transitions.
[2025-06-02 12:29:32] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:32] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:32] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 12:29:32] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:32] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7647758999211003477.gal : 1 ms
[2025-06-02 12:29:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11046561496336106234.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7647758999211003477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11046561496336106234.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.42446e+09,0.664001,17528,2,3051,5,49640,6,0,689,67282,0


Converting to forward existential form...Done !
original formula: (E((p127!=1) U ((AF(AG((p158==1))) * (p17==1)) * (p47==1))) + AG(E(!(AX(EF((p21==1)))) U E(E(((p74==1)&&(p92==1)) U ((p120==1)&&(p148==1)...193
=> equivalent forward existential formula: [(FwdU((Init * !(E((p127!=1) U ((!(EG(!(!(E(TRUE U !((p158==1))))))) * (p17==1)) * (p47==1))))),TRUE) * !(E(!(!(...286
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t13, t15, t16, t26, t31, t33, t47, t66, t79, t80, t81, t87, t100, t106, t112, t118, t...266
(forward)formula 0,0,12.296,282184,1,0,521,1.34723e+06,312,282,4285,1.86436e+06,574
FORMULA MedleyA-PT-14-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 167 transition count 155
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 160 transition count 155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 160 transition count 145
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 34 place count 150 transition count 145
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 58 place count 126 transition count 121
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 126 transition count 121
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 82 place count 126 transition count 111
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 102 place count 116 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 112 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 112 transition count 107
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 152 place count 91 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 90 transition count 85
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 89 vertex of which 5 / 89 are part of one of the 2 SCC in 5 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 86 transition count 85
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 85 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 165 place count 82 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 82 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 166 place count 82 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 81 transition count 77
Applied a total of 168 rules in 72 ms. Remains 81 /168 variables (removed 87) and now considering 77/163 (removed 86) transitions.
// Phase 1: matrix 77 rows 81 cols
[2025-06-02 12:29:44] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:44] [INFO ] Implicit Places using invariants in 120 ms returned [8, 12, 17, 23, 32, 36, 40, 54, 58, 64, 70]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 121 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/168 places, 77/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 73
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 66 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 65 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 65 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 62 transition count 69
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 59 transition count 66
Applied a total of 22 rules in 8 ms. Remains 59 /70 variables (removed 11) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 59 cols
[2025-06-02 12:29:44] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 12:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/168 places, 66/163 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 421 ms. Remains : 59/168 places, 66/163 transitions.
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:29:45] [INFO ] Input system was already deterministic with 66 transitions.
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 15 ms
[2025-06-02 12:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14778089304703295266.gal : 1 ms
[2025-06-02 12:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1639115164666114692.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14778089304703295266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1639115164666114692.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,63168,0.076171,5356,2,334,5,6268,5,0,303,7393,0


Converting to forward existential form...Done !
original formula: E((p16!=1) U (p134==1))
=> equivalent forward existential formula: [(FwdU(Init,(p16!=1)) * (p134==1))] != FALSE
Hit Full ! (commute/partial/dont) 63/0/3
(forward)formula 0,1,0.118453,5612,1,0,8,6366,14,1,566,7410,4
FORMULA MedleyA-PT-14-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 159
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 164 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 8 place count 164 transition count 152
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 157 transition count 152
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 44 place count 135 transition count 130
Iterating global reduction 2 with 22 rules applied. Total rules applied 66 place count 135 transition count 130
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 66 place count 135 transition count 122
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 82 place count 127 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 123 transition count 118
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 123 transition count 118
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 132 place count 102 transition count 97
Applied a total of 132 rules in 31 ms. Remains 102 /168 variables (removed 66) and now considering 97/163 (removed 66) transitions.
// Phase 1: matrix 97 rows 102 cols
[2025-06-02 12:29:45] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants in 162 ms returned [10, 15, 27, 37, 42, 63, 68, 80]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 94/168 places, 97/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 95
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 92 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 91 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 91 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 88 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 86 transition count 89
Applied a total of 16 rules in 10 ms. Remains 86 /94 variables (removed 8) and now considering 89/97 (removed 8) transitions.
// Phase 1: matrix 89 rows 86 cols
[2025-06-02 12:29:45] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 12:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 12:29:45] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 299 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 85/168 places, 89/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 512 ms. Remains : 85/168 places, 89/163 transitions.
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:45] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15480702181120645981.gal : 1 ms
[2025-06-02 12:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17297950931015735753.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15480702181120645981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17297950931015735753.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,942729,0.455429,16584,2,1362,5,47398,6,0,429,60281,0


Converting to forward existential form...Done !
original formula: (E(EG(E((p174!=1) U AG(((p15==1)&&(p47==1))))) U (((p60==1)&&(p95==1)) + EF((((p156==1)&&(p178==1))||(p146==1))))) * !(E((((((p7==1)||((p...347
=> equivalent forward existential formula: ([(Init * !(E(EG(E((p174!=1) U !(E(TRUE U !(((p15==1)&&(p47==1))))))) U (((p60==1)&&(p95==1)) + E(TRUE U (((p156...493
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t11, t12, t56, t68, t77, t83, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,0,2.38005,61328,1,0,343,299311,224,181,2866,273891,404
FORMULA MedleyA-PT-14-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 145 transition count 140
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 145 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 140 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 140 transition count 135
Applied a total of 56 rules in 5 ms. Remains 140 /168 variables (removed 28) and now considering 135/163 (removed 28) transitions.
// Phase 1: matrix 135 rows 140 cols
[2025-06-02 12:29:48] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:29:48] [INFO ] Implicit Places using invariants in 125 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/168 places, 135/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 139/168 places, 135/163 transitions.
[2025-06-02 12:29:48] [INFO ] Flatten gal took : 23 ms
[2025-06-02 12:29:48] [INFO ] Flatten gal took : 17 ms
[2025-06-02 12:29:48] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 12:29:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 12:29:48] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10478732588780421404.gal : 2 ms
[2025-06-02 12:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7972078311569200847.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10478732588780421404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7972078311569200847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50043e+09,1.60414,36704,2,5804,5,138347,6,0,693,170160,0


Converting to forward existential form...Done !
original formula: AG((A(A(EF((p171==1)) U E((p154==1) U ((p101==1)&&(p179==1)))) U EF((AF((p182==1)) + (p8==1)))) + (E(!(((E((p7==1) U ((p130==1)&&(p144==1...244
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * !((E(!(((E((p7==1) U ((p130==1)&&(p144==1))) * (p130==1)) * (p144==1))) U (p4==1)) *...792
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t15, t16, t17, t18, t27, t47, t66, t75, t78, t80, t81, t82, t88, t91, t101, t107,...274
(forward)formula 0,0,15.8867,341944,1,0,326,1.88512e+06,310,165,4287,1.69326e+06,403
FORMULA MedleyA-PT-14-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 167 transition count 158
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 163 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 161 transition count 156
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 12 place count 161 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 34 place count 150 transition count 145
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 58 place count 126 transition count 121
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 126 transition count 121
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 82 place count 126 transition count 113
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 98 place count 118 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 103 place count 113 transition count 108
Iterating global reduction 3 with 5 rules applied. Total rules applied 108 place count 113 transition count 108
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 146 place count 94 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 93 transition count 88
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 92 vertex of which 5 / 92 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 88 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 159 place count 85 transition count 82
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 160 place count 85 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 160 place count 85 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 84 transition count 80
Applied a total of 162 rules in 39 ms. Remains 84 /168 variables (removed 84) and now considering 80/163 (removed 83) transitions.
// Phase 1: matrix 80 rows 84 cols
[2025-06-02 12:30:04] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:04] [INFO ] Implicit Places using invariants in 127 ms returned [6, 10, 15, 21, 31, 35, 39, 56, 60, 72]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 129 ms to find 10 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 74/168 places, 80/163 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 76
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 70 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 69 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 69 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 67 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 64 transition count 70
Applied a total of 20 rules in 10 ms. Remains 64 /74 variables (removed 10) and now considering 70/80 (removed 10) transitions.
// Phase 1: matrix 70 rows 64 cols
[2025-06-02 12:30:04] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:04] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 12:30:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:04] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/168 places, 70/163 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 443 ms. Remains : 64/168 places, 70/163 transitions.
[2025-06-02 12:30:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:30:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:30:04] [INFO ] Input system was already deterministic with 70 transitions.
[2025-06-02 12:30:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:30:04] [INFO ] Flatten gal took : 4 ms
[2025-06-02 12:30:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12723216687791026085.gal : 1 ms
[2025-06-02 12:30:04] [INFO ] Time to serialize properties into /tmp/CTLFireability6116267377105934074.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12723216687791026085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6116267377105934074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,172288,0.090101,5500,2,400,5,7360,5,0,326,8012,0


Converting to forward existential form...Done !
original formula: EF(((AG((p118==0)) * !(A(E((p45==1) U (p117==1)) U (EF((p161==1)) * (p134==1))))) * ((p122==0)||(p140==0))))
=> equivalent forward existential formula: (([((FwdU(((FwdU(Init,TRUE) * ((p122==0)||(p140==0))) * !(E(TRUE U !((p118==0))))),!((E(TRUE U (p161==1)) * (p13...537
Reverse transition relation is NOT exact ! Due to transitions t8, t41, t49, t59, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,1,0.41356,11132,1,0,153,39708,168,82,2070,29138,187
FORMULA MedleyA-PT-14-CTLFireability-2025-11 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 : 168/168 places, 163/163 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 145 transition count 140
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 145 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 140 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 140 transition count 135
Applied a total of 56 rules in 18 ms. Remains 140 /168 variables (removed 28) and now considering 135/163 (removed 28) transitions.
// Phase 1: matrix 135 rows 140 cols
[2025-06-02 12:30:05] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:05] [INFO ] Implicit Places using invariants in 172 ms returned [38, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 135/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 138/168 places, 135/163 transitions.
[2025-06-02 12:30:05] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:05] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:30:05] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 12:30:05] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:05] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8623211295621244857.gal : 2 ms
[2025-06-02 12:30:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6702434546244283605.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8623211295621244857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6702434546244283605.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47008e+09,1.13625,26880,2,6514,5,98286,6,0,689,109741,0


Converting to forward existential form...Done !
original formula: ((A((p117==1) U (AF(!(AX(((p63==1)&&(p77==1))))) * (p71==1))) + AG(EF((EF((p138==0)) + AF((p35==0)))))) + E(((!(AX(FALSE)) + AX(EG(((p15=...294
=> equivalent forward existential formula: [(FwdU(((Init * !(E(((!(!(EX(!(FALSE)))) + !(EX(!(EG(((p15==1)&&(p47==1))))))) * (p158==1)) U !((E(!(!((E(!((p35...813
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t13, t15, t16, t22, t26, t27, t35, t47, t66, t68, t70, t80, t81, t88, t101, t107, t11...270
(forward)formula 0,1,5.63289,117740,1,0,269,548154,296,128,4233,403772,301
FORMULA MedleyA-PT-14-CTLFireability-2024-12 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 : 168/168 places, 163/163 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 142 transition count 137
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 142 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 137 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 137 transition count 132
Applied a total of 62 rules in 6 ms. Remains 137 /168 variables (removed 31) and now considering 132/163 (removed 31) transitions.
// Phase 1: matrix 132 rows 137 cols
[2025-06-02 12:30:11] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:11] [INFO ] Implicit Places using invariants in 206 ms returned [37, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 211 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/168 places, 132/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 135/168 places, 132/163 transitions.
[2025-06-02 12:30:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:30:11] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:11] [INFO ] Input system was already deterministic with 132 transitions.
[2025-06-02 12:30:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:30:11] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:30:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6099111374654312515.gal : 2 ms
[2025-06-02 12:30:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12855130024110314811.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6099111374654312515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12855130024110314811.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.14837e+09,0.607597,16480,2,2971,5,46907,6,0,674,62661,0


Converting to forward existential form...Done !
original formula: AG((EX((p118==0)) + AX(((p28==0)||(p168==0)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX((p118==0))))) * !(((p28==0)||(p168==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t14, t15, t25, t45, t64, t77, t78, t79, t85, t98, t104, t110, t116, t122, t128, Inte...250
(forward)formula 0,1,1.81168,41456,1,0,245,142335,279,119,3836,126647,269
FORMULA MedleyA-PT-14-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 163/163 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 145 transition count 140
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 145 transition count 140
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 140 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 140 transition count 135
Applied a total of 56 rules in 6 ms. Remains 140 /168 variables (removed 28) and now considering 135/163 (removed 28) transitions.
// Phase 1: matrix 135 rows 140 cols
[2025-06-02 12:30:13] [INFO ] Computed 23 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:30:13] [INFO ] Implicit Places using invariants in 135 ms returned [37, 110]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 135/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 138/168 places, 135/163 transitions.
[2025-06-02 12:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:13] [INFO ] Flatten gal took : 8 ms
[2025-06-02 12:30:13] [INFO ] Input system was already deterministic with 135 transitions.
[2025-06-02 12:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:13] [INFO ] Flatten gal took : 7 ms
[2025-06-02 12:30:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8886296205302314409.gal : 2 ms
[2025-06-02 12:30:13] [INFO ] Time to serialize properties into /tmp/CTLFireability8859824634769887874.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8886296205302314409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8859824634769887874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33552e+09,0.771481,21324,2,5291,5,72968,6,0,689,85089,0


Converting to forward existential form...Done !
original formula: EF(((AF(AX(((p150==1)||((p139==1)&&(p177==1))))) * AF((((p123==1)||(p89==1))||(((p174==1)&&(p28==1))&&(p168==1))))) * ((p126==1)&&(p0==0)...158
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p126==1)&&(p0==0))) * !(EG(!(!(EX(!(((p150==1)||((p139==1)&&(p177==1)))))))))) * !(EG(!(...228
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t14, t16, t26, t31, t33, t35, t43, t47, t48, t56, t67, t75, t81, t82, t88, t101, t107...281
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.2316,331676,1,0,305,2.07713e+06,299,132,4269,1.28204e+06,333
FORMULA MedleyA-PT-14-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 12:30:26] [INFO ] Flatten gal took : 5 ms
[2025-06-02 12:30:26] [INFO ] Flatten gal took : 4 ms
Total runtime 124848 ms.

BK_STOP 1748867427046

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-14"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-14, 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 r128-smll-174876524100202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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