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.r586-smll-171734923700018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r586-smll-171734923700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717351671620

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:07:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:07:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:07:53] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 18:07:53] [INFO ] Transformed 115 places.
[2024-06-02 18:07:53] [INFO ] Transformed 107 transitions.
[2024-06-02 18:07:53] [INFO ] Found NUPN structural information;
[2024-06-02 18:07:53] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 273 ms.
Structural test allowed to assert that 32 places are NOT stable. Took 10 ms.
RANDOM walk for 40000 steps (1121 resets) in 2493 ms. (16 steps per ms) remains 29/83 properties
BEST_FIRST walk for 4002 steps (22 resets) in 77 ms. (51 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (28 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (31 resets) in 62 ms. (63 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (29 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (30 resets) in 65 ms. (60 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 43 ms. (91 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (27 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 53 ms. (74 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (26 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (27 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (29 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (23 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
// Phase 1: matrix 107 rows 115 cols
[2024-06-02 18:07:55] [INFO ] Computed 9 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 51/80 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 107/222 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 239 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1223 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 51/80 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 51/85 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:07:56] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 24 ms to minimize.
[2024-06-02 18:07:56] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
[2024-06-02 18:07:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 35/115 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 35/127 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 107/222 variables, 115/243 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 29/272 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:07:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:07:58] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:07:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-06-02 18:07:58] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/222 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 277 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3167 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 9/9 constraints]
After SMT, in 4462ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 3000 ms.
Support contains 29 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 115 transition count 84
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 92 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 92 transition count 78
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 86 transition count 78
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 79 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 79 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 79 transition count 70
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 108 place count 61 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 61 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 60 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 59 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 58 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 58 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 57 transition count 50
Applied a total of 114 rules in 66 ms. Remains 57 /115 variables (removed 58) and now considering 50/107 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 57/115 places, 50/107 transitions.
RANDOM walk for 4000000 steps (436599 resets) in 19164 ms. (208 steps per ms) remains 22/29 properties
BEST_FIRST walk for 400003 steps (20750 resets) in 935 ms. (427 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400002 steps (21000 resets) in 987 ms. (404 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (20871 resets) in 902 ms. (442 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20716 resets) in 888 ms. (449 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20866 resets) in 897 ms. (445 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20878 resets) in 902 ms. (442 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20606 resets) in 898 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20919 resets) in 903 ms. (442 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20706 resets) in 875 ms. (456 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20883 resets) in 919 ms. (434 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20694 resets) in 892 ms. (447 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20632 resets) in 889 ms. (449 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20891 resets) in 915 ms. (436 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (20958 resets) in 892 ms. (447 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20818 resets) in 885 ms. (451 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20871 resets) in 889 ms. (449 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20713 resets) in 885 ms. (451 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20654 resets) in 873 ms. (457 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20821 resets) in 887 ms. (450 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20856 resets) in 882 ms. (453 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20927 resets) in 885 ms. (451 steps per ms) remains 21/21 properties
// Phase 1: matrix 50 rows 57 cols
[2024-06-02 18:08:13] [INFO ] Computed 8 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 35/71 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 14/85 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 15/102 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 1/103 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 4/107 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 15/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 35/71 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 14/85 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/87 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 15/102 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 1/103 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/103 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/103 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 4/107 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/107 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/107 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 90 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 2015ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 724 ms.
Support contains 21 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 48
Applied a total of 4 rules in 16 ms. Remains 55 /57 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 55/57 places, 48/50 transitions.
RANDOM walk for 4000000 steps (436169 resets) in 19907 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20884 resets) in 1106 ms. (361 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20984 resets) in 1027 ms. (389 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (20800 resets) in 894 ms. (446 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20739 resets) in 886 ms. (450 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20722 resets) in 866 ms. (461 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20751 resets) in 876 ms. (456 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20925 resets) in 920 ms. (434 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20788 resets) in 943 ms. (423 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20769 resets) in 958 ms. (417 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20842 resets) in 921 ms. (433 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20770 resets) in 957 ms. (417 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20826 resets) in 930 ms. (429 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20905 resets) in 964 ms. (414 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20917 resets) in 855 ms. (467 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20824 resets) in 850 ms. (470 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400001 steps (20871 resets) in 853 ms. (468 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20732 resets) in 887 ms. (450 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (20627 resets) in 842 ms. (474 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20850 resets) in 847 ms. (471 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (20801 resets) in 851 ms. (469 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (20822 resets) in 887 ms. (450 steps per ms) remains 21/21 properties
Finished probabilistic random walk after 2356 steps, run visited all 21 properties in 43 ms. (steps per millisecond=54 )
Probabilistic random walk after 2356 steps, saw 1165 distinct states, run finished after 51 ms. (steps per millisecond=46 ) properties seen :21
Able to resolve query StableMarking after proving 84 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 35498 ms.
ITS solved all properties within timeout

BK_STOP 1717351708926

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r586-smll-171734923700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-04.tgz
mv MedleyA-PT-04 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;