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.r564-tall-171734907700153.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 FireWire-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907700153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 101K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717361760198

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:56:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:56:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:56:01] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 20:56:01] [INFO ] Transformed 131 places.
[2024-06-02 20:56:01] [INFO ] Transformed 409 transitions.
[2024-06-02 20:56:01] [INFO ] Found NUPN structural information;
[2024-06-02 20:56:01] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 186 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 8 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2237 resets) in 2383 ms. (16 steps per ms) remains 54/121 properties
BEST_FIRST walk for 4002 steps (52 resets) in 74 ms. (53 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (46 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (62 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (53 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (34 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (54 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (49 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (48 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (44 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (67 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (52 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (52 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (72 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (55 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (43 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (56 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (68 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (51 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (63 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (74 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (64 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (61 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (53 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (59 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (52 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (69 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (68 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (53 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (64 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (59 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (57 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (64 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (55 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (61 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (65 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (46 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (59 resets) in 10 ms. (364 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (71 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (64 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (65 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 54/54 properties
[2024-06-02 20:56:02] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2024-06-02 20:56:02] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 20:56:02] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 71/125 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 71/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 4/129 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 320/449 variables, 129/266 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 44/310 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 2/451 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 1/452 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 16 (OVERLAPS) 0/452 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 315 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2612 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 71/125 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 71/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 20:56:05] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 14 ms to minimize.
[2024-06-02 20:56:05] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 4/129 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 20:56:06] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 20:56:07] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 320/449 variables, 129/276 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 44/320 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 54/374 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-02 20:56:08] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 16 (OVERLAPS) 2/451 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 19 (OVERLAPS) 1/452 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 380 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5015 ms.
Refiners :[Domain max(s): 131/131 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 131/131 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 11/11 constraints]
After SMT, in 7716ms problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 129 transition count 346
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 129 transition count 346
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 129 transition count 344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 127 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 127 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 127 transition count 336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 126 transition count 335
Applied a total of 26 rules in 87 ms. Remains 126 /131 variables (removed 5) and now considering 335/353 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 126/131 places, 335/353 transitions.
RANDOM walk for 4000000 steps (230990 resets) in 20638 ms. (193 steps per ms) remains 28/54 properties
BEST_FIRST walk for 400003 steps (5682 resets) in 934 ms. (427 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5632 resets) in 687 ms. (581 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5552 resets) in 671 ms. (595 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (5637 resets) in 678 ms. (589 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5672 resets) in 892 ms. (447 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5501 resets) in 634 ms. (629 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (5654 resets) in 675 ms. (591 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5679 resets) in 731 ms. (546 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5833 resets) in 687 ms. (581 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5866 resets) in 656 ms. (608 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (5726 resets) in 621 ms. (643 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (5755 resets) in 658 ms. (606 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5552 resets) in 707 ms. (564 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5688 resets) in 553 ms. (722 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5714 resets) in 498 ms. (801 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5632 resets) in 486 ms. (821 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5623 resets) in 493 ms. (809 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5659 resets) in 474 ms. (842 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5678 resets) in 469 ms. (851 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5537 resets) in 476 ms. (838 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5643 resets) in 464 ms. (860 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5599 resets) in 455 ms. (877 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5531 resets) in 471 ms. (847 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5609 resets) in 489 ms. (816 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5620 resets) in 530 ms. (753 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5593 resets) in 533 ms. (749 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5599 resets) in 505 ms. (790 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5616 resets) in 512 ms. (779 steps per ms) remains 27/27 properties
[2024-06-02 20:56:22] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
// Phase 1: matrix 309 rows 126 cols
[2024-06-02 20:56:22] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:56:22] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 58/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 233/318 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 69/387 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 33/139 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/388 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 45/433 variables, 22/163 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 12/176 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 2/435 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 0/435 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 179 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 58/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:56:23] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 233/318 variables, 85/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 69/387 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 33/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 25/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 45/433 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 2/435 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 23 (OVERLAPS) 0/435 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 211 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints]
After SMT, in 3346ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1547 ms.
Support contains 27 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 335/335 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 337
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 334
Applied a total of 5 rules in 36 ms. Remains 125 /126 variables (removed 1) and now considering 334/335 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 125/126 places, 334/335 transitions.
RANDOM walk for 4000000 steps (231858 resets) in 17361 ms. (230 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5584 resets) in 477 ms. (836 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5655 resets) in 494 ms. (808 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5611 resets) in 481 ms. (829 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5755 resets) in 472 ms. (845 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5787 resets) in 467 ms. (854 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5640 resets) in 463 ms. (862 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5727 resets) in 455 ms. (877 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5654 resets) in 459 ms. (869 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5694 resets) in 455 ms. (877 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5478 resets) in 462 ms. (863 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5746 resets) in 478 ms. (835 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5673 resets) in 474 ms. (842 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5471 resets) in 475 ms. (840 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (5629 resets) in 471 ms. (847 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5666 resets) in 469 ms. (851 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5694 resets) in 465 ms. (858 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5695 resets) in 469 ms. (851 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5591 resets) in 471 ms. (847 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5572 resets) in 461 ms. (865 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5755 resets) in 472 ms. (845 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5756 resets) in 458 ms. (871 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5710 resets) in 481 ms. (829 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5651 resets) in 476 ms. (838 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5642 resets) in 480 ms. (831 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5574 resets) in 491 ms. (813 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5688 resets) in 468 ms. (852 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5605 resets) in 475 ms. (840 steps per ms) remains 27/27 properties
Finished probabilistic random walk after 5434280 steps, run visited all 27 properties in 17384 ms. (steps per millisecond=312 )
Probabilistic random walk after 5434280 steps, saw 1143810 distinct states, run finished after 17392 ms. (steps per millisecond=312 ) properties seen :27
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 52487 ms.
ITS solved all properties within timeout

BK_STOP 1717361813950

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-10"
export BK_EXAMINATION="StableMarking"
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 FireWire-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r564-tall-171734907700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;