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-171734921300130.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-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 24K 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 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717359139760

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:12:22] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-06-02 20:12:22] [INFO ] Transformed 248 places.
[2024-06-02 20:12:22] [INFO ] Transformed 591 transitions.
[2024-06-02 20:12:22] [INFO ] Found NUPN structural information;
[2024-06-02 20:12:22] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 110 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 217 transition count 539
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 217 transition count 539
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 217 transition count 523
Applied a total of 78 rules in 93 ms. Remains 217 /248 variables (removed 31) and now considering 523/589 (removed 66) transitions.
// Phase 1: matrix 523 rows 217 cols
[2024-06-02 20:12:23] [INFO ] Computed 7 invariants in 60 ms
[2024-06-02 20:12:23] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-06-02 20:12:23] [INFO ] Invariant cache hit.
[2024-06-02 20:12:24] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-02 20:12:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 20:12:34] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 43 ms to minimize.
[2024-06-02 20:12:34] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 5 ms to minimize.
[2024-06-02 20:12:35] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 4 ms to minimize.
[2024-06-02 20:12:35] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:12:35] [INFO ] Deduced a trap composed of 123 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:12:35] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 3 ms to minimize.
[2024-06-02 20:12:35] [INFO ] Deduced a trap composed of 122 places in 196 ms of which 3 ms to minimize.
[2024-06-02 20:12:36] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-06-02 20:12:36] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:12:37] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-06-02 20:12:37] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 4 ms to minimize.
[2024-06-02 20:12:38] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 5 ms to minimize.
[2024-06-02 20:12:38] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 4 ms to minimize.
[2024-06-02 20:12:38] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 2 ms to minimize.
[2024-06-02 20:12:38] [INFO ] Deduced a trap composed of 101 places in 239 ms of which 4 ms to minimize.
[2024-06-02 20:12:39] [INFO ] Deduced a trap composed of 122 places in 262 ms of which 3 ms to minimize.
[2024-06-02 20:12:39] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:12:39] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 4 ms to minimize.
[2024-06-02 20:12:40] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 4 ms to minimize.
[2024-06-02 20:12:40] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 20:12:41] [INFO ] Deduced a trap composed of 129 places in 301 ms of which 4 ms to minimize.
[2024-06-02 20:12:42] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:12:43] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 3 ms to minimize.
[2024-06-02 20:12:43] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
[2024-06-02 20:12:43] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 3 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 4 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 3 ms to minimize.
[2024-06-02 20:12:44] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 3 ms to minimize.
[2024-06-02 20:12:45] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 3 ms to minimize.
[2024-06-02 20:12:45] [INFO ] Deduced a trap composed of 27 places in 316 ms of which 4 ms to minimize.
[2024-06-02 20:12:46] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-02 20:12:46] [INFO ] Deduced a trap composed of 22 places in 314 ms of which 3 ms to minimize.
[2024-06-02 20:12:46] [INFO ] Deduced a trap composed of 56 places in 340 ms of which 4 ms to minimize.
[2024-06-02 20:12:47] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 4 ms to minimize.
[2024-06-02 20:12:47] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 5 ms to minimize.
[2024-06-02 20:12:47] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:12:48] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 4 ms to minimize.
[2024-06-02 20:12:49] [INFO ] Deduced a trap composed of 41 places in 280 ms of which 3 ms to minimize.
[2024-06-02 20:12:50] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 3 ms to minimize.
[2024-06-02 20:12:50] [INFO ] Deduced a trap composed of 126 places in 272 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 20:12:55] [INFO ] Deduced a trap composed of 24 places in 306 ms of which 4 ms to minimize.
[2024-06-02 20:12:55] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 4 ms to minimize.
SMT process timed out in 31476ms, After SMT, problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 31565ms
Starting structural reductions in LTL mode, iteration 1 : 217/248 places, 523/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32930 ms. Remains : 217/248 places, 523/589 transitions.
Support contains 110 out of 217 places after structural reductions.
[2024-06-02 20:12:56] [INFO ] Flatten gal took : 179 ms
[2024-06-02 20:12:56] [INFO ] Flatten gal took : 106 ms
[2024-06-02 20:12:56] [INFO ] Input system was already deterministic with 523 transitions.
Reduction of identical properties reduced properties to check from 99 to 98
RANDOM walk for 40000 steps (1376 resets) in 3204 ms. (12 steps per ms) remains 94/98 properties
BEST_FIRST walk for 4002 steps (27 resets) in 44 ms. (88 steps per ms) remains 91/94 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (28 resets) in 18 ms. (210 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 53 ms. (74 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (29 resets) in 36 ms. (108 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (29 resets) in 26 ms. (148 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (31 resets) in 49 ms. (80 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (28 resets) in 37 ms. (105 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 43 ms. (90 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 32 ms. (121 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (27 resets) in 21 ms. (182 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (27 resets) in 37 ms. (105 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (29 resets) in 43 ms. (91 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 28 ms. (138 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4001 steps (28 resets) in 23 ms. (166 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (23 resets) in 48 ms. (81 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 38 ms. (102 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (30 resets) in 48 ms. (81 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (29 resets) in 20 ms. (190 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (28 resets) in 20 ms. (190 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (29 resets) in 44 ms. (88 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 44 ms. (88 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (29 resets) in 32 ms. (121 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4002 steps (28 resets) in 30 ms. (129 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 91/91 properties
BEST_FIRST walk for 4004 steps (28 resets) in 29 ms. (133 steps per ms) remains 91/91 properties
Interrupted probabilistic random walk after 304482 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :30 out of 91
Probabilistic random walk after 304482 steps, saw 55809 distinct states, run finished after 3006 ms. (steps per millisecond=101 ) properties seen :30
[2024-06-02 20:13:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/217 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 55 unsolved
[2024-06-02 20:13:02] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:13:02] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:13:02] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:13:02] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:13:02] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
Problem AtomicPropp56 is UNSAT
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-06-02 20:13:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 129 places in 270 ms of which 3 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 18 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:13:04] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 17/24 constraints. Problems are: Problem set: 7 solved, 54 unsolved
[2024-06-02 20:13:05] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:13:05] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 4 ms to minimize.
[2024-06-02 20:13:05] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 3 ms to minimize.
[2024-06-02 20:13:06] [INFO ] Deduced a trap composed of 122 places in 164 ms of which 2 ms to minimize.
[2024-06-02 20:13:06] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-06-02 20:13:06] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:13:06] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/740 variables, and 31 constraints, problems are : Problem set: 7 solved, 54 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 7 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 151/217 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 24/31 constraints. Problems are: Problem set: 7 solved, 54 unsolved
[2024-06-02 20:13:07] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:13:07] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:13:07] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 3 ms to minimize.
[2024-06-02 20:13:08] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 2 ms to minimize.
[2024-06-02 20:13:08] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-06-02 20:13:08] [INFO ] Deduced a trap composed of 143 places in 332 ms of which 4 ms to minimize.
[2024-06-02 20:13:09] [INFO ] Deduced a trap composed of 125 places in 325 ms of which 4 ms to minimize.
[2024-06-02 20:13:09] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-06-02 20:13:09] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 3 ms to minimize.
[2024-06-02 20:13:10] [INFO ] Deduced a trap composed of 43 places in 278 ms of which 4 ms to minimize.
[2024-06-02 20:13:10] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:13:10] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 12/43 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/43 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 523/740 variables, 217/260 constraints. Problems are: Problem set: 7 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 314 constraints, problems are : Problem set: 7 solved, 54 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 54/61 constraints, Known Traps: 36/36 constraints]
After SMT, in 10204ms problems are : Problem set: 7 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 108 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 213 transition count 491
Reduce places removed 26 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 28 rules applied. Total rules applied 55 place count 187 transition count 489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 186 transition count 489
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 56 place count 186 transition count 480
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 74 place count 177 transition count 480
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 85 place count 166 transition count 458
Iterating global reduction 3 with 11 rules applied. Total rules applied 96 place count 166 transition count 458
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 124 place count 152 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 152 transition count 443
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 151 transition count 441
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 151 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 150 transition count 440
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 137 place count 146 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 161 place count 146 transition count 426
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 164 place count 143 transition count 423
Iterating global reduction 4 with 3 rules applied. Total rules applied 167 place count 143 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 142 transition count 422
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 177 place count 138 transition count 436
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 189 place count 138 transition count 424
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 201 place count 126 transition count 424
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 126 transition count 423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 213 place count 120 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 120 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 119 transition count 420
Applied a total of 216 rules in 324 ms. Remains 119 /217 variables (removed 98) and now considering 420/523 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 119/217 places, 420/523 transitions.
RANDOM walk for 40000 steps (3996 resets) in 687 ms. (58 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (78 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (85 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (80 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (84 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (82 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (66 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (75 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (80 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (76 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (79 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (67 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (79 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (85 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (80 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (77 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (79 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (76 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (80 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (76 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (79 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (77 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (79 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (88 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (76 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (83 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (67 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (79 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (76 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (72 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (75 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (75 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (74 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (66 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (78 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (78 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (76 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (77 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (77 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (79 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (88 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
Interrupted probabilistic random walk after 303265 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :20 out of 54
Probabilistic random walk after 303265 steps, saw 56729 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :20
[2024-06-02 20:13:15] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
// Phase 1: matrix 404 rows 119 cols
[2024-06-02 20:13:15] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:13:15] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 75/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:13:16] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:13:17] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:13:17] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 2 ms to minimize.
[2024-06-02 20:13:17] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:13:17] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 404/523 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:13:18] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:13:18] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:13:18] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2024-06-02 20:13:19] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:13:20] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/523 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/523 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 156 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 75/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-02 20:13:22] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:13:22] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 2 ms to minimize.
[2024-06-02 20:13:22] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 5 (OVERLAPS) 404/523 variables, 119/145 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 14/159 constraints. Problems are: Problem set: 14 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/179 constraints. Problems are: Problem set: 14 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 179 constraints, problems are : Problem set: 14 solved, 20 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 20/34 constraints, Known Traps: 19/19 constraints]
After SMT, in 51022ms problems are : Problem set: 14 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 420/420 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 118 transition count 416
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 115 transition count 416
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 107 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 107 transition count 400
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 104 transition count 397
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 101 transition count 395
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 101 transition count 393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 100 transition count 394
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 100 transition count 383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 62 place count 89 transition count 383
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 89 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 88 transition count 383
Applied a total of 64 rules in 72 ms. Remains 88 /119 variables (removed 31) and now considering 383/420 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 88/119 places, 383/420 transitions.
RANDOM walk for 40000 steps (6530 resets) in 469 ms. (85 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4002 steps (124 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (147 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (132 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (148 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (90 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (136 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (117 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (143 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (148 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (103 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (147 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (143 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (136 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (137 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (138 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (128 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (136 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (86 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2024-06-02 20:14:07] [INFO ] Flow matrix only has 349 transitions (discarded 34 similar events)
// Phase 1: matrix 349 rows 88 cols
[2024-06-02 20:14:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:14:07] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 55/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 20:14:07] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:14:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 349/437 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 20:14:07] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 112 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 55/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 20:14:08] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 349/437 variables, 88/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 18/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 131 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 4/4 constraints]
After SMT, in 4260ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 1 properties in 7400 ms.
Support contains 33 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 382
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 86 transition count 381
Applied a total of 4 rules in 20 ms. Remains 86 /88 variables (removed 2) and now considering 381/383 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 86/88 places, 381/383 transitions.
RANDOM walk for 40000 steps (6521 resets) in 331 ms. (120 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (125 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (148 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (133 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (147 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (47 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (133 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (134 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (144 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (147 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (100 resets) in 46 ms. (85 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (148 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (139 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (133 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (137 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (133 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (138 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (85 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 602637 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :16 out of 17
Probabilistic random walk after 602637 steps, saw 116578 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :16
[2024-06-02 20:14:22] [INFO ] Flow matrix only has 347 transitions (discarded 34 similar events)
// Phase 1: matrix 347 rows 86 cols
[2024-06-02 20:14:22] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 20:14:22] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/260 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/433 variables, 57/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:14:22] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/433 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/260 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/433 variables, 57/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:14:22] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/433 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 86/86 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 381/381 transitions.
Graph (trivial) has 69 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 85 transition count 376
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 82 transition count 376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 80 transition count 348
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 80 transition count 348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 79 transition count 347
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 70 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 70 transition count 364
Free-agglomeration rule applied 18 times with reduction of 10 identical transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 55 place count 70 transition count 336
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 104 place count 52 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 118 place count 52 transition count 291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 50 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 128 place count 50 transition count 289
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 48 transition count 279
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 48 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 48 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 47 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 47 transition count 273
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 47 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 46 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 46 transition count 268
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 46 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 44 transition count 296
Applied a total of 150 rules in 179 ms. Remains 44 /86 variables (removed 42) and now considering 296/381 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 44/86 places, 296/381 transitions.
RANDOM walk for 20233 steps (1839 resets) in 862 ms. (23 steps per ms) remains 0/1 properties
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-17-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:14:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 20:14:23] [INFO ] Flatten gal took : 80 ms
[2024-06-02 20:14:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:14:23] [INFO ] Flatten gal took : 77 ms
[2024-06-02 20:14:23] [INFO ] Input system was already deterministic with 523 transitions.
Support contains 81 out of 217 places (down from 96) after GAL structural reductions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 15 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 190/217 places, 458/523 transitions.
[2024-06-02 20:14:23] [INFO ] Flatten gal took : 34 ms
[2024-06-02 20:14:23] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:14:23] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 9 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 20:14:23] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 29 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 228 edges and 217 vertex of which 9 / 217 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 210 transition count 486
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 180 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 178 transition count 468
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 163 transition count 468
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 118 place count 141 transition count 427
Iterating global reduction 3 with 22 rules applied. Total rules applied 140 place count 141 transition count 427
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 156 place count 141 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 410
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 140 transition count 410
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 190 place count 124 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 124 transition count 393
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 194 place count 121 transition count 363
Iterating global reduction 5 with 3 rules applied. Total rules applied 197 place count 121 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 206 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 214 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 116 transition count 349
Applied a total of 215 rules in 78 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 116/217 places, 349/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 194 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 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 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 181 transition count 470
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 165 transition count 470
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 117 place count 144 transition count 431
Iterating global reduction 3 with 21 rules applied. Total rules applied 138 place count 144 transition count 431
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 154 place count 144 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 144 transition count 414
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 143 transition count 414
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 188 place count 127 transition count 398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 127 transition count 397
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 125 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 125 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 201 place count 125 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 209 place count 121 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 121 transition count 367
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 120 transition count 366
Applied a total of 211 rules in 72 ms. Remains 120 /217 variables (removed 97) and now considering 366/523 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 120/217 places, 366/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 199 transition count 493
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 199 transition count 493
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 199 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 198 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 198 transition count 474
Applied a total of 55 rules in 9 ms. Remains 198 /217 variables (removed 19) and now considering 474/523 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 198/217 places, 474/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 474 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 8 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 217 edges and 217 vertex of which 6 / 217 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 212 transition count 488
Reduce places removed 30 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 32 rules applied. Total rules applied 63 place count 182 transition count 486
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 181 transition count 486
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 181 transition count 473
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 168 transition count 473
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 112 place count 146 transition count 432
Iterating global reduction 3 with 22 rules applied. Total rules applied 134 place count 146 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 150 place count 146 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 150 place count 146 transition count 415
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 145 transition count 415
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 184 place count 129 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 185 place count 129 transition count 398
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 126 transition count 368
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 126 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 199 place count 126 transition count 360
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 207 place count 122 transition count 356
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 122 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 121 transition count 355
Applied a total of 209 rules in 65 ms. Remains 121 /217 variables (removed 96) and now considering 355/523 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 121/217 places, 355/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 194 transition count 484
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 194 transition count 484
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 64 place count 194 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 192 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 192 transition count 462
Applied a total of 68 rules in 9 ms. Remains 192 /217 variables (removed 25) and now considering 462/523 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 192/217 places, 462/523 transitions.
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:14:24] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:14:24] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Graph (trivial) has 235 edges and 217 vertex of which 9 / 217 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 210 transition count 484
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 178 transition count 483
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 66 place count 178 transition count 469
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 94 place count 164 transition count 469
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 117 place count 141 transition count 426
Iterating global reduction 2 with 23 rules applied. Total rules applied 140 place count 141 transition count 426
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 141 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 156 place count 141 transition count 409
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 140 transition count 409
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 190 place count 124 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 124 transition count 392
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 121 transition count 362
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 121 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 121 transition count 354
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 213 place count 117 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 116 transition count 349
Applied a total of 214 rules in 54 ms. Remains 116 /217 variables (removed 101) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 116/217 places, 349/523 transitions.
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:14:25] [INFO ] Input system was already deterministic with 349 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 192 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 192 transition count 480
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 68 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 190 transition count 458
Applied a total of 72 rules in 11 ms. Remains 190 /217 variables (removed 27) and now considering 458/523 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 190/217 places, 458/523 transitions.
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:14:25] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 10 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:14:25] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 523/523 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 191 transition count 478
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 191 transition count 478
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 70 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 189 transition count 456
Applied a total of 74 rules in 9 ms. Remains 189 /217 variables (removed 28) and now considering 456/523 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 189/217 places, 456/523 transitions.
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:14:25] [INFO ] Input system was already deterministic with 456 transitions.
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:14:25] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:14:25] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 20:14:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 217 places, 523 transitions and 2532 arcs took 7 ms.
Total runtime 123370 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-17-CTLFireability-2024-15

BK_STOP 1717359266050

--------------------
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-17-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/864/ctl_0_
ctl formula name MedleyA-PT-17-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/864/ctl_1_
ctl formula name MedleyA-PT-17-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/864/ctl_2_
ctl formula name MedleyA-PT-17-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/864/ctl_3_
ctl formula name MedleyA-PT-17-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/864/ctl_4_
ctl formula name MedleyA-PT-17-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/864/ctl_5_
ctl formula name MedleyA-PT-17-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/864/ctl_6_
ctl formula name MedleyA-PT-17-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/864/ctl_7_
ctl formula name MedleyA-PT-17-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/864/ctl_8_
ctl formula name MedleyA-PT-17-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/864/ctl_9_
ctl formula name MedleyA-PT-17-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/864/ctl_10_
ctl formula name MedleyA-PT-17-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/864/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-17"
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-17, 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-171734921300130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;