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.r575-smll-171734919700129.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 greatspnxred
Input is MedleyA-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717366111587

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:08:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:08:34] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-06-02 22:08:34] [INFO ] Transformed 248 places.
[2024-06-02 22:08:34] [INFO ] Transformed 591 transitions.
[2024-06-02 22:08:34] [INFO ] Found NUPN structural information;
[2024-06-02 22:08:34] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 41 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 221 transition count 545
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 221 transition count 545
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 71 place count 221 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 220 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 220 transition count 526
Applied a total of 73 rules in 187 ms. Remains 220 /248 variables (removed 28) and now considering 526/589 (removed 63) transitions.
// Phase 1: matrix 526 rows 220 cols
[2024-06-02 22:08:35] [INFO ] Computed 7 invariants in 30 ms
[2024-06-02 22:08:35] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-02 22:08:35] [INFO ] Invariant cache hit.
[2024-06-02 22:08:36] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Running 525 sub problems to find dead transitions.
[2024-06-02 22:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:08:46] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 30 ms to minimize.
[2024-06-02 22:08:46] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 3 ms to minimize.
[2024-06-02 22:08:46] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 5 ms to minimize.
[2024-06-02 22:08:47] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 5 ms to minimize.
[2024-06-02 22:08:47] [INFO ] Deduced a trap composed of 17 places in 367 ms of which 4 ms to minimize.
[2024-06-02 22:08:47] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 3 ms to minimize.
[2024-06-02 22:08:47] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-06-02 22:08:48] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 4 ms to minimize.
[2024-06-02 22:08:48] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 2 ms to minimize.
[2024-06-02 22:08:48] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 2 ms to minimize.
[2024-06-02 22:08:48] [INFO ] Deduced a trap composed of 19 places in 348 ms of which 4 ms to minimize.
[2024-06-02 22:08:49] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
[2024-06-02 22:08:49] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2024-06-02 22:08:49] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2024-06-02 22:08:49] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 3 ms to minimize.
[2024-06-02 22:08:49] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:08:50] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 4 ms to minimize.
[2024-06-02 22:08:50] [INFO ] Deduced a trap composed of 122 places in 170 ms of which 3 ms to minimize.
[2024-06-02 22:08:50] [INFO ] Deduced a trap composed of 123 places in 218 ms of which 3 ms to minimize.
[2024-06-02 22:08:50] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:08:51] [INFO ] Deduced a trap composed of 130 places in 339 ms of which 4 ms to minimize.
[2024-06-02 22:08:51] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 4 ms to minimize.
[2024-06-02 22:08:52] [INFO ] Deduced a trap composed of 131 places in 224 ms of which 2 ms to minimize.
[2024-06-02 22:08:52] [INFO ] Deduced a trap composed of 130 places in 272 ms of which 3 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 4 ms to minimize.
[2024-06-02 22:08:54] [INFO ] Deduced a trap composed of 30 places in 334 ms of which 4 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 4 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 4 ms to minimize.
[2024-06-02 22:08:55] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 4 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 3 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 4 ms to minimize.
[2024-06-02 22:08:56] [INFO ] Deduced a trap composed of 24 places in 287 ms of which 4 ms to minimize.
[2024-06-02 22:08:57] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 3 ms to minimize.
[2024-06-02 22:08:57] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 4 ms to minimize.
[2024-06-02 22:08:57] [INFO ] Deduced a trap composed of 26 places in 332 ms of which 6 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 4 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 3 ms to minimize.
[2024-06-02 22:08:58] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 4 ms to minimize.
[2024-06-02 22:08:59] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 4 ms to minimize.
[2024-06-02 22:08:59] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:09:03] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 3 ms to minimize.
[2024-06-02 22:09:04] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 4 ms to minimize.
[2024-06-02 22:09:06] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 4 ms to minimize.
[2024-06-02 22:09:06] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 4 ms to minimize.
[2024-06-02 22:09:06] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 4 ms to minimize.
[2024-06-02 22:09:07] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/746 variables, and 53 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/220 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:09:13] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 4 ms to minimize.
[2024-06-02 22:09:14] [INFO ] Deduced a trap composed of 137 places in 314 ms of which 4 ms to minimize.
[2024-06-02 22:09:14] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 3 ms to minimize.
[2024-06-02 22:09:15] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 4 ms to minimize.
[2024-06-02 22:09:15] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 5 ms to minimize.
[2024-06-02 22:09:15] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 4 ms to minimize.
[2024-06-02 22:09:16] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 4 ms to minimize.
[2024-06-02 22:09:16] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 3 ms to minimize.
[2024-06-02 22:09:16] [INFO ] Deduced a trap composed of 57 places in 335 ms of which 4 ms to minimize.
[2024-06-02 22:09:17] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 3 ms to minimize.
[2024-06-02 22:09:17] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 4 ms to minimize.
[2024-06-02 22:09:17] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 4 ms to minimize.
[2024-06-02 22:09:18] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 4 ms to minimize.
[2024-06-02 22:09:18] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 4 ms to minimize.
[2024-06-02 22:09:18] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 3 ms to minimize.
[2024-06-02 22:09:19] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 3 ms to minimize.
[2024-06-02 22:09:19] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 4 ms to minimize.
[2024-06-02 22:09:19] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 5 ms to minimize.
[2024-06-02 22:09:20] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 4 ms to minimize.
[2024-06-02 22:09:20] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:09:23] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 3 ms to minimize.
[2024-06-02 22:09:25] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 3 ms to minimize.
[2024-06-02 22:09:25] [INFO ] Deduced a trap composed of 130 places in 158 ms of which 2 ms to minimize.
[2024-06-02 22:09:25] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 3 ms to minimize.
[2024-06-02 22:09:26] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-06-02 22:09:26] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:09:30] [INFO ] Deduced a trap composed of 134 places in 321 ms of which 4 ms to minimize.
[2024-06-02 22:09:30] [INFO ] Deduced a trap composed of 121 places in 333 ms of which 4 ms to minimize.
[2024-06-02 22:09:31] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 4 ms to minimize.
[2024-06-02 22:09:31] [INFO ] Deduced a trap composed of 135 places in 320 ms of which 4 ms to minimize.
[2024-06-02 22:09:31] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 3 ms to minimize.
[2024-06-02 22:09:32] [INFO ] Deduced a trap composed of 135 places in 254 ms of which 3 ms to minimize.
[2024-06-02 22:09:32] [INFO ] Deduced a trap composed of 122 places in 317 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 525 unsolved
[2024-06-02 22:09:36] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:09:37] [INFO ] Deduced a trap composed of 127 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 61011ms, After SMT, problems are : Problem set: 0 solved, 525 unsolved
Search for dead transitions found 0 dead transitions in 61074ms
Starting structural reductions in LTL mode, iteration 1 : 220/248 places, 526/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62593 ms. Remains : 220/248 places, 526/589 transitions.
Support contains 87 out of 220 places after structural reductions.
[2024-06-02 22:09:37] [INFO ] Flatten gal took : 182 ms
[2024-06-02 22:09:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:09:38] [INFO ] Flatten gal took : 96 ms
[2024-06-02 22:09:38] [INFO ] Input system was already deterministic with 526 transitions.
Support contains 77 out of 220 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (1376 resets) in 2699 ms. (14 steps per ms) remains 40/58 properties
BEST_FIRST walk for 4003 steps (28 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (27 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (27 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 44 ms. (88 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (29 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (30 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (27 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
[2024-06-02 22:09:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 167/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:40] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 3 ms to minimize.
[2024-06-02 22:09:40] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:41] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 3 ms to minimize.
[2024-06-02 22:09:41] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2024-06-02 22:09:41] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-02 22:09:41] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:42] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 2 ms to minimize.
[2024-06-02 22:09:42] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 526/746 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:43] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:44] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 237 constraints, problems are : Problem set: 0 solved, 40 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 167/220 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 22:09:45] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 3 ms to minimize.
[2024-06-02 22:09:45] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 4 ms to minimize.
[2024-06-02 22:09:45] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 4 ms to minimize.
[2024-06-02 22:09:46] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 4 ms to minimize.
[2024-06-02 22:09:46] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-06-02 22:09:46] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 4 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 4 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 5 ms to minimize.
[2024-06-02 22:09:47] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 4 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 3 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 28 places in 292 ms of which 4 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 4 ms to minimize.
[2024-06-02 22:09:48] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 4 ms to minimize.
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 3 ms to minimize.
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 3 ms to minimize.
[2024-06-02 22:09:49] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 3 ms to minimize.
SMT process timed out in 10151ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 526/526 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 220 transition count 508
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 202 transition count 505
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 199 transition count 505
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 42 place count 199 transition count 496
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 60 place count 190 transition count 496
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 70 place count 180 transition count 480
Iterating global reduction 3 with 10 rules applied. Total rules applied 80 place count 180 transition count 480
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 120 place count 160 transition count 460
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 160 transition count 457
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 147 place count 148 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 176 place count 148 transition count 467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 147 transition count 466
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 147 transition count 466
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 186 place count 143 transition count 462
Free-agglomeration rule applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 212 place count 143 transition count 436
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 238 place count 117 transition count 436
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 239 place count 117 transition count 435
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 240 place count 117 transition count 435
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 117 transition count 435
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 116 transition count 434
Applied a total of 242 rules in 393 ms. Remains 116 /220 variables (removed 104) and now considering 434/526 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 116/220 places, 434/526 transitions.
RANDOM walk for 40000 steps (1843 resets) in 732 ms. (54 steps per ms) remains 13/39 properties
BEST_FIRST walk for 40002 steps (581 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (586 resets) in 199 ms. (200 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40001 steps (589 resets) in 237 ms. (168 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (561 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (580 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (595 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (593 resets) in 133 ms. (298 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (595 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (605 resets) in 163 ms. (243 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (584 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (601 resets) in 347 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (569 resets) in 355 ms. (112 steps per ms) remains 9/9 properties
[2024-06-02 22:09:51] [INFO ] Flow matrix only has 422 transitions (discarded 12 similar events)
// Phase 1: matrix 422 rows 116 cols
[2024-06-02 22:09:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:09:51] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 74/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:09:51] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 369/453 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 83/536 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/538 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:09:52] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 2 ms to minimize.
[2024-06-02 22:09:52] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-02 22:09:52] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:09:52] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/538 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 138 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 74/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 369/453 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 83/536 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/538 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:09:53] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:09:53] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-02 22:09:53] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/538 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2024-06-02 22:09:54] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/538 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 154 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 12/12 constraints]
After SMT, in 3880ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 1274 steps, including 186 resets, run visited all 1 properties in 3 ms. (steps per millisecond=424 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 1904 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-06-02 22:09:57] [INFO ] Flatten gal took : 44 ms
[2024-06-02 22:09:57] [INFO ] Flatten gal took : 48 ms
[2024-06-02 22:09:57] [INFO ] Input system was already deterministic with 526 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 241 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 3 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 490
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 184 transition count 490
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 59 place count 184 transition count 474
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 91 place count 168 transition count 474
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 117 place count 142 transition count 428
Iterating global reduction 2 with 26 rules applied. Total rules applied 143 place count 142 transition count 428
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 159 place count 142 transition count 412
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 159 place count 142 transition count 410
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 140 transition count 410
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 137 transition count 380
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 137 transition count 380
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 201 place count 121 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 121 transition count 363
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 203 place count 120 transition count 361
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 120 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 120 transition count 353
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 220 place count 116 transition count 349
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 115 transition count 348
Applied a total of 221 rules in 101 ms. Remains 115 /220 variables (removed 105) and now considering 348/526 (removed 178) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 115/220 places, 348/526 transitions.
[2024-06-02 22:09:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:09:57] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:09:57] [INFO ] Input system was already deterministic with 348 transitions.
RANDOM walk for 40000 steps (7412 resets) in 407 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1399 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 50896 steps, run visited all 1 properties in 213 ms. (steps per millisecond=238 )
Probabilistic random walk after 50896 steps, saw 11676 distinct states, run finished after 218 ms. (steps per millisecond=233 ) properties seen :1
FORMULA MedleyA-PT-17-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 234 edges and 220 vertex of which 9 / 220 are part of one of the 3 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 213 transition count 492
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 186 transition count 492
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 55 place count 186 transition count 476
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 112 place count 145 transition count 432
Iterating global reduction 2 with 25 rules applied. Total rules applied 137 place count 145 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 153 place count 145 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 153 place count 145 transition count 414
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 143 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 140 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 140 transition count 384
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 195 place count 124 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 365
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 123 transition count 357
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 214 place count 119 transition count 353
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 215 place count 119 transition count 353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 118 transition count 352
Applied a total of 216 rules in 95 ms. Remains 118 /220 variables (removed 102) and now considering 352/526 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 118/220 places, 352/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:09:58] [INFO ] Input system was already deterministic with 352 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 197 transition count 486
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 197 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 197 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 195 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 195 transition count 481
Applied a total of 51 rules in 11 ms. Remains 195 /220 variables (removed 25) and now considering 481/526 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 195/220 places, 481/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 41 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:09:58] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 194 transition count 481
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 194 transition count 481
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 68 place count 194 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 193 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 193 transition count 463
Applied a total of 70 rules in 11 ms. Remains 193 /220 variables (removed 27) and now considering 463/526 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 193/220 places, 463/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:09:58] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 234 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 213 transition count 492
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 186 transition count 492
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 55 place count 186 transition count 476
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 113 place count 144 transition count 430
Iterating global reduction 2 with 26 rules applied. Total rules applied 139 place count 144 transition count 430
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 155 place count 144 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 412
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 142 transition count 412
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 139 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 139 transition count 382
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 195 place count 124 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 205 place count 123 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 211 place count 120 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 212 place count 119 transition count 353
Applied a total of 212 rules in 65 ms. Remains 119 /220 variables (removed 101) and now considering 353/526 (removed 173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 119/220 places, 353/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:09:58] [INFO ] Input system was already deterministic with 353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 12 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 189/220 places, 456/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:09:58] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 192 transition count 479
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 192 transition count 479
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 73 place count 192 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 190 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 190 transition count 458
Applied a total of 77 rules in 12 ms. Remains 190 /220 variables (removed 30) and now considering 458/526 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 190/220 places, 458/526 transitions.
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 29 ms
[2024-06-02 22:09:58] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 458 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 13 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 189/220 places, 456/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 30 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 456 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 233 edges and 220 vertex of which 9 / 220 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 213 transition count 491
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 185 transition count 491
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 57 place count 185 transition count 476
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 170 transition count 476
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 112 place count 145 transition count 431
Iterating global reduction 2 with 25 rules applied. Total rules applied 137 place count 145 transition count 431
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 153 place count 145 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 153 place count 145 transition count 413
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 143 transition count 413
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 140 transition count 383
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 140 transition count 383
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 195 place count 124 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 124 transition count 366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 123 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 123 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 123 transition count 356
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 214 place count 119 transition count 352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 118 transition count 351
Applied a total of 215 rules in 62 ms. Remains 118 /220 variables (removed 102) and now considering 351/526 (removed 175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 118/220 places, 351/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 351 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 198 transition count 488
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 198 transition count 488
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 198 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 197 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 197 transition count 469
Applied a total of 63 rules in 13 ms. Remains 197 /220 variables (removed 23) and now considering 469/526 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 197/220 places, 469/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 37 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 229 edges and 220 vertex of which 3 / 220 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 217 transition count 495
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 189 transition count 492
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 186 transition count 492
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 63 place count 186 transition count 477
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 93 place count 171 transition count 477
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 117 place count 147 transition count 434
Iterating global reduction 3 with 24 rules applied. Total rules applied 141 place count 147 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 157 place count 147 transition count 418
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 147 transition count 417
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 146 transition count 417
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 145 transition count 401
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 145 transition count 401
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 191 place count 130 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 130 transition count 385
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 193 place count 129 transition count 383
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 129 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 202 place count 129 transition count 375
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 210 place count 125 transition count 371
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 124 transition count 370
Applied a total of 211 rules in 103 ms. Remains 124 /220 variables (removed 96) and now considering 370/526 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 124/220 places, 370/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 198 transition count 491
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 198 transition count 491
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 198 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 197 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 197 transition count 472
Applied a total of 63 rules in 18 ms. Remains 197 /220 variables (removed 23) and now considering 472/526 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 197/220 places, 472/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 36 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 36 ms
[2024-06-02 22:09:59] [INFO ] Input system was already deterministic with 472 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Graph (trivial) has 238 edges and 220 vertex of which 9 / 220 are part of one of the 3 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 490
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 184 transition count 490
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 59 place count 184 transition count 474
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 91 place count 168 transition count 474
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 115 place count 144 transition count 432
Iterating global reduction 2 with 24 rules applied. Total rules applied 139 place count 144 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 155 place count 144 transition count 416
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 414
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 142 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 139 transition count 384
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 139 transition count 384
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 193 place count 125 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 125 transition count 369
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 124 transition count 367
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 124 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 204 place count 124 transition count 359
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 120 transition count 355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 119 transition count 354
Applied a total of 213 rules in 58 ms. Remains 119 /220 variables (removed 101) and now considering 354/526 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 119/220 places, 354/526 transitions.
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:09:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:10:00] [INFO ] Input system was already deterministic with 354 transitions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 526/526 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 191 transition count 477
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 191 transition count 477
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 75 place count 191 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 189 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 189 transition count 456
Applied a total of 79 rules in 9 ms. Remains 189 /220 variables (removed 31) and now considering 456/526 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 189/220 places, 456/526 transitions.
[2024-06-02 22:10:00] [INFO ] Flatten gal took : 21 ms
[2024-06-02 22:10:00] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:10:00] [INFO ] Input system was already deterministic with 456 transitions.
[2024-06-02 22:10:00] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:10:00] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:10:00] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-02 22:10:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 526 transitions and 2534 arcs took 6 ms.
Total runtime 86228 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 220
TRANSITIONS: 526
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.004s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 935
MODEL NAME: /home/mcc/execution/413/model
220 places, 526 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-17-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-17-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366776481

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;