About the Execution of LTSMin+red for MedleyA-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
462.304 | 77939.00 | 125282.00 | 456.10 | F?T?????F???T??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921400154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400154
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 130K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717363088077
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:18:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:18:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:18:11] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-06-02 21:18:11] [INFO ] Transformed 273 places.
[2024-06-02 21:18:11] [INFO ] Transformed 518 transitions.
[2024-06-02 21:18:11] [INFO ] Found NUPN structural information;
[2024-06-02 21:18:11] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 43 ms.
Support contains 90 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 193 transition count 438
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 193 transition count 438
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 163 place count 193 transition count 435
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 181 place count 175 transition count 385
Iterating global reduction 1 with 18 rules applied. Total rules applied 199 place count 175 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 175 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 201 place count 174 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 174 transition count 382
Applied a total of 202 rules in 156 ms. Remains 174 /273 variables (removed 99) and now considering 382/518 (removed 136) transitions.
// Phase 1: matrix 382 rows 174 cols
[2024-06-02 21:18:11] [INFO ] Computed 11 invariants in 44 ms
[2024-06-02 21:18:12] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-06-02 21:18:12] [INFO ] Invariant cache hit.
[2024-06-02 21:18:12] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-06-02 21:18:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:18] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 31 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 4 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:18:19] [INFO ] Deduced a trap composed of 89 places in 207 ms of which 4 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 88 places in 208 ms of which 4 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 3 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 2 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:18:20] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:18:21] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:18:22] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:18:26] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 116 places in 203 ms of which 4 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 121 places in 203 ms of which 4 ms to minimize.
[2024-06-02 21:18:27] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 3 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Deduced a trap composed of 111 places in 185 ms of which 3 ms to minimize.
[2024-06-02 21:18:28] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:31] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 3 ms to minimize.
[2024-06-02 21:18:32] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:35] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:40] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:18:40] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 3 ms to minimize.
[2024-06-02 21:18:40] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/556 variables, and 43 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 382/556 variables, 174/217 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 381/598 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:18:53] [INFO ] Deduced a trap composed of 114 places in 188 ms of which 4 ms to minimize.
[2024-06-02 21:18:54] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 4 ms to minimize.
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 12 ms to minimize.
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 3 ms to minimize.
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:18:57] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 6/604 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-06-02 21:19:11] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 605 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 39/39 constraints]
After SMT, in 60778ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Starting structural reductions in LTL mode, iteration 1 : 174/273 places, 382/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62131 ms. Remains : 174/273 places, 382/518 transitions.
Support contains 90 out of 174 places after structural reductions.
[2024-06-02 21:19:14] [INFO ] Flatten gal took : 93 ms
[2024-06-02 21:19:14] [INFO ] Flatten gal took : 48 ms
[2024-06-02 21:19:14] [INFO ] Input system was already deterministic with 382 transitions.
RANDOM walk for 40000 steps (25 resets) in 2419 ms. (16 steps per ms) remains 34/68 properties
BEST_FIRST walk for 4002 steps (21 resets) in 45 ms. (87 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 47 ms. (83 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4002 steps (17 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4002 steps (16 resets) in 27 ms. (142 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (18 resets) in 27 ms. (142 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4002 steps (13 resets) in 32 ms. (121 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4002 steps (17 resets) in 15 ms. (250 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4002 steps (17 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 16/19 properties
BEST_FIRST walk for 4000 steps (18 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (23 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 39 ms. (100 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 41 ms. (95 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 37 ms. (105 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (18 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
[2024-06-02 21:19:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/134 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 40/174 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 382/556 variables, 174/185 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 185 constraints, problems are : Problem set: 2 solved, 11 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/134 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 40/174 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 382/556 variables, 174/185 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 10/195 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 195 constraints, problems are : Problem set: 3 solved, 10 unsolved in 1083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1910ms problems are : Problem set: 3 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 5516 ms.
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 136 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 154 transition count 343
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 150 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 150 transition count 337
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 146 transition count 337
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 46 place count 119 transition count 288
Iterating global reduction 2 with 27 rules applied. Total rules applied 73 place count 119 transition count 288
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 119 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 117 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 117 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 114 transition count 273
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 95 place count 112 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 112 transition count 267
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 127 place count 97 transition count 252
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 133 place count 91 transition count 234
Iterating global reduction 4 with 6 rules applied. Total rules applied 139 place count 91 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 91 transition count 231
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 90 transition count 229
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 90 transition count 229
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 89 transition count 226
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 89 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 89 transition count 225
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 161 place count 82 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 82 transition count 232
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 169 place count 80 transition count 226
Iterating global reduction 6 with 2 rules applied. Total rules applied 171 place count 80 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 173 place count 80 transition count 224
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 194 place count 80 transition count 203
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 215 place count 59 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 221 place count 59 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 222 place count 58 transition count 196
Applied a total of 222 rules in 184 ms. Remains 58 /174 variables (removed 116) and now considering 196/382 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 58/174 places, 196/382 transitions.
RANDOM walk for 40000 steps (11 resets) in 891 ms. (44 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 85 ms. (465 steps per ms) remains 1/2 properties
BEST_FIRST walk for 30294 steps (7 resets) in 70 ms. (426 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-02 21:19:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 50 ms
[2024-06-02 21:19:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-20-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 34 ms
[2024-06-02 21:19:23] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 73 out of 174 places (down from 84) after GAL structural reductions.
Computed a total of 14 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 140 transition count 319
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 140 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 140 transition count 315
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 87 place count 125 transition count 279
Iterating global reduction 1 with 15 rules applied. Total rules applied 102 place count 125 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 125 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 123 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 123 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 123 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 122 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 122 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 266
Applied a total of 113 rules in 24 ms. Remains 122 /174 variables (removed 52) and now considering 266/382 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 122/174 places, 266/382 transitions.
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 25 ms
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:19:23] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 139 transition count 318
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 139 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 139 transition count 314
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 123 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 123 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 123 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 119 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 119 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 118 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 118 transition count 254
Applied a total of 124 rules in 25 ms. Remains 118 /174 variables (removed 56) and now considering 254/382 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 118/174 places, 254/382 transitions.
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 27 ms
[2024-06-02 21:19:23] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 141 transition count 322
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 141 transition count 322
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 141 transition count 319
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 83 place count 127 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 97 place count 127 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 127 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 123 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 123 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 123 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 122 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 122 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 264
Applied a total of 113 rules in 24 ms. Remains 122 /174 variables (removed 52) and now considering 264/382 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 122/174 places, 264/382 transitions.
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:19:23] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 144 transition count 327
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 144 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 144 transition count 323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 131 transition count 291
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 131 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 131 transition count 288
Applied a total of 93 rules in 9 ms. Remains 131 /174 variables (removed 43) and now considering 288/382 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 131/174 places, 288/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 141 transition count 322
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 141 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 141 transition count 318
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 85 place count 126 transition count 282
Iterating global reduction 1 with 15 rules applied. Total rules applied 100 place count 126 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 126 transition count 279
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 123 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 123 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 123 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 122 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 122 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 122 transition count 266
Applied a total of 114 rules in 16 ms. Remains 122 /174 variables (removed 52) and now considering 266/382 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 122/174 places, 266/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 140 transition count 317
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 140 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 140 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 124 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 124 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 108 place count 124 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 120 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 120 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 119 place count 120 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 119 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 119 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 119 transition count 254
Applied a total of 122 rules in 16 ms. Remains 119 /174 variables (removed 55) and now considering 254/382 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 119/174 places, 254/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 143 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 153 transition count 346
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 150 transition count 344
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 150 transition count 339
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 145 transition count 339
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 50 place count 114 transition count 278
Iterating global reduction 2 with 31 rules applied. Total rules applied 81 place count 114 transition count 278
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 91 place count 114 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 95 place count 112 transition count 266
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 95 place count 112 transition count 261
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 107 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 105 transition count 255
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 105 transition count 255
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 4 with 26 rules applied. Total rules applied 135 place count 92 transition count 242
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 142 place count 85 transition count 221
Iterating global reduction 4 with 7 rules applied. Total rules applied 149 place count 85 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 85 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 84 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 84 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 83 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 83 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 83 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 83 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 80 transition count 205
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 170 place count 77 transition count 196
Iterating global reduction 6 with 3 rules applied. Total rules applied 173 place count 77 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 176 place count 77 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 178 place count 75 transition count 191
Applied a total of 178 rules in 105 ms. Remains 75 /174 variables (removed 99) and now considering 191/382 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106 ms. Remains : 75/174 places, 191/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 30108 steps (11 resets) in 445 ms. (67 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 321
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 142 transition count 317
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 82 place count 128 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 96 place count 128 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 128 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 125 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 125 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 125 transition count 269
Applied a total of 108 rules in 18 ms. Remains 125 /174 variables (removed 49) and now considering 269/382 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 125/174 places, 269/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 136 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 153 transition count 345
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 149 transition count 339
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 145 transition count 339
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 49 place count 115 transition count 281
Iterating global reduction 2 with 30 rules applied. Total rules applied 79 place count 115 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 87 place count 115 transition count 273
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 114 transition count 272
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 89 place count 114 transition count 268
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 110 transition count 268
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 100 place count 107 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 103 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 106 transition count 257
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 106 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 106 transition count 256
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 132 place count 93 transition count 243
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 138 place count 87 transition count 225
Iterating global reduction 5 with 6 rules applied. Total rules applied 144 place count 87 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 147 place count 87 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 86 transition count 220
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 86 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 85 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 85 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 85 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 156 place count 85 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 162 place count 82 transition count 209
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 165 place count 79 transition count 200
Iterating global reduction 7 with 3 rules applied. Total rules applied 168 place count 79 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 171 place count 79 transition count 197
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 172 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 174 place count 77 transition count 195
Applied a total of 174 rules in 123 ms. Remains 77 /174 variables (removed 97) and now considering 195/382 (removed 187) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 77/174 places, 195/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 29 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 138 transition count 315
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 138 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 138 transition count 311
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 93 place count 121 transition count 270
Iterating global reduction 1 with 17 rules applied. Total rules applied 110 place count 121 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 121 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 117 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 117 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 116 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 116 transition count 249
Applied a total of 128 rules in 21 ms. Remains 116 /174 variables (removed 58) and now considering 249/382 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 116/174 places, 249/382 transitions.
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:19:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:19:24] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 144 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 153 transition count 345
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 11 place count 149 transition count 338
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 144 transition count 338
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 52 place count 113 transition count 277
Iterating global reduction 2 with 31 rules applied. Total rules applied 83 place count 113 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 93 place count 113 transition count 267
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 111 transition count 265
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 97 place count 111 transition count 260
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 106 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 103 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 103 transition count 252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 102 transition count 249
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 102 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 102 transition count 248
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 5 with 26 rules applied. Total rules applied 142 place count 89 transition count 235
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 83 transition count 217
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 83 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 82 transition count 212
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 82 transition count 212
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 81 transition count 209
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 81 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 81 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 81 transition count 205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 171 place count 78 transition count 202
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 174 place count 75 transition count 193
Iterating global reduction 7 with 3 rules applied. Total rules applied 177 place count 75 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 180 place count 75 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 73 transition count 188
Applied a total of 182 rules in 68 ms. Remains 73 /174 variables (removed 101) and now considering 188/382 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 73/174 places, 188/382 transitions.
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:19:25] [INFO ] Input system was already deterministic with 188 transitions.
RANDOM walk for 40000 steps (31 resets) in 385 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 17159 steps (20 resets) in 68 ms. (248 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 145 transition count 329
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 145 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 145 transition count 325
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 76 place count 131 transition count 291
Iterating global reduction 1 with 14 rules applied. Total rules applied 90 place count 131 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 131 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 127 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 127 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 127 transition count 276
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 126 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 126 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 126 transition count 272
Applied a total of 106 rules in 17 ms. Remains 126 /174 variables (removed 48) and now considering 272/382 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 126/174 places, 272/382 transitions.
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:19:25] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 142 transition count 321
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 142 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 142 transition count 317
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 83 place count 127 transition count 281
Iterating global reduction 1 with 15 rules applied. Total rules applied 98 place count 127 transition count 281
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 127 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 123 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 123 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 113 place count 123 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 122 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 122 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 122 transition count 260
Applied a total of 116 rules in 16 ms. Remains 122 /174 variables (removed 52) and now considering 260/382 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 122/174 places, 260/382 transitions.
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:19:25] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 382/382 transitions.
Graph (trivial) has 137 edges and 174 vertex of which 23 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 153 transition count 346
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 150 transition count 344
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 149 transition count 343
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 11 place count 149 transition count 338
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 144 transition count 338
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 50 place count 115 transition count 281
Iterating global reduction 3 with 29 rules applied. Total rules applied 79 place count 115 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 88 place count 115 transition count 272
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 92 place count 113 transition count 270
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 92 place count 113 transition count 267
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 98 place count 110 transition count 267
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 101 place count 107 transition count 259
Iterating global reduction 5 with 3 rules applied. Total rules applied 104 place count 107 transition count 259
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 106 transition count 256
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 106 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 106 transition count 255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 133 place count 93 transition count 242
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 139 place count 87 transition count 224
Iterating global reduction 6 with 6 rules applied. Total rules applied 145 place count 87 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 148 place count 87 transition count 221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 149 place count 86 transition count 219
Iterating global reduction 7 with 1 rules applied. Total rules applied 150 place count 86 transition count 219
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 151 place count 85 transition count 216
Iterating global reduction 7 with 1 rules applied. Total rules applied 152 place count 85 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 153 place count 85 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 156 place count 85 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 162 place count 82 transition count 209
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 165 place count 79 transition count 200
Iterating global reduction 8 with 3 rules applied. Total rules applied 168 place count 79 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 171 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 173 place count 77 transition count 195
Applied a total of 173 rules in 79 ms. Remains 77 /174 variables (removed 97) and now considering 195/382 (removed 187) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 77/174 places, 195/382 transitions.
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:19:25] [INFO ] Input system was already deterministic with 195 transitions.
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:19:25] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:19:25] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 21:19:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 382 transitions and 1361 arcs took 5 ms.
Total runtime 74903 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-20-CTLFireability-2024-15
BK_STOP 1717363166016
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-20-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/647/ctl_0_
ctl formula name MedleyA-PT-20-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/647/ctl_1_
ctl formula name MedleyA-PT-20-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/647/ctl_2_
ctl formula name MedleyA-PT-20-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/647/ctl_3_
ctl formula name MedleyA-PT-20-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/647/ctl_4_
ctl formula name MedleyA-PT-20-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/647/ctl_5_
ctl formula name MedleyA-PT-20-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/647/ctl_6_
ctl formula name MedleyA-PT-20-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/647/ctl_7_
ctl formula name MedleyA-PT-20-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/647/ctl_8_
ctl formula name MedleyA-PT-20-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/647/ctl_9_
ctl formula name MedleyA-PT-20-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/647/ctl_10_
ctl formula name MedleyA-PT-20-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/647/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-20, 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 r579-smll-171734921400154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-20.tgz
mv MedleyA-PT-20 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;