fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r386-smll-171683818400017
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d0m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
630.451 51617.00 144732.00 194.90 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.r386-smll-171683818400017.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 SieveSingleMsgMbox-PT-d0m36, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r386-smll-171683818400017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716891605031

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:20:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 10:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:20:07] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-28 10:20:07] [INFO ] Transformed 262 places.
[2024-05-28 10:20:07] [INFO ] Transformed 73 transitions.
[2024-05-28 10:20:07] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 296 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 37 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-05-28 10:20:07] [INFO ] Computed 5 invariants in 22 ms
[2024-05-28 10:20:08] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-28 10:20:08] [INFO ] Invariant cache hit.
[2024-05-28 10:20:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 10:20:08] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-28 10:20:08] [INFO ] Invariant cache hit.
[2024-05-28 10:20:08] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 10:20:09] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 31 ms to minimize.
[2024-05-28 10:20:10] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 108 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 10:20:13] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 181 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
After SMT, in 8580ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 8606ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 9528 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8913 resets) in 2297 ms. (17 steps per ms) remains 38/62 properties
BEST_FIRST walk for 4002 steps (214 resets) in 190 ms. (20 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (192 resets) in 117 ms. (33 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4004 steps (202 resets) in 164 ms. (24 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (177 resets) in 151 ms. (26 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (201 resets) in 122 ms. (32 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (176 resets) in 114 ms. (34 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (206 resets) in 60 ms. (65 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (178 resets) in 63 ms. (62 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (196 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (209 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (188 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (188 resets) in 40 ms. (97 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (168 resets) in 49 ms. (80 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (209 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (215 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (187 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (203 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (190 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (200 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (202 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 70 ms. (56 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (420 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (416 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (413 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (426 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (383 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (405 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (438 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (404 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (418 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (358 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (414 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (415 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (430 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (402 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
[2024-05-28 10:20:18] [INFO ] Invariant cache hit.
[2024-05-28 10:20:18] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/143 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 141 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 3061ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 30 different solutions.
Parikh walk visited 4 properties in 7504 ms.
Support contains 38 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 19 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 4000000 steps (894900 resets) in 19600 ms. (204 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (19379 resets) in 722 ms. (553 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (19275 resets) in 746 ms. (535 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (19336 resets) in 728 ms. (548 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400002 steps (19288 resets) in 715 ms. (558 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (19373 resets) in 742 ms. (538 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (19175 resets) in 809 ms. (493 steps per ms) remains 27/30 properties
BEST_FIRST walk for 400001 steps (19264 resets) in 687 ms. (581 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (19253 resets) in 681 ms. (586 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (19413 resets) in 1100 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (19205 resets) in 676 ms. (590 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (19222 resets) in 686 ms. (582 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (19085 resets) in 681 ms. (586 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (18985 resets) in 683 ms. (584 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (19267 resets) in 680 ms. (587 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400003 steps (19270 resets) in 673 ms. (593 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19215 resets) in 669 ms. (597 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19354 resets) in 681 ms. (586 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19319 resets) in 678 ms. (589 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1073 ms. (372 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41193 resets) in 854 ms. (467 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (40828 resets) in 877 ms. (455 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41829 resets) in 884 ms. (451 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (41575 resets) in 879 ms. (454 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41455 resets) in 858 ms. (465 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41302 resets) in 840 ms. (475 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41066 resets) in 870 ms. (459 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41161 resets) in 843 ms. (473 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41292 resets) in 854 ms. (467 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41324 resets) in 847 ms. (471 steps per ms) remains 25/25 properties
// Phase 1: matrix 70 rows 67 cols
[2024-05-28 10:20:41] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 10:20:41] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 30/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 10:20:42] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 69/134 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/137 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/137 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 103 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 30/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 69/134 variables, 65/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 3/137 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 15/128 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 0/137 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 128 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 3145ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 5 properties in 1410 ms.
Support contains 26 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 62 transition count 64
Applied a total of 11 rules in 17 ms. Remains 62 /67 variables (removed 5) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 62/67 places, 64/70 transitions.
RANDOM walk for 4000000 steps (895103 resets) in 18182 ms. (219 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19351 resets) in 687 ms. (581 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19287 resets) in 689 ms. (579 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19303 resets) in 691 ms. (578 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19290 resets) in 692 ms. (577 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19227 resets) in 677 ms. (589 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19310 resets) in 683 ms. (584 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19267 resets) in 677 ms. (589 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19123 resets) in 682 ms. (585 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19250 resets) in 683 ms. (584 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19211 resets) in 675 ms. (591 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19240 resets) in 681 ms. (586 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1064 ms. (375 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41750 resets) in 879 ms. (454 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41287 resets) in 857 ms. (466 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (40998 resets) in 864 ms. (462 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41235 resets) in 879 ms. (454 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41317 resets) in 879 ms. (454 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41049 resets) in 890 ms. (448 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41096 resets) in 873 ms. (457 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41302 resets) in 871 ms. (458 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 1607 steps, run visited all 20 properties in 25 ms. (steps per millisecond=64 )
Probabilistic random walk after 1607 steps, saw 842 distinct states, run finished after 31 ms. (steps per millisecond=51 ) properties seen :20
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 49479 ms.
ITS solved all properties within timeout

BK_STOP 1716891656648

--------------------
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 QuasiLiveness -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="SieveSingleMsgMbox-PT-d0m36"
export BK_EXAMINATION="QuasiLiveness"
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 SieveSingleMsgMbox-PT-d0m36, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r386-smll-171683818400017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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