About the Execution of GreatSPN+red for HealthRecord-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 539.911 | 30637.00 | 83198.00 | 117.60 | F | 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.r188-tall-171640616800488.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 HealthRecord-PT-11, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616800488
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1716475886272
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:51:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:51:27] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 14:51:27] [INFO ] Transformed 159 places.
[2024-05-23 14:51:27] [INFO ] Transformed 334 transitions.
[2024-05-23 14:51:27] [INFO ] Found NUPN structural information;
[2024-05-23 14:51:27] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 173 ms.
Graph (trivial) has 270 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Structural test allowed to assert that 30 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3364 resets) in 2482 ms. (16 steps per ms) remains 66/129 properties
BEST_FIRST walk for 4003 steps (43 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 63/66 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (45 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 56/59 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (46 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (43 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (42 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (42 resets) in 10 ms. (363 steps per ms) remains 54/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 18 ms. (210 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (44 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (44 resets) in 10 ms. (363 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (42 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
[2024-05-23 14:51:28] [INFO ] Flow matrix only has 285 transitions (discarded 17 similar events)
// Phase 1: matrix 285 rows 154 cols
[2024-05-23 14:51:29] [INFO ] Computed 18 invariants in 10 ms
[2024-05-23 14:51:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 43/96 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 58/154 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 58/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 284/438 variables, 154/326 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 1/439 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/439 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 327 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1946 ms.
Refiners :[Domain max(s): 154/154 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 43/96 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 11 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:51:31] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 3 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 58/154 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 58/192 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:32] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 2 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:51:33] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:34] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 15/247 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-23 14:51:35] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:51:36] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
SMT process timed out in 7025ms, After SMT, problems are : Problem set: 0 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 154 transition count 282
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 152 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 152 transition count 278
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 149 transition count 278
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 78 place count 100 transition count 180
Iterating global reduction 2 with 49 rules applied. Total rules applied 127 place count 100 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 95 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 95 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 145 place count 95 transition count 162
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 159 place count 88 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 164 place count 88 transition count 191
Applied a total of 164 rules in 44 ms. Remains 88 /154 variables (removed 66) and now considering 191/302 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 88/154 places, 191/302 transitions.
RANDOM walk for 4000000 steps (927201 resets) in 19879 ms. (201 steps per ms) remains 34/53 properties
BEST_FIRST walk for 400003 steps (12987 resets) in 349 ms. (1142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13004 resets) in 342 ms. (1166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12952 resets) in 342 ms. (1166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13006 resets) in 338 ms. (1179 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12966 resets) in 344 ms. (1159 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13018 resets) in 343 ms. (1162 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13012 resets) in 343 ms. (1162 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12940 resets) in 342 ms. (1166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12977 resets) in 339 ms. (1176 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13042 resets) in 348 ms. (1146 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13034 resets) in 349 ms. (1142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12928 resets) in 352 ms. (1133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12933 resets) in 344 ms. (1159 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13053 resets) in 349 ms. (1142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13020 resets) in 354 ms. (1126 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12976 resets) in 349 ms. (1142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (12959 resets) in 349 ms. (1142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12942 resets) in 371 ms. (1075 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (13014 resets) in 347 ms. (1149 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12948 resets) in 341 ms. (1169 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12936 resets) in 519 ms. (769 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12923 resets) in 338 ms. (1179 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12947 resets) in 343 ms. (1162 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12945 resets) in 345 ms. (1156 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12970 resets) in 358 ms. (1114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13024 resets) in 337 ms. (1183 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12881 resets) in 334 ms. (1194 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (12980 resets) in 336 ms. (1186 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (13030 resets) in 332 ms. (1201 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (12995 resets) in 331 ms. (1204 steps per ms) remains 30/34 properties
BEST_FIRST walk for 400003 steps (13008 resets) in 329 ms. (1212 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (13057 resets) in 419 ms. (952 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12994 resets) in 433 ms. (921 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12994 resets) in 614 ms. (650 steps per ms) remains 30/30 properties
[2024-05-23 14:51:45] [INFO ] Flow matrix only has 176 transitions (discarded 15 similar events)
// Phase 1: matrix 176 rows 88 cols
[2024-05-23 14:51:45] [INFO ] Computed 17 invariants in 2 ms
[2024-05-23 14:51:45] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 34/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 24/88 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 176/264 variables, 88/105 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 119 constraints, problems are : Problem set: 0 solved, 30 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 34/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 24/88 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:51:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-23 14:51:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:51:48] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:51:49] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/88 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (OVERLAPS) 176/264 variables, 88/174 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 14/188 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 30/218 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-23 14:51:50] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/264 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/264 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 22 (OVERLAPS) 0/264 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 219 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5003 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 88/88 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 70/70 constraints]
After SMT, in 5526ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 22 different solutions.
Parikh walk visited 27 properties in 1529 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 191/191 transitions.
Graph (complete) has 444 edges and 88 vertex of which 79 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 79 transition count 187
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 75 transition count 186
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 37 place count 48 transition count 132
Iterating global reduction 2 with 27 rules applied. Total rules applied 64 place count 48 transition count 132
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 44 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 44 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 41 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 41 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 38 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 38 transition count 106
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 100 place count 38 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 37 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 36 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 36 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 108 place count 34 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 34 transition count 94
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 34 transition count 171
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 116 place count 33 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 32 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 32 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 31 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 31 transition count 123
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 132 place count 31 transition count 111
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 140 place count 31 transition count 111
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 147 place count 31 transition count 111
Applied a total of 147 rules in 43 ms. Remains 31 /88 variables (removed 57) and now considering 111/191 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 31/88 places, 111/191 transitions.
RANDOM walk for 3296865 steps (772902 resets) in 13449 ms. (245 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 131 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 29430 ms.
ITS solved all properties within timeout
BK_STOP 1716475916909
--------------------
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 StableMarking -timeout 180 -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="HealthRecord-PT-11"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 HealthRecord-PT-11, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-tall-171640616800488"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;