About the Execution of GreatSPN+red for ShieldRVt-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11520.735 | 3600000.00 | 12493502.00 | 4898.00 | T?F?T??????????T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683760001001.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 ShieldRVt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001001
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 364K May 18 16:43 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 ShieldRVt-PT-030B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-030B-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717080555188
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:49:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 14:49:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:49:16] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-30 14:49:16] [INFO ] Transformed 1503 places.
[2024-05-30 14:49:16] [INFO ] Transformed 1503 transitions.
[2024-05-30 14:49:16] [INFO ] Found NUPN structural information;
[2024-05-30 14:49:16] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 123 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 288 places :
Symmetric choice reduction at 0 with 288 rule applications. Total rules 288 place count 1215 transition count 1215
Iterating global reduction 0 with 288 rules applied. Total rules applied 576 place count 1215 transition count 1215
Applied a total of 576 rules in 244 ms. Remains 1215 /1503 variables (removed 288) and now considering 1215/1503 (removed 288) transitions.
// Phase 1: matrix 1215 rows 1215 cols
[2024-05-30 14:49:17] [INFO ] Computed 121 invariants in 30 ms
[2024-05-30 14:49:17] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-30 14:49:17] [INFO ] Invariant cache hit.
[2024-05-30 14:49:18] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2024-05-30 14:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 30310ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 30355ms
Starting structural reductions in LTL mode, iteration 1 : 1215/1503 places, 1215/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31943 ms. Remains : 1215/1503 places, 1215/1503 transitions.
Support contains 123 out of 1215 places after structural reductions.
[2024-05-30 14:49:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 14:49:48] [INFO ] Flatten gal took : 89 ms
[2024-05-30 14:49:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-030B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 14:49:48] [INFO ] Flatten gal took : 52 ms
[2024-05-30 14:49:49] [INFO ] Input system was already deterministic with 1215 transitions.
Support contains 86 out of 1215 places (down from 123) after GAL structural reductions.
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1820 ms. (21 steps per ms) remains 18/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
[2024-05-30 14:49:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 887/934 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 281/1215 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1215 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1215/2430 variables, 1215/1336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2430 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/2430 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1336 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2443 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1215/1215 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 887/934 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 14:49:52] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 35 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 4 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 4 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 4 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 3 ms to minimize.
[2024-05-30 14:49:53] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 4 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 4 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 3 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 3 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-05-30 14:49:54] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 3 ms to minimize.
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 14:49:55] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 281/1215 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 14:49:56] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 3 ms to minimize.
[2024-05-30 14:49:56] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:49:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-30 14:49:57] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:49:57] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1215 variables, 5/147 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-30 14:49:57] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 3 ms to minimize.
SMT process timed out in 7567ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 1215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 301 place count 1215 transition count 914
Reduce places removed 301 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 306 rules applied. Total rules applied 607 place count 914 transition count 909
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 612 place count 909 transition count 909
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 214 Pre rules applied. Total rules applied 612 place count 909 transition count 695
Deduced a syphon composed of 214 places in 1 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 3 with 428 rules applied. Total rules applied 1040 place count 695 transition count 695
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1061 place count 674 transition count 674
Iterating global reduction 3 with 21 rules applied. Total rules applied 1082 place count 674 transition count 674
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1082 place count 674 transition count 655
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1120 place count 655 transition count 655
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Deduced a syphon composed of 260 places in 1 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 3 with 520 rules applied. Total rules applied 1640 place count 395 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1641 place count 395 transition count 394
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1643 place count 394 transition count 393
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 1797 place count 317 transition count 453
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1798 place count 317 transition count 452
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 1803 place count 317 transition count 447
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1808 place count 312 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1811 place count 312 transition count 444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1812 place count 311 transition count 443
Applied a total of 1812 rules in 258 ms. Remains 311 /1215 variables (removed 904) and now considering 443/1215 (removed 772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 311/1215 places, 443/1215 transitions.
RANDOM walk for 40000 steps (10 resets) in 879 ms. (45 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40003 steps (10 resets) in 223 ms. (178 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 195 ms. (204 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
// Phase 1: matrix 443 rows 311 cols
[2024-05-30 14:49:58] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:49:58] [INFO ] State equation strengthened by 176 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 196/224 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/244 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 368/612 variables, 244/334 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 151/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 123/735 variables, 55/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 24/564 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 19/583 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/739 variables, 3/586 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/739 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/743 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/743 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 11/754 variables, 10/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/754 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/754 variables, 6/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/754 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/754 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 608 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 311/311 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 196/224 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/244 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 368/612 variables, 244/334 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 151/485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 14:50:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 123/735 variables, 55/549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 24/573 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/735 variables, 19/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/735 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 14:50:00] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-30 14:50:00] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/735 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 4/739 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/739 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/739 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 4/743 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/743 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 11/754 variables, 10/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/754 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/754 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/754 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/754 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 621 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2561 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 311/311 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 3738ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 902 ms.
Support contains 28 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 443/443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 311 transition count 436
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 304 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 303 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 303 transition count 433
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 20 place count 301 transition count 433
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 44 place count 289 transition count 421
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 3 with 8 rules applied. Total rules applied 52 place count 285 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 283 transition count 423
Applied a total of 54 rules in 41 ms. Remains 283 /311 variables (removed 28) and now considering 423/443 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 283/311 places, 423/443 transitions.
RANDOM walk for 40000 steps (11 resets) in 413 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 189477 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :9 out of 10
Probabilistic random walk after 189477 steps, saw 115921 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :9
// Phase 1: matrix 423 rows 283 cols
[2024-05-30 14:50:06] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 14:50:06] [INFO ] State equation strengthened by 177 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/180 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/456 variables, 180/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 144/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/534 variables, 26/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/538 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/540 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 77/617 variables, 32/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/617 variables, 11/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/617 variables, 8/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/617 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/623 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/623 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/629 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/629 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 52/681 variables, 28/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/681 variables, 7/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/681 variables, 13/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/681 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/682 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/682 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/682 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 3/685 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/685 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 17/702 variables, 11/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/702 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/702 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/702 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1/703 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/703 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/703 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/705 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/705 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1/706 variables, 2/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/706 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/706 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/706 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 581 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 283/283 constraints, ReadFeed: 177/177 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 163/180 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/456 variables, 180/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 144/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 78/534 variables, 26/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/538 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/540 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 77/617 variables, 32/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/617 variables, 11/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/617 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/617 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/623 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/623 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/629 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/629 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 52/681 variables, 28/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/681 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/681 variables, 13/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/681 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/682 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/682 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/682 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 3/685 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/685 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 17/702 variables, 11/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/702 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/702 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/702 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/703 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/703 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/703 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/705 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/705 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/706 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/706 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/706 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/706 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 582 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 283/283 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 423/423 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 9 place count 283 transition count 414
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 274 transition count 414
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 274 transition count 407
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 267 transition count 407
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 259 transition count 399
Renaming transitions due to excessive name length > 1024 char.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 253 transition count 406
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 246 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 245 transition count 399
Applied a total of 68 rules in 41 ms. Remains 245 /283 variables (removed 38) and now considering 399/423 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 245/283 places, 399/423 transitions.
RANDOM walk for 34154 steps (15 resets) in 262 ms. (129 steps per ms) remains 0/1 properties
[2024-05-30 14:50:07] [INFO ] Flatten gal took : 39 ms
[2024-05-30 14:50:07] [INFO ] Flatten gal took : 40 ms
[2024-05-30 14:50:08] [INFO ] Input system was already deterministic with 1215 transitions.
Computed a total of 370 stabilizing places and 370 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1174 transition count 1174
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Applied a total of 86 rules in 117 ms. Remains 1172 /1215 variables (removed 43) and now considering 1172/1215 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 1172/1215 places, 1172/1215 transitions.
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 32 ms
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 33 ms
[2024-05-30 14:50:08] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1214 transition count 884
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 884 transition count 884
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 660 place count 884 transition count 664
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 1100 place count 664 transition count 664
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1131 place count 633 transition count 633
Iterating global reduction 2 with 31 rules applied. Total rules applied 1162 place count 633 transition count 633
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1162 place count 633 transition count 607
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1214 place count 607 transition count 607
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 236
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1686 place count 371 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1687 place count 371 transition count 370
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1689 place count 370 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1691 place count 368 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1692 place count 367 transition count 367
Applied a total of 1692 rules in 102 ms. Remains 367 /1215 variables (removed 848) and now considering 367/1215 (removed 848) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 367/1215 places, 367/1215 transitions.
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:50:08] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1214 transition count 880
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 880 transition count 880
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 668 place count 880 transition count 661
Deduced a syphon composed of 219 places in 0 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1106 place count 661 transition count 661
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1138 place count 629 transition count 629
Iterating global reduction 2 with 32 rules applied. Total rules applied 1170 place count 629 transition count 629
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 1170 place count 629 transition count 602
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 1224 place count 602 transition count 602
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1700 place count 364 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 364 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1703 place count 363 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1705 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1706 place count 360 transition count 360
Applied a total of 1706 rules in 93 ms. Remains 360 /1215 variables (removed 855) and now considering 360/1215 (removed 855) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 360/1215 places, 360/1215 transitions.
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:50:08] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:50:08] [INFO ] Input system was already deterministic with 360 transitions.
RANDOM walk for 40000 steps (8 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9196 steps, run visited all 1 properties in 46 ms. (steps per millisecond=199 )
Probabilistic random walk after 9196 steps, saw 7109 distinct states, run finished after 49 ms. (steps per millisecond=187 ) properties seen :1
FORMULA ShieldRVt-PT-030B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1173 transition count 1173
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1171 transition count 1171
Applied a total of 88 rules in 108 ms. Remains 1171 /1215 variables (removed 44) and now considering 1171/1215 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1171/1215 places, 1171/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 28 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 29 ms
[2024-05-30 14:50:09] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 112 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 27 ms
[2024-05-30 14:50:09] [INFO ] Input system was already deterministic with 1174 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1214 transition count 879
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 879 transition count 879
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 670 place count 879 transition count 660
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1108 place count 660 transition count 660
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1139 place count 629 transition count 629
Iterating global reduction 2 with 31 rules applied. Total rules applied 1170 place count 629 transition count 629
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1170 place count 629 transition count 603
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1222 place count 603 transition count 603
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1700 place count 364 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1701 place count 364 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1703 place count 363 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1705 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1706 place count 360 transition count 360
Applied a total of 1706 rules in 82 ms. Remains 360 /1215 variables (removed 855) and now considering 360/1215 (removed 855) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 360/1215 places, 360/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:50:09] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 1173 transition count 1173
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 1171 transition count 1171
Applied a total of 88 rules in 107 ms. Remains 1171 /1215 variables (removed 44) and now considering 1171/1215 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 1171/1215 places, 1171/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:50:09] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 113 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:50:09] [INFO ] Input system was already deterministic with 1174 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 1214 transition count 881
Reduce places removed 333 places and 0 transitions.
Iterating post reduction 1 with 333 rules applied. Total rules applied 666 place count 881 transition count 881
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 666 place count 881 transition count 664
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1100 place count 664 transition count 664
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1131 place count 633 transition count 633
Iterating global reduction 2 with 31 rules applied. Total rules applied 1162 place count 633 transition count 633
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 1162 place count 633 transition count 606
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 1216 place count 606 transition count 606
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1692 place count 368 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1693 place count 368 transition count 367
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1695 place count 367 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 364 transition count 364
Applied a total of 1698 rules in 77 ms. Remains 364 /1215 variables (removed 851) and now considering 364/1215 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 364/1215 places, 364/1215 transitions.
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:50:09] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:50:10] [INFO ] Input system was already deterministic with 364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1178 transition count 1178
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1177 transition count 1177
Applied a total of 76 rules in 80 ms. Remains 1177 /1215 variables (removed 38) and now considering 1177/1215 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 1177/1215 places, 1177/1215 transitions.
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 22 ms
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:50:10] [INFO ] Input system was already deterministic with 1177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1176 transition count 1176
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1175 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 1174 transition count 1174
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 1174 transition count 1174
Applied a total of 82 rules in 129 ms. Remains 1174 /1215 variables (removed 41) and now considering 1174/1215 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 1174/1215 places, 1174/1215 transitions.
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:50:10] [INFO ] Input system was already deterministic with 1174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1179 transition count 1179
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1179 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1178 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1177 transition count 1177
Applied a total of 76 rules in 105 ms. Remains 1177 /1215 variables (removed 38) and now considering 1177/1215 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 1177/1215 places, 1177/1215 transitions.
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 22 ms
[2024-05-30 14:50:10] [INFO ] Input system was already deterministic with 1177 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1215/1215 places, 1215/1215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1214 transition count 880
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 880 transition count 880
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 219 Pre rules applied. Total rules applied 668 place count 880 transition count 661
Deduced a syphon composed of 219 places in 1 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 2 with 438 rules applied. Total rules applied 1106 place count 661 transition count 661
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1137 place count 630 transition count 630
Iterating global reduction 2 with 31 rules applied. Total rules applied 1168 place count 630 transition count 630
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 1168 place count 630 transition count 604
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 1220 place count 604 transition count 604
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1696 place count 366 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 366 transition count 365
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1699 place count 365 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1701 place count 363 transition count 362
Applied a total of 1701 rules in 80 ms. Remains 363 /1215 variables (removed 852) and now considering 362/1215 (removed 853) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 363/1215 places, 362/1215 transitions.
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:50:10] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:50:10] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:50:10] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-30 14:50:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1215 places, 1215 transitions and 2970 arcs took 7 ms.
Total runtime 54549 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVt-PT-030B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1215
TRANSITIONS: 1215
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.006s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 668
MODEL NAME: /home/mcc/execution/414/model
1215 places, 1215 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
MEDDLY ERROR: Insufficient memory
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r355-tall-171683760001001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B 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 '
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 ;