Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 110K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779700465392

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:14:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:14:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:14:27] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2026-05-25 09:14:27] [INFO ] Transformed 192 places.
[2026-05-25 09:14:27] [INFO ] Transformed 475 transitions.
[2026-05-25 09:14:27] [INFO ] Found NUPN structural information;
[2026-05-25 09:14:27] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 110 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 174 transition count 447
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 174 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 174 transition count 446
Applied a total of 37 rules in 26 ms. Remains 174 /192 variables (removed 18) and now considering 446/473 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14385415261207890222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15442681163832933788.kers'
[2026-05-25 09:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14385415261207890222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15442681163832933788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 446 rows 174 cols 1464 entries
Finished phase 1 with 166 SingleSign rule and 1 generalized
[2026-05-25 09:14:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15442681163832933788.kers
Total runtime 2 ms.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
[2026-05-25 09:14:27] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2026-05-25 09:14:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/620 variables, and 40 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (OVERLAPS) 446/620 variables, 174/214 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/620 variables, 445/659 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 3/662 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/620 variables, and 662 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 174/192 places, 446/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60920 ms. Remains : 174/192 places, 446/473 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2026-05-25 09:15:28] [INFO ] Invariant cache hit.
[2026-05-25 09:15:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 09:15:28] [INFO ] Invariant cache hit.
[2026-05-25 09:15:28] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 174/174 places, 446/446 transitions.
Support contains 110 out of 174 places after structural reductions.
[2026-05-25 09:15:28] [INFO ] Flatten gal took : 80 ms
[2026-05-25 09:15:28] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:15:28] [INFO ] Input system was already deterministic with 446 transitions.
Reduction of identical properties reduced properties to check from 139 to 136
RANDOM walk for 40000 steps (8 resets) in 2654 ms. (15 steps per ms) remains 125/136 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 23 ms. (16 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 125/125 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 125/125 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 125/125 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 125/125 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 125/125 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 125/125 properties
Probabilistic random walk after 100001 steps, saw 19138 distinct states, run finished after 790 ms. (steps per millisecond=126 ) properties seen :38
[2026-05-25 09:15:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp122 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/174 variables, 7/7 constraints. Problems are: Problem set: 11 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/14 constraints. Problems are: Problem set: 11 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/15 constraints. Problems are: Problem set: 11 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 11 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 446/620 variables, 174/189 constraints. Problems are: Problem set: 11 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/620 variables, 1/190 constraints. Problems are: Problem set: 11 solved, 76 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/620 variables, and 190 constraints, problems are : Problem set: 11 solved, 76 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 76 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/171 variables, 6/6 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 9/15 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 3/174 variables, 1/16 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 446/620 variables, 174/190 constraints. Problems are: Problem set: 12 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 75/265 constraints. Problems are: Problem set: 12 solved, 75 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/620 variables, and 265 constraints, problems are : Problem set: 12 solved, 75 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 75/87 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10074ms problems are : Problem set: 12 solved, 75 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 446/446 transitions.
Graph (trivial) has 76 edges and 174 vertex of which 3 / 174 are part of one of the 1 SCC in 12 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 172 transition count 432
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 161 transition count 429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 158 transition count 429
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 29 place count 158 transition count 425
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 37 place count 154 transition count 425
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 52 place count 139 transition count 397
Iterating global reduction 3 with 15 rules applied. Total rules applied 67 place count 139 transition count 397
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 78 place count 139 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 139 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 138 transition count 385
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 106 place count 125 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 125 transition count 371
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 124 transition count 369
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 124 transition count 369
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 117 place count 120 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 127 place count 120 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 119 transition count 384
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 119 transition count 384
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 118 transition count 393
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 136 place count 118 transition count 388
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 141 place count 113 transition count 388
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 113 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 112 transition count 399
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 145 place count 112 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 146 place count 111 transition count 398
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 11 edges and 110 vertex of which 2 / 110 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 148 place count 109 transition count 398
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 150 place count 109 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 156 place count 109 transition count 390
Applied a total of 156 rules in 140 ms. Remains 109 /174 variables (removed 65) and now considering 390/446 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 109/174 places, 390/446 transitions.
RANDOM walk for 40000 steps (8 resets) in 681 ms. (58 steps per ms) remains 73/75 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 69/72 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14654368771635463153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13120320261734136401.kers'
[2026-05-25 09:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14654368771635463153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13120320261734136401.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 390 rows 108 cols 1383 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 09:15:41] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13120320261734136401.kers
Total runtime 2 ms.
[2026-05-25 09:15:41] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 53/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 390/499 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 138 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 53/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 390/499 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 66/204 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/499 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 205 constraints, problems are : Problem set: 0 solved, 66 unsolved in 13167 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17160ms problems are : Problem set: 0 solved, 66 unsolved
Parikh walk visited 21 properties in 12154 ms.
Support contains 43 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 390/390 transitions.
Graph (trivial) has 42 edges and 109 vertex of which 2 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 387
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 107 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 106 transition count 386
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5 place count 106 transition count 383
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 103 transition count 383
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 17 place count 97 transition count 371
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 97 transition count 371
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 33 place count 97 transition count 361
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 43 place count 92 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 92 transition count 405
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 50 place count 92 transition count 400
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 55 place count 87 transition count 400
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 56 place count 87 transition count 399
Applied a total of 56 rules in 35 ms. Remains 87 /109 variables (removed 22) and now considering 399/390 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 87/109 places, 399/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 101 ms. (39 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 114 ms. (34 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 103 ms. (38 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
Finished probabilistic random walk after 161067 steps, run visited all 45 properties in 529 ms. (steps per millisecond=304 )
Probabilistic random walk after 161067 steps, saw 39098 distinct states, run finished after 533 ms. (steps per millisecond=302 ) properties seen :45
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:16:12] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:16:12] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:16:12] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 91 out of 174 places (down from 96) after GAL structural reductions.
Computed a total of 15 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 393
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 393
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 84 place count 143 transition count 371
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 142 transition count 369
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 142 transition count 369
Applied a total of 86 rules in 11 ms. Remains 142 /174 variables (removed 32) and now considering 369/446 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15552333862058765768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10636681878014791747.kers'
[2026-05-25 09:16:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15552333862058765768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10636681878014791747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 142 cols 1268 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:16:12] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10636681878014791747.kers
Total runtime 6 ms.
[2026-05-25 09:16:12] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 09:16:12] [INFO ] Invariant cache hit.
[2026-05-25 09:16:12] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 369/511 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 169 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 369/511 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 368/537 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 541 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 142/174 places, 369/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60432 ms. Remains : 142/174 places, 369/446 transitions.
[2026-05-25 09:17:12] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:17:12] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:17:12] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 09:17:12] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:17:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:17:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16834767430860925771.gal : 10 ms
[2026-05-25 09:17:12] [INFO ] Time to serialize properties into /tmp/CTLFireability6881621979760510680.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16834767430860925771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6881621979760510680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.574344,23864,2,4745,5,56105,6,0,939,77674,0


Converting to forward existential form...Done !
original formula: (EF((AX(EG(((p96==1)&&(p130==1)))) * ((p106==0)||(p124==0)))) + ((A(AG(AX(FALSE)) U AX(((p80!=1) * E((p66==1) U (p56==1))))) * AX(A(!((((...316
=> equivalent forward existential formula: (((([(EY((FwdU((Init * !(E(TRUE U (!(EX(!(EG(((p96==1)&&(p130==1)))))) * ((p106==0)||(p124==0)))))),!(!(EX(!(((p...1276
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...514
(forward)formula 0,0,6.75811,191560,1,0,853,777109,785,517,7906,1.00155e+06,969
FORMULA MedleyA-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 149 transition count 404
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 149 transition count 404
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 72 place count 149 transition count 382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 148 transition count 380
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 148 transition count 380
Applied a total of 74 rules in 8 ms. Remains 148 /174 variables (removed 26) and now considering 380/446 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-932125961313518818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6546688996231393496.kers'
[2026-05-25 09:17:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-932125961313518818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6546688996231393496.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 380 rows 148 cols 1290 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-25 09:17:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6546688996231393496.kers
Total runtime 2 ms.
[2026-05-25 09:17:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 09:17:19] [INFO ] Invariant cache hit.
[2026-05-25 09:17:19] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2026-05-25 09:17:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 380/528 variables, 148/175 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 177 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 380/528 variables, 148/178 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 379/557 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 558 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 148/174 places, 380/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60403 ms. Remains : 148/174 places, 380/446 transitions.
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:18:20] [INFO ] Input system was already deterministic with 380 transitions.
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:18:20] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:18:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4702621335692144581.gal : 4 ms
[2026-05-25 09:18:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8450088895754274131.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4702621335692144581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8450088895754274131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.28418e+06,0.527972,25908,2,5558,5,64342,6,0,974,90665,0


Converting to forward existential form...Done !
original formula: (!(E(((AX(((p20==1) * EF(((p94==1)&&(p124==1))))) + (EF(((p100==1)&&(p130==1))) * !(((p67==1)&&(p157==1))))) + ((p190!=1)||(!((p165==1)||...568
=> equivalent forward existential formula: ([(FwdU(Init,((!(EX(!(((p20==1) * E(TRUE U ((p94==1)&&(p124==1))))))) + (E(TRUE U ((p100==1)&&(p130==1))) * !(((...2017
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t12, t15, t20, t21, t24, t25, t32, t33, t35, t38, t39, t42, t45, t47, t49, t53, t57, ...597
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.5264,529976,1,0,823,3.54183e+06,817,421,8385,2.12276e+06,971
FORMULA MedleyA-PT-15-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 395
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 395
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 82 place count 144 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 143 transition count 371
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 143 transition count 371
Applied a total of 84 rules in 11 ms. Remains 143 /174 variables (removed 31) and now considering 371/446 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15485812229190043418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11637067802521101280.kers'
[2026-05-25 09:18:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15485812229190043418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11637067802521101280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 143 cols 1272 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:18:38] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11637067802521101280.kers
Total runtime 4 ms.
[2026-05-25 09:18:39] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 09:18:39] [INFO ] Invariant cache hit.
[2026-05-25 09:18:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-25 09:18:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 371/514 variables, 143/167 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 173 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/514 variables, 143/172 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 370/542 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 544 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 143/174 places, 371/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 143/174 places, 371/446 transitions.
[2026-05-25 09:19:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:19:39] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:19:39] [INFO ] Input system was already deterministic with 371 transitions.
[2026-05-25 09:19:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:19:39] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:19:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7659928665894218461.gal : 7 ms
[2026-05-25 09:19:39] [INFO ] Time to serialize properties into /tmp/CTLFireability10227253090284969024.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7659928665894218461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10227253090284969024.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91929e+06,0.493973,23036,2,4561,5,52695,6,0,945,74487,0


Converting to forward existential form...Done !
original formula: (AF((p20==1)) + EG((EX((EF((p65==1)) * EX(((p85==0)||(p148==0))))) * EX(AX((p15==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(EG((EX((E(TRUE U (p65==1)) * EX(((p85==0)||(p148==0))))) * EX(!(EX(!((p15==0))))))))),!((p20==1)...166
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...526
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.67339,228772,1,0,710,1.37641e+06,782,365,8165,883634,838
FORMULA MedleyA-PT-15-CTLFireability-2024-03 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 : 174/174 places, 446/446 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 394
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 394
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 78 place count 144 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 143 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 143 transition count 374
Applied a total of 80 rules in 11 ms. Remains 143 /174 variables (removed 31) and now considering 374/446 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3171377032190228741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13315765630827272815.kers'
[2026-05-25 09:19:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3171377032190228741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13315765630827272815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 374 rows 143 cols 1286 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:19:47] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-13315765630827272815.kers
Total runtime 13 ms.
[2026-05-25 09:19:47] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-25 09:19:47] [INFO ] Invariant cache hit.
[2026-05-25 09:19:47] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2026-05-25 09:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 374/517 variables, 143/167 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/517 variables, and 170 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 374/517 variables, 143/173 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 373/546 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 550 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 143/174 places, 374/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60443 ms. Remains : 143/174 places, 374/446 transitions.
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:47] [INFO ] Input system was already deterministic with 374 transitions.
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:20:47] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3798660830798725497.gal : 3 ms
[2026-05-25 09:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17804884309039003512.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3798660830798725497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17804884309039003512.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.571151,23244,2,4568,5,54477,6,0,948,74241,0


Converting to forward existential form...Done !
original formula: EF(EX(E(((p172==1)&&(p31==1)) U A(((p85==1)&&(p140==1)) U (p76==1)))))
=> equivalent forward existential formula: [((FwdU(EY(FwdU(Init,TRUE)),((p172==1)&&(p31==1))) * !(EG(!((p76==1))))) * !(E(!((p76==1)) U (!(((p85==1)&&(p140...189
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...519
Hit Full ! (commute/partial/dont) 367/7/7
(forward)formula 0,1,2.36022,72736,1,0,661,317460,782,338,8075,261161,787
FORMULA MedleyA-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Graph (trivial) has 193 edges and 174 vertex of which 9 / 174 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 167 transition count 417
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 145 transition count 417
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 45 place count 145 transition count 409
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 61 place count 137 transition count 409
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 89 place count 109 transition count 358
Iterating global reduction 2 with 28 rules applied. Total rules applied 117 place count 109 transition count 358
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 142 place count 109 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 108 transition count 333
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 143 place count 108 transition count 330
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 105 transition count 330
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 103 transition count 324
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 103 transition count 324
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 177 place count 91 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 91 transition count 311
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 181 place count 88 transition count 304
Iterating global reduction 5 with 3 rules applied. Total rules applied 184 place count 88 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 198 place count 88 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 202 place count 86 transition count 288
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 86 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 85 transition count 287
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 103 edges and 83 vertex of which 36 / 83 are part of one of the 14 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 207 place count 61 transition count 287
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 6 with 83 rules applied. Total rules applied 290 place count 61 transition count 204
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 296 place count 55 transition count 147
Iterating global reduction 7 with 6 rules applied. Total rules applied 302 place count 55 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 304 place count 55 transition count 145
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 8 with 4 rules applied. Total rules applied 308 place count 53 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 8 with 41 rules applied. Total rules applied 349 place count 53 transition count 102
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 8 with 4 rules applied. Total rules applied 353 place count 53 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 357 place count 49 transition count 98
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 10 with 4 rules applied. Total rules applied 361 place count 47 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 362 place count 47 transition count 95
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 363 place count 47 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 364 place count 46 transition count 94
Applied a total of 364 rules in 89 ms. Remains 46 /174 variables (removed 128) and now considering 94/446 (removed 352) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2885562535353577153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12034168250995429253.kers'
[2026-05-25 09:20:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2885562535353577153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12034168250995429253.kers]
Normalized transition count is 93 out of 94 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 46 cols 318 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:20:50] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12034168250995429253.kers
Total runtime 1 ms.
[2026-05-25 09:20:50] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:20:50] [INFO ] Invariant cache hit.
[2026-05-25 09:20:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:20:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2026-05-25 09:20:50] [INFO ] Redundant transitions in 18 ms returned [90, 91, 92, 93]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 84 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-798533548591761282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5108807187544013816.kers'
[2026-05-25 09:20:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-798533548591761282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5108807187544013816.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 46 cols 302 entries
Finished phase 1 with 40 SingleSign rule and 1 generalized
[2026-05-25 09:20:50] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5108807187544013816.kers
Total runtime 0 ms.
[2026-05-25 09:20:50] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 89/135 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/136 variables, and 74 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2612 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 89/135 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 84/158 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6854ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 6855ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/174 places, 90/446 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 46 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 44 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 44 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 44 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 43 transition count 86
Applied a total of 7 rules in 9 ms. Remains 43 /46 variables (removed 3) and now considering 86/90 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11296157817799988789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6778022858011038676.kers'
[2026-05-25 09:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11296157817799988789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6778022858011038676.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 43 cols 294 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-25 09:20:57] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6778022858011038676.kers
Total runtime 1 ms.
[2026-05-25 09:20:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:20:57] [INFO ] Invariant cache hit.
[2026-05-25 09:20:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:20:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 43/174 places, 86/446 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 7312 ms. Remains : 43/174 places, 86/446 transitions.
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:20:57] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:20:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15976671865079592520.gal : 1 ms
[2026-05-25 09:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17078931225731193581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15976671865079592520.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17078931225731193581.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 33964 steps (8426 resets) in 124 ms. (271 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-15-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 146 transition count 398
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 146 transition count 398
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 70 place count 146 transition count 384
Applied a total of 70 rules in 4 ms. Remains 146 /174 variables (removed 28) and now considering 384/446 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16749895742300636399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5910468131112808393.kers'
[2026-05-25 09:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16749895742300636399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5910468131112808393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 146 cols 1312 entries
Finished phase 1 with 138 SingleSign rule and 1 generalized
[2026-05-25 09:20:57] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5910468131112808393.kers
Total runtime 1 ms.
[2026-05-25 09:20:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 09:20:57] [INFO ] Invariant cache hit.
[2026-05-25 09:20:57] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2026-05-25 09:20:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 384/530 variables, 146/172 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 174 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (OVERLAPS) 384/530 variables, 146/174 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 383/557 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 561 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 146/174 places, 384/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60325 ms. Remains : 146/174 places, 384/446 transitions.
[2026-05-25 09:21:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:21:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:21:57] [INFO ] Input system was already deterministic with 384 transitions.
[2026-05-25 09:21:57] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:21:57] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:21:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14391077506735341472.gal : 16 ms
[2026-05-25 09:21:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2032840850534622306.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14391077506735341472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2032840850534622306.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02662e+06,0.44286,21892,2,4227,5,50101,6,0,970,69814,0


Converting to forward existential form...Done !
original formula: ((EF(EG(E((p70==1) U (((p28==1)&&(p44==1))&&(p191==1))))) * AF(E((p40!=1) U AX((((p19==1)&&(p179==1))&&(p186==1)))))) * A(EG(E(AG((p75==1...260
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(E((p70==1) U (((p28==1)&&(p44==1))&&(p191==1)))))))] = FALSE * [FwdG(Init,!(E((p40!=1) ...1120
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t25, t26, t33, t34, t36, t38, t39, t41, t42, t45, t48, t50, t54, t58,...541
(forward)formula 0,0,8.3201,256572,1,0,742,1.53666e+06,829,383,8446,963270,896
FORMULA MedleyA-PT-15-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 391
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 391
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 141 transition count 364
Applied a total of 91 rules in 17 ms. Remains 141 /174 variables (removed 33) and now considering 364/446 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10908846248137262478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5408583834804727215.kers'
[2026-05-25 09:22:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10908846248137262478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5408583834804727215.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:22:06] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5408583834804727215.kers
Total runtime 15 ms.
[2026-05-25 09:22:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:22:06] [INFO ] Invariant cache hit.
[2026-05-25 09:22:06] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:22:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 141/174 places, 364/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 141/174 places, 364/446 transitions.
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:23:06] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:23:06] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17953901736509555613.gal : 1 ms
[2026-05-25 09:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13967972165571363553.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17953901736509555613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13967972165571363553.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81482e+06,0.459701,20764,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: ((EX(AG(((p71!=1)||(p140!=1)))) * !(A((p90==1) U EX((p149==1))))) * !(A(((p100==1)&&(p134==1)) U A(!(((p78==1)&&(p159==1))) U EF((p74==1)...160
=> equivalent forward existential formula: (([((FwdU((FwdU((Init * (EX(!(E(TRUE U !(((p71!=1)||(p140!=1)))))) * !(!((E(!(EX((p149==1))) U (!((p90==1)) * !(...1049
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t62, t67,...508
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.0154,310664,1,0,809,1.95643e+06,776,430,7987,1.24333e+06,952
FORMULA MedleyA-PT-15-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 393
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 393
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 87 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 142 transition count 366
Applied a total of 89 rules in 4 ms. Remains 142 /174 variables (removed 32) and now considering 366/446 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16210446824568968840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15486901252715330996.kers'
[2026-05-25 09:23:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16210446824568968840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15486901252715330996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:23:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15486901252715330996.kers
Total runtime 2 ms.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-25 09:23:18] [INFO ] Invariant cache hit.
[2026-05-25 09:23:18] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:23:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/508 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/508 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 167 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 366/508 variables, 142/167 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 365/532 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 536 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 142/174 places, 366/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 142/174 places, 366/446 transitions.
[2026-05-25 09:24:18] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:24:18] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:24:18] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-25 09:24:18] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:24:18] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:24:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1961430228184240319.gal : 2 ms
[2026-05-25 09:24:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8162308927826134813.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1961430228184240319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8162308927826134813.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84817e+06,0.42896,20820,2,4302,5,47504,6,0,936,66312,0


Converting to forward existential form...Done !
original formula: E(EG((!((AG(((p106==1)&&(p156==1))) * !(((p87==1)&&(p150==1))))) + A(A((p160==1) U (((p18==1)&&(p35==1))&&(p191==1))) U (((p44==1)&&(p174...237
=> equivalent forward existential formula: ([(FwdU(Init,EG((!((!(E(TRUE U !(((p106==1)&&(p156==1))))) * !(((p87==1)&&(p150==1))))) + !((E(!((((p44==1)&&(p1...965
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t22, t23, t25, t26, t33, t34, t36, t39, t40, t43, t46, t48, t52, t56, t58,...519
(forward)formula 0,1,7.60846,234840,1,0,718,1.36591e+06,777,373,8142,900670,859
FORMULA MedleyA-PT-15-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 393
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 393
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 87 place count 143 transition count 368
Applied a total of 87 rules in 7 ms. Remains 143 /174 variables (removed 31) and now considering 368/446 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6880332430629313092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17908610998730857128.kers'
[2026-05-25 09:24:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6880332430629313092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17908610998730857128.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 143 cols 1260 entries
Finished phase 1 with 135 SingleSign rule and 1 generalized
[2026-05-25 09:24:26] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17908610998730857128.kers
Total runtime 4 ms.
[2026-05-25 09:24:26] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-25 09:24:26] [INFO ] Invariant cache hit.
[2026-05-25 09:24:26] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/511 variables, 143/166 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 0/511 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 168 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (OVERLAPS) 368/511 variables, 143/168 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 367/535 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 3/538 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 538 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 143/174 places, 368/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 143/174 places, 368/446 transitions.
[2026-05-25 09:25:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:26] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:25:26] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:25:27] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:25:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17292014279757014035.gal : 2 ms
[2026-05-25 09:25:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7782435580291526483.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17292014279757014035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7782435580291526483.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9987e+06,0.429477,21652,2,4365,5,50216,6,0,942,68250,0


Converting to forward existential form...Done !
original formula: A((AG(((p35==1)&&(p176==1))) * !(((p61==1)&&(p130==1)))) U (((EG((p171==1)) + !(EF((p49==1)))) + (((p100==1)&&(p134==1)) + ((!((!(AF(((p8...343
=> equivalent forward existential formula: [((Init * !(EG(!((((EG((p171==1)) + !(E(TRUE U (p49==1)))) + (((p100==1)&&(p134==1)) + ((!((!(!(EG(!(((p87==1)&&...1052
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t25, t26, t33, t34, t36, t37, t39, t40, t43, t46, t48, t52, t56, t58,...525
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.06528,185624,1,0,705,1.09874e+06,793,371,8090,679548,838
FORMULA MedleyA-PT-15-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 146 transition count 399
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 146 transition count 399
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 78 place count 146 transition count 377
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 145 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 145 transition count 375
Applied a total of 80 rules in 11 ms. Remains 145 /174 variables (removed 29) and now considering 375/446 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7870009371452437415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-36584108000982256.kers'
[2026-05-25 09:25:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7870009371452437415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-36584108000982256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 375 rows 145 cols 1280 entries
Finished phase 1 with 137 SingleSign rule and 1 generalized
[2026-05-25 09:25:33] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-36584108000982256.kers
Total runtime 5 ms.
[2026-05-25 09:25:33] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 09:25:33] [INFO ] Invariant cache hit.
[2026-05-25 09:25:33] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2026-05-25 09:25:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 375/520 variables, 145/172 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/520 variables, and 172 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/520 variables, 145/172 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 374/546 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 547 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 145/174 places, 375/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60501 ms. Remains : 145/174 places, 375/446 transitions.
[2026-05-25 09:26:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:33] [INFO ] Input system was already deterministic with 375 transitions.
[2026-05-25 09:26:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:26:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:26:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8439425919815977988.gal : 2 ms
[2026-05-25 09:26:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4666922389927066818.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8439425919815977988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4666922389927066818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.94983e+06,0.482589,21336,2,4440,5,50099,6,0,957,68716,0


Converting to forward existential form...Done !
original formula: EF(((EG(A((p95==1) U (p66==1))) + AF((p98==1))) + (((p95==1) * EX(((p61==1)&&(p156==1)))) * (EF(((p77==1)&&(p148==1))) + (p135==0)))))
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((E(!((p66==1)) U (!((p95==1)) * !((p66==1)))) + EG(!((p66==1))))))] != FALSE + [(FwdU(...396
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t48, t52, t56, t58, t64,...536
(forward)formula 0,1,2.11159,71428,1,0,679,312166,781,344,7878,254582,789
FORMULA MedleyA-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 392
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 87 place count 143 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 142 transition count 365
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 142 transition count 365
Applied a total of 89 rules in 4 ms. Remains 142 /174 variables (removed 32) and now considering 365/446 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8840819608651966510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17081050804809841834.kers'
[2026-05-25 09:26:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8840819608651966510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17081050804809841834.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 142 cols 1254 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:26:35] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17081050804809841834.kers
Total runtime 2 ms.
[2026-05-25 09:26:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 09:26:35] [INFO ] Invariant cache hit.
[2026-05-25 09:26:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:26:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (OVERLAPS) 365/507 variables, 142/169 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 170 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 365/507 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 364/534 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 537 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 142/174 places, 365/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60332 ms. Remains : 142/174 places, 365/446 transitions.
[2026-05-25 09:27:36] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:27:36] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:27:36] [INFO ] Input system was already deterministic with 365 transitions.
[2026-05-25 09:27:36] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:27:36] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:27:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16622539390243024448.gal : 2 ms
[2026-05-25 09:27:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8154448461822323992.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16622539390243024448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8154448461822323992.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85611e+06,0.563038,26080,2,5057,5,61443,6,0,935,85392,0


Converting to forward existential form...Done !
original formula: A(!((((p62!=1) + A(((((p9==1)&&(p174==1))||(p169==1)) * A(((p77==1)&&(p134==1)) U (p119==1))) U !(((p126==1)&&(p106==1))))) + AX(FALSE)))...191
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U ((p77==1)&&(p148==1))))))))) * !(E(!(E(TRUE U !(E(TRUE U ((p77==1)&&(p148==...500
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t15, t20, t21, t24, t25, t32, t33, t35, t38, t39, t42, t45, t47, t51, t54, t57, t63,...513
(forward)formula 0,1,10.0909,279460,1,0,687,1.73818e+06,767,360,7732,1.02978e+06,828
FORMULA MedleyA-PT-15-CTLFireability-2024-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 : 174/174 places, 446/446 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 394
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 394
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 82 place count 144 transition count 372
Applied a total of 82 rules in 4 ms. Remains 144 /174 variables (removed 30) and now considering 372/446 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18380207048834955582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9557651607932376163.kers'
[2026-05-25 09:27:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18380207048834955582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9557651607932376163.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 144 cols 1274 entries
Finished phase 1 with 136 SingleSign rule and 1 generalized
[2026-05-25 09:27:46] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9557651607932376163.kers
Total runtime 2 ms.
[2026-05-25 09:27:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 09:27:46] [INFO ] Invariant cache hit.
[2026-05-25 09:27:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2026-05-25 09:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 372/516 variables, 144/168 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 171 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 372/516 variables, 144/171 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 371/542 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 546 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 144/174 places, 372/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60433 ms. Remains : 144/174 places, 372/446 transitions.
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:28:46] [INFO ] Input system was already deterministic with 372 transitions.
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:28:46] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7361107149776714050.gal : 2 ms
[2026-05-25 09:28:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18347629653195679272.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7361107149776714050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18347629653195679272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.80666e+06,0.533575,23676,2,4647,5,55272,6,0,950,76760,0


Converting to forward existential form...Done !
original formula: AG((EX((A(((p94==1)&&(p140==1)) U (p93==1)) + ((((p78==0)||(p141==0))&&((p61==0)||(p141==0)))&&((p147==0)&&((p9==0)||(p113==0)))))) + (((...376
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EX((!((E(!((p93==1)) U (!(((p94==1)&&(p140==1))) * !((p93==1)))) + EG(!((p93==1))))) + ...1499
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t21, t22, t25, t26, t28, t35, t36, t38, t39, t41, t42, t45, t48, t50, t54, t58,...530
(forward)formula 0,1,2.37034,78308,1,0,702,366810,808,364,7824,305531,822
FORMULA MedleyA-PT-15-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Graph (trivial) has 188 edges and 174 vertex of which 9 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 167 transition count 418
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 146 transition count 418
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 146 transition count 411
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 57 place count 139 transition count 411
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 83 place count 113 transition count 364
Iterating global reduction 2 with 26 rules applied. Total rules applied 109 place count 113 transition count 364
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 124 place count 113 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 112 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 125 place count 112 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 110 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 109 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 109 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 155 place count 97 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 97 transition count 332
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 95 transition count 328
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 95 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 172 place count 95 transition count 316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 93 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 92 transition count 313
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 94 edges and 91 vertex of which 18 / 91 are part of one of the 7 SCC in 1 ms
Free SCC test removed 11 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 179 place count 80 transition count 313
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 216 place count 80 transition count 276
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 218 place count 78 transition count 244
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 78 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 236 place count 78 transition count 228
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 78 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 238 place count 77 transition count 227
Applied a total of 238 rules in 36 ms. Remains 77 /174 variables (removed 97) and now considering 227/446 (removed 219) transitions.
[2026-05-25 09:28:49] [INFO ] Flow matrix only has 185 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12323620405576748443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-696379145604211633.kers'
[2026-05-25 09:28:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12323620405576748443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-696379145604211633.kers]
Normalized transition count is 184 out of 185 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 184 rows 76 cols 580 entries
Finished phase 1 with 70 SingleSign rule and 1 generalized
[2026-05-25 09:28:49] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-696379145604211633.kers
Total runtime 1 ms.
[2026-05-25 09:28:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 09:28:49] [INFO ] Flow matrix only has 185 transitions (discarded 42 similar events)
[2026-05-25 09:28:49] [INFO ] Invariant cache hit.
[2026-05-25 09:28:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 09:28:49] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2026-05-25 09:28:49] [INFO ] Redundant transitions in 5 ms returned []
Running 221 sub problems to find dead transitions.
[2026-05-25 09:28:49] [INFO ] Flow matrix only has 185 transitions (discarded 42 similar events)
[2026-05-25 09:28:49] [INFO ] Invariant cache hit.
[2026-05-25 09:28:49] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 184/261 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/262 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 123 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 184/261 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 221/343 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 1/262 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 345 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21818 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37905ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 37906ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/174 places, 227/446 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38083 ms. Remains : 77/174 places, 227/446 transitions.
[2026-05-25 09:29:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:29:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:29:27] [INFO ] Input system was already deterministic with 227 transitions.
[2026-05-25 09:29:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:29:27] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability18106948826971063684.gal : 1 ms
[2026-05-25 09:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2506703072161559564.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18106948826971063684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2506703072161559564.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,77576,0.100764,7512,2,1121,5,11031,6,0,531,10634,0


Converting to forward existential form...Done !
original formula: EF(AG((AF((((p13==0)||(p48==0))||(p188==0))) + (!(E((p139==1) U (p129==1))) * EG(((p87==1)&&(p124==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!((((p13==0)||(p48==0))||(p188==0))))) + (!(E((p139==1) U (p129==1))) * E...195
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t10, t13, t19, t20, t23, t24, t29, t32, t35, t39, t42, t47, t50, t52, t54, t58, t61, ...334
(forward)formula 0,1,0.751804,31156,1,0,440,146639,485,237,4305,100551,532
FORMULA MedleyA-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 143 transition count 393
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 143 transition count 393
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 87 place count 143 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 142 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 142 transition count 366
Applied a total of 89 rules in 9 ms. Remains 142 /174 variables (removed 32) and now considering 366/446 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13753669014394704312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1629298379481388423.kers'
[2026-05-25 09:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13753669014394704312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1629298379481388423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 142 cols 1256 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:29:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1629298379481388423.kers
Total runtime 1 ms.
[2026-05-25 09:29:28] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-25 09:29:28] [INFO ] Invariant cache hit.
[2026-05-25 09:29:28] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:29:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/168 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 171 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/172 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 365/537 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 3/540 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 540 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 142/174 places, 366/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60501 ms. Remains : 142/174 places, 366/446 transitions.
[2026-05-25 09:30:28] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:30:28] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:30:28] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-25 09:30:28] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:30:28] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:30:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4930112366340387373.gal : 2 ms
[2026-05-25 09:30:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14176137105509945676.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4930112366340387373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14176137105509945676.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(E((((p94==1)&&(p124==1)) * (!((!(((p93==1)&&(p156==1))) + EG((p36==1)))) + (p67==1))) U (((p100==1)&&(p134==1)) + (AX(EF(((p71==1)&&(p1...284
=> equivalent forward existential formula: [(FwdU(Init,E((((p94==1)&&(p124==1)) * (!((!(((p93==1)&&(p156==1))) + EG((p36==1)))) + (p67==1))) U (((p100==1)&...348
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t14, t19, t20, t23, t24, t31, t32, t34, t37, t38, t41, t44, t46, t50, t54, t56, t59,...542
(forward)formula 0,1,14.9606,318828,1,0,823,2.04109e+06,776,439,7918,1.27868e+06,961
FORMULA MedleyA-PT-15-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 446/446 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 391
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 391
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 142 transition count 366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 141 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 141 transition count 364
Applied a total of 91 rules in 4 ms. Remains 141 /174 variables (removed 33) and now considering 364/446 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16332579122158527456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2893941055648153811.kers'
[2026-05-25 09:30:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16332579122158527456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2893941055648153811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 141 cols 1252 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-25 09:30:43] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2893941055648153811.kers
Total runtime 3 ms.
[2026-05-25 09:30:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:30:43] [INFO ] Invariant cache hit.
[2026-05-25 09:30:44] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 09:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 164 constraints, problems are : Problem set: 0 solved, 363 unsolved in 28152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 364/505 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 363/529 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 533 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 58240ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 58241ms
Starting structural reductions in LTL mode, iteration 1 : 141/174 places, 364/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58485 ms. Remains : 141/174 places, 364/446 transitions.
[2026-05-25 09:31:42] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:31:42] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:31:42] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 09:31:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:31:42] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:31:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7435473134979570098.gal : 2 ms
[2026-05-25 09:31:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13914213246468879883.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7435473134979570098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13914213246468879883.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81482e+06,0.475131,20736,2,4314,5,47091,6,0,930,65677,0


Converting to forward existential form...Done !
original formula: EF(EX(EF(((EF(((p71==1)&&(p162==1))) + (((p25==1)&&(p48==1))&&(p188==1))) + ((((p22==1)&&(p48==1))&&((p188==1)&&(p100==1)))&&(p130==1))))...157
=> equivalent forward existential formula: (([(FwdU(FwdU(EY(FwdU(Init,TRUE)),TRUE),TRUE) * ((p71==1)&&(p162==1)))] != FALSE + [(FwdU(EY(FwdU(Init,TRUE)),TR...315
(forward)formula 0,1,0.56434,21000,1,0,7,47091,9,1,1895,65677,4
FORMULA MedleyA-PT-15-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 09:31:43] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:31:43] [INFO ] Flatten gal took : 4 ms
Total runtime 1036019 ms.

BK_STOP 1779701503071

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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