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.r320-tall-171662351900042.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 QuasiCertifProtocol-PT-06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662351900042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K 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 1716751880043

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 19:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-26 19:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 19:31:21] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-26 19:31:21] [INFO ] Transformed 270 places.
[2024-05-26 19:31:21] [INFO ] Transformed 116 transitions.
[2024-05-26 19:31:21] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 153 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 250 transition count 114
Applied a total of 22 rules in 40 ms. Remains 250 /270 variables (removed 20) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 250 cols
[2024-05-26 19:31:21] [INFO ] Computed 138 invariants in 21 ms
[2024-05-26 19:31:21] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-26 19:31:21] [INFO ] Invariant cache hit.
[2024-05-26 19:31:22] [INFO ] Implicit Places using invariants and state equation in 286 ms returned [145, 146, 147, 148, 152, 157, 158]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 685 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 243/270 places, 114/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 745 ms. Remains : 243/270 places, 114/116 transitions.
Discarding 19 transitions out of 114. Remains 95
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (3929 resets) in 2018 ms. (19 steps per ms) remains 73/87 properties
BEST_FIRST walk for 4003 steps (43 resets) in 22 ms. (174 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (41 resets) in 56 ms. (70 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (44 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (41 resets) in 27 ms. (142 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (42 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (42 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (41 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 21 ms. (182 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (43 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (40 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (72 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (63 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (66 resets) in 18 ms. (210 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (67 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (74 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (61 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (67 resets) in 27 ms. (143 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (69 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (70 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (67 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (68 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (71 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (68 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (65 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (68 resets) in 13 ms. (285 steps per ms) remains 73/73 properties
// Phase 1: matrix 114 rows 243 cols
[2024-05-26 19:31:23] [INFO ] Computed 132 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 7/235 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 114/349 variables, 235/367 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 8/357 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/357 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 375 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3536 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 7/235 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 114/349 variables, 235/367 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 73/440 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 8/357 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 448 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5031 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 8684ms problems are : Problem set: 0 solved, 73 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 228 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 114/114 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 243/243 places, 114/114 transitions.
RANDOM walk for 4000000 steps (393367 resets) in 21486 ms. (186 steps per ms) remains 60/73 properties
BEST_FIRST walk for 400003 steps (4342 resets) in 421 ms. (947 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (4345 resets) in 406 ms. (982 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400004 steps (4353 resets) in 382 ms. (1044 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (4342 resets) in 381 ms. (1047 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (4358 resets) in 371 ms. (1075 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (4347 resets) in 363 ms. (1098 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (4362 resets) in 362 ms. (1101 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4352 resets) in 371 ms. (1075 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4347 resets) in 363 ms. (1098 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4347 resets) in 375 ms. (1063 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4350 resets) in 375 ms. (1063 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4360 resets) in 374 ms. (1066 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4353 resets) in 371 ms. (1075 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4340 resets) in 373 ms. (1069 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4350 resets) in 371 ms. (1075 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4358 resets) in 370 ms. (1078 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4354 resets) in 375 ms. (1063 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4359 resets) in 379 ms. (1052 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4353 resets) in 376 ms. (1061 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4341 resets) in 374 ms. (1066 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4337 resets) in 375 ms. (1063 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4342 resets) in 385 ms. (1036 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4341 resets) in 426 ms. (936 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4349 resets) in 390 ms. (1023 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4345 resets) in 368 ms. (1084 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4353 resets) in 372 ms. (1072 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (4353 resets) in 373 ms. (1069 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (4358 resets) in 367 ms. (1086 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7047 resets) in 506 ms. (788 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7049 resets) in 504 ms. (792 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7034 resets) in 500 ms. (798 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7051 resets) in 484 ms. (824 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7090 resets) in 491 ms. (813 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7095 resets) in 515 ms. (775 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7079 resets) in 498 ms. (801 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7042 resets) in 501 ms. (796 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7060 resets) in 498 ms. (801 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7063 resets) in 517 ms. (772 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7072 resets) in 507 ms. (787 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7059 resets) in 497 ms. (803 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7098 resets) in 515 ms. (775 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7053 resets) in 510 ms. (782 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400002 steps (7086 resets) in 512 ms. (779 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7031 resets) in 507 ms. (787 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400001 steps (7023 resets) in 518 ms. (770 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7079 resets) in 505 ms. (790 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7099 resets) in 509 ms. (784 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7059 resets) in 493 ms. (809 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7064 resets) in 487 ms. (819 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7080 resets) in 507 ms. (787 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7092 resets) in 467 ms. (854 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400004 steps (7046 resets) in 466 ms. (856 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7075 resets) in 456 ms. (875 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (7111 resets) in 450 ms. (886 steps per ms) remains 58/58 properties
[2024-05-26 19:31:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/213 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 104/317 variables, 213/339 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 32/349 variables, 22/361 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 7/356 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/357 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (OVERLAPS) 0/357 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 375 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3814 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/213 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 104/317 variables, 213/339 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 58/397 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 32/349 variables, 22/419 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 7/356 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 1/357 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/357 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/357 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 357/357 variables, and 433 constraints, problems are : Problem set: 0 solved, 58 unsolved in 7319 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 11181ms problems are : Problem set: 0 solved, 58 unsolved
Fused 58 Parikh solutions to 35 different solutions.
Finished Parikh walk after 1909 steps, including 36 resets, run visited all 1 properties in 6 ms. (steps per millisecond=318 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 58 properties in 728 ms.
Able to resolve query QuasiLiveness after proving 95 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 35147 ms.
ITS solved all properties within timeout

BK_STOP 1716751916313

--------------------
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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r320-tall-171662351900042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;