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.r534-smll-171683819200022.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d0m64, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819200022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 19:30 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 1717247923226

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:18:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:18:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:18:45] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-01 13:18:46] [INFO ] Transformed 262 places.
[2024-06-01 13:18:46] [INFO ] Transformed 73 transitions.
[2024-06-01 13:18:46] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 386 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 44 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-06-01 13:18:46] [INFO ] Computed 5 invariants in 28 ms
[2024-06-01 13:18:46] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 13:18:46] [INFO ] Invariant cache hit.
[2024-06-01 13:18:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:18:47] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:18:47] [INFO ] Invariant cache hit.
[2024-06-01 13:18:47] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
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-06-01 13:18:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 17 ms to minimize.
[2024-06-01 13:18:48] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 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
[2024-06-01 13:18:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3412 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]
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, 3/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (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 3621 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 7310ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7334ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 8361 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 (8932 resets) in 4253 ms. (9 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4003 steps (187 resets) in 61 ms. (64 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (187 resets) in 65 ms. (60 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (182 resets) in 70 ms. (56 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (194 resets) in 54 ms. (72 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (207 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (190 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (193 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (192 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (186 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (205 resets) in 13 ms. (285 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4001 steps (194 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (183 resets) in 13 ms. (285 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4002 steps (184 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (200 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (196 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (176 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (183 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (191 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (193 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (191 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (197 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (409 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (384 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (420 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (408 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (421 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (408 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (405 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (409 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (396 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (398 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (397 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (403 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (415 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (418 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
[2024-06-01 13:18:56] [INFO ] Invariant cache hit.
[2024-06-01 13:18:56] [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 1280 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 2412 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 3748ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 32 different solutions.
Parikh walk visited 14 properties in 6524 ms.
Support contains 28 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 63 transition count 65
Applied a total of 15 rules in 29 ms. Remains 63 /70 variables (removed 7) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 63/70 places, 65/73 transitions.
RANDOM walk for 4000000 steps (894831 resets) in 22312 ms. (179 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (19314 resets) in 746 ms. (535 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (19168 resets) in 648 ms. (616 steps per ms) remains 18/21 properties
BEST_FIRST walk for 400001 steps (19366 resets) in 904 ms. (441 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19334 resets) in 759 ms. (526 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19319 resets) in 844 ms. (473 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19320 resets) in 742 ms. (538 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (19249 resets) in 774 ms. (516 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19189 resets) in 771 ms. (518 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19333 resets) in 761 ms. (524 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19288 resets) in 651 ms. (613 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1011 ms. (395 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (42098 resets) in 832 ms. (480 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41158 resets) in 828 ms. (482 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (40703 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41231 resets) in 841 ms. (475 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41254 resets) in 805 ms. (496 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41315 resets) in 830 ms. (481 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (40899 resets) in 814 ms. (490 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41328 resets) in 797 ms. (501 steps per ms) remains 18/18 properties
// Phase 1: matrix 65 rows 63 cols
[2024-06-01 13:19:19] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 13:19:19] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 32/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 64/125 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 3/128 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 95 constraints, problems are : Problem set: 0 solved, 18 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 32/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 64/125 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 3/128 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 18 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1516ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1174 ms.
Support contains 24 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 64
Applied a total of 2 rules in 12 ms. Remains 62 /63 variables (removed 1) and now considering 64/65 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/63 places, 64/65 transitions.
RANDOM walk for 4000000 steps (895315 resets) in 16530 ms. (241 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19344 resets) in 1006 ms. (397 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19270 resets) in 670 ms. (596 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19280 resets) in 672 ms. (594 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19251 resets) in 664 ms. (601 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19171 resets) in 676 ms. (590 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19237 resets) in 680 ms. (587 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19236 resets) in 719 ms. (555 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19243 resets) in 636 ms. (627 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19295 resets) in 630 ms. (633 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 999 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (42060 resets) in 802 ms. (498 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (40904 resets) in 860 ms. (464 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (41400 resets) in 853 ms. (468 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41326 resets) in 841 ms. (475 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (41192 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41197 resets) in 835 ms. (478 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41009 resets) in 834 ms. (479 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41105 resets) in 824 ms. (484 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 1607 steps, run visited all 18 properties in 30 ms. (steps per millisecond=53 )
Probabilistic random walk after 1607 steps, saw 842 distinct states, run finished after 39 ms. (steps per millisecond=41 ) properties seen :18
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 46022 ms.
ITS solved all properties within timeout

BK_STOP 1717247971677

--------------------
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-d0m64"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d0m64, 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 r534-smll-171683819200022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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