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-177969019900114.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-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 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 26K 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-03-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779699007930

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 08:50:09] [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 08:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:50:10] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2026-05-25 08:50:10] [INFO ] Transformed 108 places.
[2026-05-25 08:50:10] [INFO ] Transformed 100 transitions.
[2026-05-25 08:50:10] [INFO ] Found NUPN structural information;
[2026-05-25 08:50:10] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 65 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 104 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 104 transition count 97
Applied a total of 7 rules in 37 ms. Remains 104 /108 variables (removed 4) and now considering 97/100 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14621955511905270390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14912320994211028489.kers'
[2026-05-25 08:50:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14621955511905270390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14912320994211028489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 265 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-25 08:50:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-14912320994211028489.kers
Total runtime 15 ms.
[2026-05-25 08:50:10] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-25 08:50:10] [INFO ] Invariant cache hit.
[2026-05-25 08:50:11] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 08:50:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 97/201 variables, 104/142 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 145 constraints, problems are : Problem set: 0 solved, 96 unsolved in 15831 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 97/201 variables, 104/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46020ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 46046ms
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 97/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46929 ms. Remains : 104/108 places, 97/100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2026-05-25 08:50:57] [INFO ] Invariant cache hit.
[2026-05-25 08:50:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 08:50:57] [INFO ] Invariant cache hit.
[2026-05-25 08:50:57] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 104/104 places, 97/97 transitions.
Support contains 65 out of 104 places after structural reductions.
[2026-05-25 08:50:57] [INFO ] Flatten gal took : 84 ms
[2026-05-25 08:50:57] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:50:57] [INFO ] Input system was already deterministic with 97 transitions.
RANDOM walk for 40000 steps (667 resets) in 1396 ms. (28 steps per ms) remains 9/62 properties
BEST_FIRST walk for 40003 steps (193 resets) in 251 ms. (158 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (189 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (191 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (191 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (198 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (177 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (201 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (195 resets) in 298 ms. (133 steps per ms) remains 8/8 properties
[2026-05-25 08:50:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/84 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/92 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 97/189 variables, 92/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/201 variables, 12/112 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 2 solved, 6 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/54 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 37/91 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 97/188 variables, 91/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/100 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 13/201 variables, 13/113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 6/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 119 constraints, problems are : Problem set: 2 solved, 6 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1483ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 3 properties in 1505 ms.
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 97/97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 81
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 88 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 87 transition count 80
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 34 place count 87 transition count 72
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 50 place count 79 transition count 72
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 74 transition count 67
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 74 transition count 67
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 94 place count 57 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 57 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 55 transition count 48
Applied a total of 97 rules in 28 ms. Remains 55 /104 variables (removed 49) and now considering 48/97 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 55/104 places, 48/97 transitions.
RANDOM walk for 40000 steps (1552 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (589 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (621 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (488 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 11349 steps, run visited all 3 properties in 63 ms. (steps per millisecond=180 )
Probabilistic random walk after 11349 steps, saw 4361 distinct states, run finished after 67 ms. (steps per millisecond=169 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2026-05-25 08:51:02] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:51:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:51:02] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 59 out of 104 places (down from 61) after GAL structural reductions.
Computed a total of 104 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 97
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA MedleyA-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 103 transition count 77
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 84 transition count 77
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 84 transition count 71
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 78 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 74 transition count 67
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 74 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 74 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 73 transition count 66
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 90 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 57 transition count 50
Applied a total of 91 rules in 17 ms. Remains 57 /104 variables (removed 47) and now considering 50/97 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5595174743265276236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5285345113148904812.kers'
[2026-05-25 08:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5595174743265276236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5285345113148904812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 57 cols 163 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 08:51:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5285345113148904812.kers
Total runtime 0 ms.
[2026-05-25 08:51:02] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-25 08:51:02] [INFO ] Invariant cache hit.
[2026-05-25 08:51:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 08:51:02] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-25 08:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/106 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 65 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1686 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/106 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/107 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 115 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5443 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7145ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 7146ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/104 places, 50/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7387 ms. Remains : 57/104 places, 50/97 transitions.
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:51:09] [INFO ] Input system was already deterministic with 50 transitions.
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:51:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:51:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3162200674597931931.gal : 3 ms
[2026-05-25 08:51:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5029403760271881422.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3162200674597931931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5029403760271881422.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.32116e+06,0.053814,4396,2,664,5,2959,6,0,278,2190,0


Converting to forward existential form...Done !
original formula: EF((AG((p27==1)) * (p67==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p67==1)) * !(E(TRUE U !((p27==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t6, t8, t10, t12, t15, t42, t43, t44, Intersection with reachable at each step e...210
(forward)formula 0,0,0.173164,11064,1,0,123,45512,122,55,1671,34260,113
FORMULA MedleyA-PT-03-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 94 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 94 transition count 87
Applied a total of 20 rules in 6 ms. Remains 94 /104 variables (removed 10) and now considering 87/97 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2783011401704390397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7778526024579285896.kers'
[2026-05-25 08:51:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2783011401704390397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7778526024579285896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 87 rows 94 cols 245 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 08:51:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7778526024579285896.kers
Total runtime 0 ms.
[2026-05-25 08:51:09] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-25 08:51:09] [INFO ] Invariant cache hit.
[2026-05-25 08:51:10] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-25 08:51:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/181 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/181 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 117 constraints, problems are : Problem set: 0 solved, 86 unsolved in 18225 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/181 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 86/203 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 181/181 variables, and 218 constraints, problems are : Problem set: 0 solved, 86 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48266ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 48267ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 87/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48595 ms. Remains : 94/104 places, 87/97 transitions.
[2026-05-25 08:51:58] [INFO ] Flatten gal took : 9 ms
[2026-05-25 08:51:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:51:58] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-25 08:51:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:51:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:51:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16708955019174223489.gal : 1 ms
[2026-05-25 08:51:58] [INFO ] Time to serialize properties into /tmp/CTLFireability193262884268898071.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/CTLFireability16708955019174223489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability193262884268898071.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.18095e+08,0.273869,15488,2,2876,5,36493,6,0,465,72366,0


Converting to forward existential form...Done !
original formula: (E(EG(((p78==1) + EX(((p86==1)&&(p97==1))))) U (EG(A(EX((p16==1)) U AF((p37==1)))) + AX((p75==1)))) * AX((((p63==1)||(p46==0))||(p52==0))...157
=> equivalent forward existential formula: ([(Init * !(E(EG(((p78==1) + EX(((p86==1)&&(p97==1))))) U (EG(!((E(!(!(EG(!((p37==1))))) U (!(EX((p16==1))) * !(...303
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t21, t24, t26, t28, t33, t35, t41, t43, t44, t49, t52, t53, t73, Inte...248
Detected timeout of ITS tools.
[2026-05-25 08:52:28] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:28] [INFO ] Applying decomposition
[2026-05-25 08:52:28] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10477596324416532296.txt' '-o' '/tmp/graph10477596324416532296.bin' '-w' '/tmp/graph10477596324416532296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10477596324416532296.bin' '-l' '-1' '-v' '-w' '/tmp/graph10477596324416532296.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:52:28] [INFO ] Decomposing Gal with order
[2026-05-25 08:52:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:52:28] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-25 08:52:28] [INFO ] Flatten gal took : 67 ms
[2026-05-25 08:52:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 08:52:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4928577251539575019.gal : 3 ms
[2026-05-25 08:52:28] [INFO ] Time to serialize properties into /tmp/CTLFireability5008568863052669933.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/CTLFireability4928577251539575019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5008568863052669933.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18095e+08,0.051886,6312,369,177,3106,2872,211,3578,117,9881,0


Converting to forward existential form...Done !
original formula: (E(EG(((i8.u29.p78==1) + EX(((u31.p86==1)&&(u31.p97==1))))) U (EG(A(EX((i1.i0.u7.p16==1)) U AF((i1.i1.u14.p37==1)))) + AX((i9.u27.p75==1)...222
=> equivalent forward existential formula: ([(Init * !(E(EG(((i8.u29.p78==1) + EX(((u31.p86==1)&&(u31.p97==1))))) U (EG(!((E(!(!(EG(!((i1.i1.u14.p37==1))))...388
Reverse transition relation is NOT exact ! Due to transitions u30.t6, u31.t73, i0.u2.t53, i1.i0.u17.t33, i1.i1.t41, i1.i1.u13.t44, i2.t52, i2.u8.t49, i3.u1...363
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,4.79557,179172,1,0,403239,6394,1300,422388,764,62614,469906
FORMULA MedleyA-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 103 transition count 76
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 83 transition count 76
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 40 place count 83 transition count 67
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 74 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 68 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 68 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 54 transition count 47
Applied a total of 97 rules in 32 ms. Remains 54 /104 variables (removed 50) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9729991756925754358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4939385872239385989.kers'
[2026-05-25 08:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9729991756925754358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4939385872239385989.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 54 cols 157 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:52:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4939385872239385989.kers
Total runtime 0 ms.
[2026-05-25 08:52:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 08:52:33] [INFO ] Invariant cache hit.
[2026-05-25 08:52:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-25 08:52:33] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:52:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/101 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/101 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2911ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2912ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/104 places, 47/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3155 ms. Remains : 54/104 places, 47/97 transitions.
[2026-05-25 08:52:36] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:52:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:36] [INFO ] Input system was already deterministic with 47 transitions.
RANDOM walk for 1243 steps (49 resets) in 6 ms. (177 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 08:52:36] [INFO ] Flatten gal took : 4 ms
[2026-05-25 08:52:36] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:52:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14651410076748059995.gal : 0 ms
[2026-05-25 08:52:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6155697777048151175.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14651410076748059995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6155697777048151175.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 88
Applied a total of 18 rules in 3 ms. Remains 95 /104 variables (removed 9) and now considering 88/97 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6820943064201362904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14940531193408595609.kers'
[2026-05-25 08:52:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6820943064201362904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14940531193408595609.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 95 cols 247 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-25 08:52:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14940531193408595609.kers
Total runtime 1 ms.
[2026-05-25 08:52:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-25 08:52:37] [INFO ] Invariant cache hit.
[2026-05-25 08:52:37] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 08:52:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 107 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4266 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 87/194 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 212 constraints, problems are : Problem set: 0 solved, 87 unsolved in 23385 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27672ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 27673ms
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 88/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28002 ms. Remains : 95/104 places, 88/97 transitions.
[2026-05-25 08:53:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:53:04] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-25 08:53:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 08:53:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5040711089928304311.gal : 1 ms
[2026-05-25 08:53:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7737447216502609779.ctl : 6 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/CTLFireability5040711089928304311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7737447216502609779.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.18276e+08,0.261174,16580,2,2584,5,37917,6,0,470,80673,0


Converting to forward existential form...Done !
original formula: E(((EX(!(((p37==1)||(p2!=1)))) * (EF((AG((p16==1)) * EG((p2==1)))) + ((EX((p43==1)) * AG(AX(((p86==1)&&(p103==1))))) * (AX(((p8==1)&&(p40...394
=> equivalent forward existential formula: [(((FwdU(Init,((EX(!(((p37==1)||(p2!=1)))) * (E(TRUE U (!(E(TRUE U !((p16==1)))) * EG((p2==1)))) + ((EX((p43==1)...725
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t35, t38, t41, t43, t44, t47, t49, t53, t73, t84, ...253
Detected timeout of ITS tools.
[2026-05-25 08:53:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:35] [INFO ] Applying decomposition
[2026-05-25 08:53:35] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1453237732282392650.txt' '-o' '/tmp/graph1453237732282392650.bin' '-w' '/tmp/graph1453237732282392650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1453237732282392650.bin' '-l' '-1' '-v' '-w' '/tmp/graph1453237732282392650.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:53:35] [INFO ] Decomposing Gal with order
[2026-05-25 08:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:53:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:53:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 08:53:35] [INFO ] Time to serialize gal into /tmp/CTLFireability180321639479230346.gal : 2 ms
[2026-05-25 08:53:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8223462135759847454.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/CTLFireability180321639479230346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8223462135759847454.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18276e+08,0.059823,6608,437,180,3786,2919,221,4729,125,9947,0


Converting to forward existential form...Done !
original formula: E(((EX(!(((i4.u12.p37==1)||(i0.u0.p2!=1)))) * (EF((AG((i4.u6.p16==1)) * EG((i0.u0.p2==1)))) + ((EX((i5.u16.p43==1)) * AG(AX(((u28.p86==1)...524
=> equivalent forward existential formula: [(((FwdU(Init,((EX(!(((i4.u12.p37==1)||(i0.u0.p2!=1)))) * (E(TRUE U (!(E(TRUE U !((i4.u6.p16==1)))) * EG((i0.u0....887
Reverse transition relation is NOT exact ! Due to transitions u26.t6, u28.t73, i0.u1.t53, i1.u22.t18, i1.u23.t11, i1.u27.t4, i2.u7.t47, i2.u7.t84, i2.u8.t4...373
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,13.0941,295480,1,0,585540,7483,1466,807067,835,73547,610228
FORMULA MedleyA-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 103 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 86 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 85 transition count 78
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 36 place count 85 transition count 71
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 50 place count 78 transition count 71
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 73 transition count 66
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 73 transition count 66
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 88 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 58 transition count 51
Applied a total of 89 rules in 13 ms. Remains 58 /104 variables (removed 46) and now considering 51/97 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15728049074622620553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8873149153838275917.kers'
[2026-05-25 08:53:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15728049074622620553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8873149153838275917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 58 cols 165 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 08:53:48] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8873149153838275917.kers
Total runtime 0 ms.
[2026-05-25 08:53:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 08:53:48] [INFO ] Invariant cache hit.
[2026-05-25 08:53:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2026-05-25 08:53:48] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-25 08:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 66 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/109 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 116 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3790 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5138ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5138ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/104 places, 51/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5303 ms. Remains : 58/104 places, 51/97 transitions.
[2026-05-25 08:53:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:53:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:53:53] [INFO ] Input system was already deterministic with 51 transitions.
[2026-05-25 08:53:53] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:53:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:53:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15067930637124759316.gal : 0 ms
[2026-05-25 08:53:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16653004461163796257.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/CTLFireability15067930637124759316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16653004461163796257.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(!(E(!(((p46==1)&&(p52==1))) U (EG(((p57==1)||(p85==1))) * AG(!(((p86==1)&&(p95==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(((p46==1)&&(p52==1))) U (EG(((p57==1)||(p85==1))) * !(E(TRUE U !(!(((p86==1)&&(p95==1))))))))))...165
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t6, t7, t10, t12, t14, t34, t38, t45, Intersection with reachable at each step enabl...206
(forward)formula 0,1,0.837269,38992,1,0,654,223870,135,93,1849,192231,662
FORMULA MedleyA-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 91
Applied a total of 12 rules in 3 ms. Remains 98 /104 variables (removed 6) and now considering 91/97 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12201205251982021723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-350687121384308124.kers'
[2026-05-25 08:53:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12201205251982021723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-350687121384308124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 98 cols 253 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-25 08:53:54] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-350687121384308124.kers
Total runtime 0 ms.
[2026-05-25 08:53:54] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 08:53:54] [INFO ] Invariant cache hit.
[2026-05-25 08:53:54] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 08:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/189 variables, 98/127 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 128 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/218 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 226 constraints, problems are : Problem set: 0 solved, 90 unsolved in 29111 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35276ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 35277ms
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35531 ms. Remains : 98/104 places, 91/97 transitions.
[2026-05-25 08:54:29] [INFO ] Flatten gal took : 20 ms
[2026-05-25 08:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:29] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-25 08:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:29] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5291329430785830251.gal : 1 ms
[2026-05-25 08:54:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1424193418461112459.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/CTLFireability5291329430785830251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1424193418461112459.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.26639e+08,0.078356,6076,2,2483,5,9722,6,0,485,8459,0


Converting to forward existential form...Done !
original formula: ((EF((E(!(AG((p15==1))) U EX((p12==1))) + A(EX((p18==1)) U !((((p86==1)&&(p96==1))&&(p35==1)))))) * A(((EX(((p18==1)||(p4==1))) + AF(((p8...448
=> equivalent forward existential formula: (([(Init * !(E(TRUE U (E(!(!(E(TRUE U !((p15==1))))) U EX((p12==1))) + !((E(!(!((((p86==1)&&(p96==1))&&(p35==1))...1814
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t9, t11, t13, t15, t20, t22, t27, t29, t35, t38, t39, t41, t44, t46, t47, t50, t52, t...267
(forward)formula 0,0,16.3491,544504,1,0,1174,3.30751e+06,224,227,2903,4.2649e+06,1221
FORMULA MedleyA-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 103 transition count 76
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 83 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 82 transition count 75
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 42 place count 82 transition count 68
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 56 place count 75 transition count 68
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 70 transition count 63
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 70 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 70 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 69 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 90 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 57 transition count 50
Applied a total of 91 rules in 25 ms. Remains 57 /104 variables (removed 47) and now considering 50/97 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13177440957439721494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10022930849665077618.kers'
[2026-05-25 08:54:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13177440957439721494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10022930849665077618.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 57 cols 167 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 08:54:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10022930849665077618.kers
Total runtime 1 ms.
[2026-05-25 08:54:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 08:54:46] [INFO ] Invariant cache hit.
[2026-05-25 08:54:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2026-05-25 08:54:46] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-25 08:54:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/106 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1826 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 50/106 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/107 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 118 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3721 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5552ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5552ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/104 places, 50/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5744 ms. Remains : 57/104 places, 50/97 transitions.
[2026-05-25 08:54:52] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:54:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:52] [INFO ] Input system was already deterministic with 50 transitions.
[2026-05-25 08:54:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:54:52] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:54:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9303943383403427392.gal : 1 ms
[2026-05-25 08:54:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12269182700041947268.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/CTLFireability9303943383403427392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12269182700041947268.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.28228e+06,0.025339,4484,2,671,5,2918,6,0,279,2048,0


Converting to forward existential form...Done !
original formula: EG(((p15==0)&&(p28==0)))
=> equivalent forward existential formula: [FwdG(Init,((p15==0)&&(p28==0)))] != FALSE
Hit Full ! (commute/partial/dont) 46/4/4
(forward)formula 0,0,0.238573,15788,1,0,412,75743,18,4,1406,53905,410
FORMULA MedleyA-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 103 transition count 76
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 83 transition count 76
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 40 place count 83 transition count 69
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 54 place count 76 transition count 69
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 70 transition count 63
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 70 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 70 transition count 62
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 68 place count 69 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 94 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 55 transition count 48
Applied a total of 95 rules in 19 ms. Remains 55 /104 variables (removed 49) and now considering 48/97 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12657672148737077902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12444475778772678849.kers'
[2026-05-25 08:54:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12657672148737077902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12444475778772678849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 55 cols 159 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 08:54:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12444475778772678849.kers
Total runtime 1 ms.
[2026-05-25 08:54:52] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 08:54:52] [INFO ] Invariant cache hit.
[2026-05-25 08:54:52] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-25 08:54:52] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/102 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3679ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3679ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/104 places, 48/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3891 ms. Remains : 55/104 places, 48/97 transitions.
[2026-05-25 08:54:56] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:54:56] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:54:56] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-25 08:54:56] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:54:56] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:54:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7990765164948772568.gal : 0 ms
[2026-05-25 08:54:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10254807668934799156.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7990765164948772568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10254807668934799156.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 42 steps (1 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 103 transition count 76
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 83 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 42 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 58 place count 74 transition count 67
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 68 transition count 61
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 68 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 68 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 67 transition count 60
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 3 with 24 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 54 transition count 47
Applied a total of 97 rules in 31 ms. Remains 54 /104 variables (removed 50) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4214678779335387934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1976152847850802300.kers'
[2026-05-25 08:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4214678779335387934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1976152847850802300.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 54 cols 157 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:54:56] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1976152847850802300.kers
Total runtime 1 ms.
[2026-05-25 08:54:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 08:54:56] [INFO ] Invariant cache hit.
[2026-05-25 08:54:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-25 08:54:56] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/100 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 63 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/100 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6023ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 6023ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/104 places, 47/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6190 ms. Remains : 54/104 places, 47/97 transitions.
[2026-05-25 08:55:02] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:55:02] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:55:02] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 08:55:02] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:55:02] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9072347248584480092.gal : 0 ms
[2026-05-25 08:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10281337091906355502.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/CTLFireability9072347248584480092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10281337091906355502.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.41843e+06,0.046138,4636,2,898,5,3759,6,0,265,3159,0


Converting to forward existential form...Done !
original formula: AG((AF((p79==0)) + (p45==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p45==1))),!((p79==0)))] = FALSE
dead was empty
(forward)formula 0,1,0.320539,18172,1,0,428,88444,15,4,1260,68359,424
FORMULA MedleyA-PT-03-CTLFireability-2024-09 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 : 104/104 places, 97/97 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 88
Applied a total of 18 rules in 2 ms. Remains 95 /104 variables (removed 9) and now considering 88/97 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14399483923078404643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6086296274184749068.kers'
[2026-05-25 08:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14399483923078404643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6086296274184749068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 88 rows 95 cols 247 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-25 08:55:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6086296274184749068.kers
Total runtime 0 ms.
[2026-05-25 08:55:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 08:55:03] [INFO ] Invariant cache hit.
[2026-05-25 08:55:03] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 08:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/183 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 119 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 88/183 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 87/216 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 223 constraints, problems are : Problem set: 0 solved, 87 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35227ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 35227ms
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 88/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35452 ms. Remains : 95/104 places, 88/97 transitions.
[2026-05-25 08:55:38] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:55:38] [INFO ] Flatten gal took : 5 ms
[2026-05-25 08:55:38] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-25 08:55:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:38] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:55:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16089931084569622706.gal : 2 ms
[2026-05-25 08:55:38] [INFO ] Time to serialize properties into /tmp/CTLFireability543892579734361503.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/CTLFireability16089931084569622706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability543892579734361503.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.26317e+08,0.085486,6960,2,2787,5,13755,6,0,470,12526,0


Converting to forward existential form...Done !
original formula: EF((E(A(EF((p83==1)) U (((p63==1)||(p65==1))&&(((p86==1)&&(p91==1))||(p87==1)))) U EF(((p35!=1) * EF((p45==1))))) * EX(AX((p2==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * E(!((E(!((((p63==1)||(p65==1))&&(((p86==1)&&(p91==1))||(p87==1)))) U (!(E(TRUE U (p83==1...368
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t9, t11, t13, t15, t20, t23, t26, t28, t30, t35, t37, t42, t44, t50, t53, t54, t74, ...252
Detected timeout of ITS tools.
[2026-05-25 08:56:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 08:56:08] [INFO ] Applying decomposition
[2026-05-25 08:56:08] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17581853615639008364.txt' '-o' '/tmp/graph17581853615639008364.bin' '-w' '/tmp/graph17581853615639008364.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17581853615639008364.bin' '-l' '-1' '-v' '-w' '/tmp/graph17581853615639008364.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:56:08] [INFO ] Decomposing Gal with order
[2026-05-25 08:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:56:08] [INFO ] Removed a total of 1 redundant transitions.
[2026-05-25 08:56:08] [INFO ] Flatten gal took : 8 ms
[2026-05-25 08:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 08:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4597873582749722432.gal : 2 ms
[2026-05-25 08:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability18230000890765823054.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/CTLFireability4597873582749722432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18230000890765823054.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26317e+08,0.110857,9144,439,207,6630,6057,220,8079,127,30846,0


Converting to forward existential form...Done !
original formula: EF((E(A(EF((i8.u26.p83==1)) U (((i6.u21.p63==1)||(i6.u22.p65==1))&&(((u27.p86==1)&&(u27.p91==1))||(i1.u28.p87==1)))) U EF(((i4.i0.u11.p35...213
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * E(!((E(!((((i6.u21.p63==1)||(i6.u22.p65==1))&&(((u27.p86==1)&&(u27.p91==1))||(i1.u28.p87...488
Reverse transition relation is NOT exact ! Due to transitions t5, u27.t9, u27.t74, i0.u2.t54, i1.u19.t20, i1.u23.t13, i2.t53, i2.u8.t50, i3.u12.t42, i3.u14...364
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.62788,194116,1,0,408478,13188,1376,504763,852,108888,556388
FORMULA MedleyA-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 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 21 place count 103 transition count 75
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 42 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 74 transition count 67
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 69 transition count 62
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 69 transition count 62
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 54 transition count 47
Applied a total of 97 rules in 20 ms. Remains 54 /104 variables (removed 50) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-491833044882582093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1682031150208126557.kers'
[2026-05-25 08:56:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-491833044882582093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1682031150208126557.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 54 cols 157 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:56:13] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1682031150208126557.kers
Total runtime 1 ms.
[2026-05-25 08:56:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 08:56:13] [INFO ] Invariant cache hit.
[2026-05-25 08:56:13] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2026-05-25 08:56:13] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:56:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3806ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/104 places, 47/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4050 ms. Remains : 54/104 places, 47/97 transitions.
[2026-05-25 08:56:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:17] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 08:56:17] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:56:17] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5917472138770991410.gal : 1 ms
[2026-05-25 08:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8660231625915893457.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/CTLFireability5917472138770991410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8660231625915893457.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.60589e+06,0.03026,4448,2,595,5,2706,6,0,265,1881,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((p81==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((p81==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t9, t11, t13, t33, t42, Intersection with reachable at each step enabled...204
dead was empty
(forward)formula 0,0,0.297529,17612,1,0,534,86652,118,53,1663,67282,527
FORMULA MedleyA-PT-03-CTLFireability-2024-12 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 : 104/104 places, 97/97 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 93 transition count 86
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 93 transition count 86
Applied a total of 22 rules in 1 ms. Remains 93 /104 variables (removed 11) and now considering 86/97 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9646767377508305678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4606501922008853303.kers'
[2026-05-25 08:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9646767377508305678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4606501922008853303.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 93 cols 243 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-25 08:56:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4606501922008853303.kers
Total runtime 0 ms.
[2026-05-25 08:56:17] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 08:56:17] [INFO ] Invariant cache hit.
[2026-05-25 08:56:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-25 08:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/103 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 104 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3769 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/189 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 10/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 85 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 Int declared 179/179 variables, and 208 constraints, problems are : Problem set: 0 solved, 85 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33818ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 33818ms
Starting structural reductions in LTL mode, iteration 1 : 93/104 places, 86/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33987 ms. Remains : 93/104 places, 86/97 transitions.
[2026-05-25 08:56:51] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:51] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-25 08:56:51] [INFO ] Flatten gal took : 15 ms
[2026-05-25 08:56:51] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1949607810900051397.gal : 0 ms
[2026-05-25 08:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3277499613238000205.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/CTLFireability1949607810900051397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3277499613238000205.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.10961e+08,0.289349,14600,2,1706,5,33892,6,0,460,66154,0


Converting to forward existential form...Done !
original formula: AX(((!(A(!(EX((p84==1))) U ((p25==1) * AF((p65==1))))) * !(A(((AX(((p86==1)&&(p102==1))) + (p18==1)) + (p1==1)) U (((p68==1)||((p86==1)&&...211
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(((p25==1) * !(EG(!((p65==1))))))))) * !(E(!(((p25==1) * !(EG(!((p65==1)))))) U (!(!(EX((p...551
Hit Full ! (commute/partial/dont) 83/0/3
(forward)formula 0,0,1.50644,47184,1,0,755,193673,20,4,2310,243685,755
FORMULA MedleyA-PT-03-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 103 transition count 77
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 76
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 40 place count 83 transition count 68
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 56 place count 75 transition count 68
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 62 place count 69 transition count 62
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 69 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 68 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 54 transition count 47
Applied a total of 97 rules in 8 ms. Remains 54 /104 variables (removed 50) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4471293990976598833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12984967667690354860.kers'
[2026-05-25 08:56:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4471293990976598833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12984967667690354860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 47 rows 54 cols 157 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:56:53] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12984967667690354860.kers
Total runtime 0 ms.
[2026-05-25 08:56:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 08:56:53] [INFO ] Invariant cache hit.
[2026-05-25 08:56:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2026-05-25 08:56:53] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3782ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3783ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/104 places, 47/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3973 ms. Remains : 54/104 places, 47/97 transitions.
[2026-05-25 08:56:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:57] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-25 08:56:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:57] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:56:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10859833476234176519.gal : 1 ms
[2026-05-25 08:56:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18266336122245315757.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/CTLFireability10859833476234176519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18266336122245315757.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.58438e+06,0.020187,4668,2,635,5,3825,6,0,265,3256,0


Converting to forward existential form...Done !
original formula: AF(EG((p84==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p84==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t8, t10, t12, t16, t38, t42, Intersection with reachable at each step enabled. (...200
dead was empty
(forward)formula 0,1,1.84646,59104,1,0,655,355833,115,126,1630,439191,649
FORMULA MedleyA-PT-03-CTLFireability-2024-14 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 : 104/104 places, 97/97 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 21 place count 103 transition count 75
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 82 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 42 place count 82 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 74 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 68 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 68 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 70 place count 68 transition count 60
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 72 place count 67 transition count 60
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 94 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 55 transition count 48
Applied a total of 95 rules in 28 ms. Remains 55 /104 variables (removed 49) and now considering 48/97 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1220684637340201373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1632138993010553790.kers'
[2026-05-25 08:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1220684637340201373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1632138993010553790.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 48 rows 55 cols 159 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 08:56:59] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1632138993010553790.kers
Total runtime 2 ms.
[2026-05-25 08:56:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-25 08:56:59] [INFO ] Invariant cache hit.
[2026-05-25 08:56:59] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2026-05-25 08:56:59] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-25 08:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 65 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 48/102 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 112 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3860ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3860ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/104 places, 48/97 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4074 ms. Remains : 55/104 places, 48/97 transitions.
[2026-05-25 08:57:03] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:03] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:03] [INFO ] Input system was already deterministic with 48 transitions.
[2026-05-25 08:57:03] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:03] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:57:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4689123271959310562.gal : 0 ms
[2026-05-25 08:57:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10284956087887842191.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/CTLFireability4689123271959310562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10284956087887842191.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.81648e+06,0.029694,4784,2,1074,5,4284,6,0,270,3925,0


Converting to forward existential form...Done !
original formula: EF(((p79==0) * EF((p19==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p79==0)),TRUE) * (p19==1))] != FALSE
(forward)formula 0,1,0.03837,5048,1,0,8,4526,10,2,502,4314,4
FORMULA MedleyA-PT-03-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-25 08:57:03] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:57:03] [INFO ] Flatten gal took : 2 ms
Total runtime 413310 ms.

BK_STOP 1779699423288

--------------------
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-03"
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-03, 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-177969019900114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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