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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 158K 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-18-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717360408722

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 20:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:33:31] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2024-06-02 20:33:31] [INFO ] Transformed 252 places.
[2024-06-02 20:33:31] [INFO ] Transformed 543 transitions.
[2024-06-02 20:33:31] [INFO ] Found NUPN structural information;
[2024-06-02 20:33:31] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 103 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 225 transition count 500
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 225 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 223 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 223 transition count 498
Applied a total of 58 rules in 66 ms. Remains 223 /252 variables (removed 29) and now considering 498/541 (removed 43) transitions.
// Phase 1: matrix 498 rows 223 cols
[2024-06-02 20:33:31] [INFO ] Computed 7 invariants in 31 ms
[2024-06-02 20:33:32] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-02 20:33:32] [INFO ] Invariant cache hit.
[2024-06-02 20:33:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2024-06-02 20:33:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 20:33:41] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 39 ms to minimize.
[2024-06-02 20:33:41] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 14 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 4 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 4 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 4 ms to minimize.
[2024-06-02 20:33:42] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 3 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 5 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 3 ms to minimize.
[2024-06-02 20:33:43] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 2 ms to minimize.
[2024-06-02 20:33:44] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-06-02 20:33:44] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 2 ms to minimize.
[2024-06-02 20:33:44] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-06-02 20:33:44] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-06-02 20:33:44] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-06-02 20:33:45] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:33:46] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:33:47] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-06-02 20:33:47] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:33:47] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:33:49] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 4 ms to minimize.
[2024-06-02 20:33:49] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 4 ms to minimize.
[2024-06-02 20:33:49] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-02 20:33:49] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:33:50] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 4 ms to minimize.
[2024-06-02 20:33:50] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-06-02 20:33:51] [INFO ] Deduced a trap composed of 39 places in 309 ms of which 4 ms to minimize.
[2024-06-02 20:33:51] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 4 ms to minimize.
[2024-06-02 20:33:51] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 5 ms to minimize.
[2024-06-02 20:33:51] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 8 ms to minimize.
[2024-06-02 20:33:52] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 4 ms to minimize.
[2024-06-02 20:33:52] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 4 ms to minimize.
[2024-06-02 20:33:53] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 4 ms to minimize.
[2024-06-02 20:33:53] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 4 ms to minimize.
[2024-06-02 20:33:53] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-02 20:33:58] [INFO ] Deduced a trap composed of 49 places in 313 ms of which 4 ms to minimize.
[2024-06-02 20:33:59] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-06-02 20:34:00] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 4 ms to minimize.
[2024-06-02 20:34:00] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 4 ms to minimize.
[2024-06-02 20:34:01] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 4 ms to minimize.
[2024-06-02 20:34:01] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 4 ms to minimize.
[2024-06-02 20:34:01] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 4 ms to minimize.
[2024-06-02 20:34:02] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 4 ms to minimize.
[2024-06-02 20:34:02] [INFO ] Deduced a trap composed of 54 places in 286 ms of which 3 ms to minimize.
[2024-06-02 20:34:02] [INFO ] Deduced a trap composed of 120 places in 276 ms of which 4 ms to minimize.
[2024-06-02 20:34:03] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 3 ms to minimize.
[2024-06-02 20:34:03] [INFO ] Deduced a trap composed of 140 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 30963ms, After SMT, problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 31013ms
Starting structural reductions in LTL mode, iteration 1 : 223/252 places, 498/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31894 ms. Remains : 223/252 places, 498/541 transitions.
Support contains 103 out of 223 places after structural reductions.
[2024-06-02 20:34:04] [INFO ] Flatten gal took : 179 ms
[2024-06-02 20:34:04] [INFO ] Flatten gal took : 96 ms
[2024-06-02 20:34:04] [INFO ] Input system was already deterministic with 498 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (1532 resets) in 2991 ms. (13 steps per ms) remains 68/78 properties
BEST_FIRST walk for 4004 steps (34 resets) in 71 ms. (55 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (34 resets) in 49 ms. (80 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (32 resets) in 72 ms. (54 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (32 resets) in 78 ms. (50 steps per ms) remains 66/68 properties
BEST_FIRST walk for 4003 steps (34 resets) in 88 ms. (44 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 63 ms. (62 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (34 resets) in 60 ms. (65 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (33 resets) in 66 ms. (59 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (35 resets) in 78 ms. (50 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (34 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (32 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (34 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (33 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (32 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (34 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (35 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (32 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (34 resets) in 37 ms. (105 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (34 resets) in 45 ms. (87 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (34 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (35 resets) in 41 ms. (95 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (34 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (33 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (35 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (35 resets) in 49 ms. (80 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (34 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (35 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (33 resets) in 27 ms. (143 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 31 ms. (125 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (33 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (32 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (34 resets) in 33 ms. (117 steps per ms) remains 66/66 properties
[2024-06-02 20:34:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 133/223 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 60 unsolved
[2024-06-02 20:34:07] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2024-06-02 20:34:07] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 4 ms to minimize.
[2024-06-02 20:34:07] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 4 ms to minimize.
[2024-06-02 20:34:08] [INFO ] Deduced a trap composed of 38 places in 423 ms of which 21 ms to minimize.
[2024-06-02 20:34:08] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:34:08] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:34:09] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 2 ms to minimize.
[2024-06-02 20:34:09] [INFO ] Deduced a trap composed of 130 places in 215 ms of which 2 ms to minimize.
[2024-06-02 20:34:09] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
[2024-06-02 20:34:09] [INFO ] Deduced a trap composed of 32 places in 321 ms of which 4 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 4 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 4 ms to minimize.
[2024-06-02 20:34:10] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:34:11] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-02 20:34:11] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 3 ms to minimize.
SMT process timed out in 5246ms, After SMT, problems are : Problem set: 6 solved, 60 unsolved
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 82 edges and 223 vertex of which 4 / 223 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 220 transition count 475
Reduce places removed 19 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 29 rules applied. Total rules applied 49 place count 201 transition count 465
Reduce places removed 10 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 2 with 12 rules applied. Total rules applied 61 place count 191 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 190 transition count 463
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 62 place count 190 transition count 456
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 76 place count 183 transition count 456
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 180 transition count 450
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 180 transition count 450
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 120 place count 161 transition count 431
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 160 transition count 429
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 160 transition count 429
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 159 transition count 427
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 159 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 156 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 156 transition count 422
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 152 transition count 418
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 152 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 151 transition count 423
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 151 transition count 418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 161 place count 146 transition count 418
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 145 transition count 416
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 145 transition count 416
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 145 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 145 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 144 transition count 414
Applied a total of 166 rules in 348 ms. Remains 144 /223 variables (removed 79) and now considering 414/498 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 144/223 places, 414/498 transitions.
RANDOM walk for 40000 steps (2654 resets) in 864 ms. (46 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (54 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (54 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (55 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (57 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (55 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (52 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (56 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (57 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (55 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (56 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (52 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (60 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (55 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (52 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (60 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (59 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (56 resets) in 27 ms. (143 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (55 resets) in 21 ms. (181 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (56 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (56 resets) in 33 ms. (117 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 24 ms. (160 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (54 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (56 resets) in 52 ms. (75 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (57 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (51 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (58 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (56 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 17 ms. (222 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (60 resets) in 16 ms. (235 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 58/60 properties
BEST_FIRST walk for 4004 steps (56 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (56 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (55 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (55 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (59 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (58 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (58 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
Interrupted probabilistic random walk after 318320 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :42 out of 58
Probabilistic random walk after 318320 steps, saw 54955 distinct states, run finished after 3013 ms. (steps per millisecond=105 ) properties seen :42
[2024-06-02 20:34:15] [INFO ] Flow matrix only has 412 transitions (discarded 2 similar events)
// Phase 1: matrix 412 rows 144 cols
[2024-06-02 20:34:15] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:34:15] [INFO ] State equation strengthened by 6 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, 16 unsolved
At refinement iteration 1 (OVERLAPS) 111/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 20:34:16] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:34:16] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-02 20:34:16] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 2 ms to minimize.
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 412/556 variables, 144/154 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 6/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/556 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 160 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 113/144 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 2 ms to minimize.
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:34:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 2 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:34:18] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
[2024-06-02 20:34:19] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 10/20 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 20:34:19] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-02 20:34:19] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 7 (OVERLAPS) 412/556 variables, 144/166 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 6/172 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 11/183 constraints. Problems are: Problem set: 5 solved, 11 unsolved
[2024-06-02 20:34:35] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:34:37] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 2/185 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 185 constraints, problems are : Problem set: 5 solved, 11 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 17/17 constraints]
After SMT, in 46364ms problems are : Problem set: 5 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 414/414 transitions.
Graph (trivial) has 99 edges and 144 vertex of which 2 / 144 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 143 transition count 403
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 134 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 133 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 21 place count 133 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 130 transition count 399
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 43 place count 114 transition count 371
Iterating global reduction 3 with 16 rules applied. Total rules applied 59 place count 114 transition count 371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 114 transition count 370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 113 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 112 transition count 368
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 112 transition count 368
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 105 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 105 transition count 360
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 103 transition count 354
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 103 transition count 354
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 102 transition count 352
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 102 transition count 352
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 102 place count 93 transition count 394
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 109 place count 93 transition count 387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 92 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 117 place count 92 transition count 398
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 91 transition count 394
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 91 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 120 place count 90 transition count 392
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 90 transition count 392
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 5 with 2 rules applied. Total rules applied 123 place count 89 transition count 393
Free-agglomeration rule applied 16 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 139 place count 89 transition count 371
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 169 place count 73 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 188 place count 73 transition count 338
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 73 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 72 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 192 place count 72 transition count 335
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 194 place count 72 transition count 337
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 198 place count 70 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 200 place count 70 transition count 333
Applied a total of 200 rules in 177 ms. Remains 70 /144 variables (removed 74) and now considering 333/414 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 70/144 places, 333/414 transitions.
RANDOM walk for 40000 steps (3538 resets) in 327 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (854 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (906 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (855 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (896 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (201 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (972 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (823 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (902 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (913 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (882 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (822 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 801474 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :10 out of 11
Probabilistic random walk after 801474 steps, saw 156322 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :10
[2024-06-02 20:35:05] [INFO ] Flow matrix only has 310 transitions (discarded 23 similar events)
// Phase 1: matrix 310 rows 70 cols
[2024-06-02 20:35:05] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:35:05] [INFO ] State equation strengthened by 17 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) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 283/317 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/380 variables, 36/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 283/317 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/380 variables, 36/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 20:35:06] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 333/333 transitions.
Graph (trivial) has 43 edges and 70 vertex of which 2 / 70 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 69 transition count 324
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 62 transition count 324
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 62 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 59 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 59 transition count 292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 57 transition count 298
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 57 transition count 296
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 57 transition count 284
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 63 place count 45 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 70 place count 45 transition count 267
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 45 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 43 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 43 transition count 353
Applied a total of 76 rules in 115 ms. Remains 43 /70 variables (removed 27) and now considering 353/333 (removed -20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 43/70 places, 353/333 transitions.
RANDOM walk for 40000 steps (41 resets) in 1998 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13519 steps (7 resets) in 75 ms. (177 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 76 ms
[2024-06-02 20:35:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 46 ms
[2024-06-02 20:35:07] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 80 out of 223 places (down from 89) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 6 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 204/223 places, 464/498 transitions.
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 33 ms
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 31 ms
[2024-06-02 20:35:07] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 460
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 460
Applied a total of 42 rules in 6 ms. Remains 202 /223 variables (removed 21) and now considering 460/498 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 202/223 places, 460/498 transitions.
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:35:07] [INFO ] Input system was already deterministic with 460 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 6 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:35:07] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:35:08] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 9 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 203/223 places, 461/498 transitions.
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 37 ms
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 39 ms
[2024-06-02 20:35:08] [INFO ] Input system was already deterministic with 461 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 227 edges and 223 vertex of which 8 / 223 are part of one of the 2 SCC in 1 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 216 transition count 446
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 171 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 169 transition count 442
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 97 place count 169 transition count 431
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 119 place count 158 transition count 431
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 142 place count 135 transition count 388
Iterating global reduction 3 with 23 rules applied. Total rules applied 165 place count 135 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 165 place count 135 transition count 387
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 167 place count 134 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 133 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 133 transition count 371
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 209 place count 113 transition count 351
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 108 transition count 331
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 108 transition count 331
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 106 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 106 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 234 place count 106 transition count 316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 106 transition count 315
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 236 place count 105 transition count 315
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 248 place count 99 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 97 transition count 301
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 97 transition count 301
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 254 place count 95 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 95 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 94 transition count 296
Applied a total of 257 rules in 109 ms. Remains 94 /223 variables (removed 129) and now considering 296/498 (removed 202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 94/223 places, 296/498 transitions.
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:35:08] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 10747 steps (1765 resets) in 57 ms. (185 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 8 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 203/223 places, 462/498 transitions.
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 34 ms
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 35 ms
[2024-06-02 20:35:08] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 463
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 463
Applied a total of 38 rules in 9 ms. Remains 204 /223 variables (removed 19) and now considering 463/498 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 204/223 places, 463/498 transitions.
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 32 ms
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 34 ms
[2024-06-02 20:35:08] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 222 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 212 transition count 448
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 173 transition count 444
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 171 transition count 440
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 93 place count 167 transition count 440
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 93 place count 167 transition count 430
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 135 place count 135 transition count 389
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 135 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 135 transition count 388
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 159 place count 134 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 133 transition count 372
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 133 transition count 372
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 195 place count 116 transition count 355
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 200 place count 111 transition count 335
Iterating global reduction 4 with 5 rules applied. Total rules applied 205 place count 111 transition count 335
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 109 transition count 331
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 109 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 218 place count 109 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 218 place count 109 transition count 321
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 220 place count 108 transition count 321
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 228 place count 104 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 102 transition count 309
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 102 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 100 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 100 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 100 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 99 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 99 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 98 transition count 303
Applied a total of 240 rules in 97 ms. Remains 98 /223 variables (removed 125) and now considering 303/498 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 98/223 places, 303/498 transitions.
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:35:08] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 303 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 7 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 203/223 places, 462/498 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 6 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 6 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 204/223 places, 464/498 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 238 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 212 transition count 443
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 168 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 166 transition count 439
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 166 transition count 430
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 134 place count 136 transition count 391
Iterating global reduction 3 with 21 rules applied. Total rules applied 155 place count 136 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 136 transition count 390
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 157 place count 135 transition count 390
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 195 place count 116 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 111 transition count 347
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 111 transition count 347
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 109 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 109 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 109 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 221 place count 109 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 107 transition count 329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 101 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 99 transition count 315
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 99 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 97 transition count 311
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 97 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 310
Applied a total of 246 rules in 54 ms. Remains 96 /223 variables (removed 127) and now considering 310/498 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 96/223 places, 310/498 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 5 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 203/223 places, 461/498 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:35:09] [INFO ] Input system was already deterministic with 461 transitions.
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:35:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:35:09] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-02 20:35:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 498 transitions and 2346 arcs took 15 ms.
Total runtime 98794 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-18-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-18-CTLFireability-2024-15

BK_STOP 1717360510184

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

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