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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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 1717362233200

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:03:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 21:03:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:54] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 21:03:54] [INFO ] Transformed 428 places.
[2024-06-02 21:03:54] [INFO ] Transformed 656 transitions.
[2024-06-02 21:03:54] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:54] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 200 ms.
Graph (trivial) has 356 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 13 ms
Free SCC test removed 16 places
Structural test allowed to assert that 99 places are NOT stable. Took 35 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (578 resets) in 2105 ms. (18 steps per ms) remains 239/329 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 239/239 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 239/239 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
[2024-06-02 21:03:55] [INFO ] Flow matrix only has 637 transitions (discarded 2 similar events)
// Phase 1: matrix 637 rows 412 cols
[2024-06-02 21:03:55] [INFO ] Computed 9 invariants in 18 ms
[2024-06-02 21:03:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 119/358 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 119/365 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1049 variables, and 365 constraints, problems are : Problem set: 0 solved, 239 unsolved in 5061 ms.
Refiners :[Domain max(s): 358/412 constraints, Positive P Invariants (semi-flows): 7/9 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 119/358 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 119/365 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-06-02 21:04:02] [INFO ] Deduced a trap composed of 123 places in 226 ms of which 28 ms to minimize.
[2024-06-02 21:04:02] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 3 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 3 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 185 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 106 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 103 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:04:03] [INFO ] Deduced a trap composed of 118 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 115 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 104 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:04:04] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 106 places in 63 ms of which 2 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 118 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 115 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:04:05] [INFO ] Deduced a trap composed of 104 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1049 variables, and 383 constraints, problems are : Problem set: 0 solved, 239 unsolved in 5028 ms.
Refiners :[Domain max(s): 358/412 constraints, Positive P Invariants (semi-flows): 7/9 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/239 constraints, Known Traps: 18/18 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 239 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 239 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 639/639 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 406 transition count 567
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 70 rules applied. Total rules applied 143 place count 339 transition count 564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 145 place count 337 transition count 564
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 145 place count 337 transition count 558
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 157 place count 331 transition count 558
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 166 place count 322 transition count 549
Iterating global reduction 3 with 9 rules applied. Total rules applied 175 place count 322 transition count 549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 322 transition count 547
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 177 place count 322 transition count 546
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 321 transition count 546
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 223 place count 299 transition count 524
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 235 place count 293 transition count 527
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 248 place count 293 transition count 514
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 261 place count 280 transition count 514
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 280 transition count 514
Applied a total of 263 rules in 103 ms. Remains 280 /412 variables (removed 132) and now considering 514/639 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 280/412 places, 514/639 transitions.
RANDOM walk for 4000000 steps (268626 resets) in 34198 ms. (116 steps per ms) remains 64/239 properties
BEST_FIRST walk for 400002 steps (6344 resets) in 651 ms. (613 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (6421 resets) in 637 ms. (626 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6334 resets) in 634 ms. (629 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (6290 resets) in 673 ms. (593 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6375 resets) in 654 ms. (610 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6318 resets) in 619 ms. (645 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (6302 resets) in 622 ms. (642 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (6351 resets) in 626 ms. (637 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6318 resets) in 680 ms. (587 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6349 resets) in 666 ms. (599 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (6365 resets) in 637 ms. (626 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (6353 resets) in 638 ms. (625 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (6292 resets) in 626 ms. (637 steps per ms) remains 59/64 properties
BEST_FIRST walk for 400002 steps (6367 resets) in 605 ms. (660 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (6304 resets) in 610 ms. (654 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (6322 resets) in 609 ms. (655 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (6416 resets) in 604 ms. (661 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (6304 resets) in 612 ms. (652 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (6354 resets) in 606 ms. (658 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (6338 resets) in 686 ms. (582 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (6304 resets) in 629 ms. (634 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (6387 resets) in 607 ms. (657 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (6266 resets) in 600 ms. (665 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (6331 resets) in 597 ms. (668 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400004 steps (6327 resets) in 596 ms. (670 steps per ms) remains 55/58 properties
BEST_FIRST walk for 400003 steps (6291 resets) in 576 ms. (693 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6352 resets) in 583 ms. (684 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6363 resets) in 592 ms. (674 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400001 steps (6337 resets) in 602 ms. (663 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6249 resets) in 611 ms. (653 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400004 steps (6381 resets) in 599 ms. (666 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (6351 resets) in 596 ms. (670 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400002 steps (6337 resets) in 612 ms. (652 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (6341 resets) in 603 ms. (662 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400003 steps (6334 resets) in 587 ms. (680 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (6345 resets) in 1089 ms. (366 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (6297 resets) in 618 ms. (646 steps per ms) remains 51/54 properties
BEST_FIRST walk for 400003 steps (6326 resets) in 578 ms. (690 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (6328 resets) in 585 ms. (682 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400002 steps (6309 resets) in 579 ms. (689 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (6311 resets) in 579 ms. (689 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (6379 resets) in 580 ms. (688 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (6318 resets) in 574 ms. (695 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (6410 resets) in 587 ms. (680 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400004 steps (6335 resets) in 581 ms. (687 steps per ms) remains 49/51 properties
BEST_FIRST walk for 400004 steps (6370 resets) in 575 ms. (694 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (6320 resets) in 553 ms. (722 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400001 steps (6284 resets) in 548 ms. (728 steps per ms) remains 45/49 properties
BEST_FIRST walk for 400002 steps (6350 resets) in 544 ms. (733 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (6358 resets) in 548 ms. (728 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (6382 resets) in 556 ms. (718 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (6322 resets) in 551 ms. (724 steps per ms) remains 45/45 properties
// Phase 1: matrix 514 rows 280 cols
[2024-06-02 21:04:26] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 21:04:26] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 203/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 28/276 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 514/790 variables, 276/283 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 26/309 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 4/794 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/794 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 313 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 280/280 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 203/248 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 104 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 102 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 104 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:04:28] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 1 ms to minimize.
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 92 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 104 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 28/276 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 104 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:04:29] [INFO ] Deduced a trap composed of 104 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 514/790 variables, 276/291 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 26/317 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 45/362 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:30] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:04:31] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:04:31] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:04:31] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:04:31] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:31] [INFO ] Deduced a trap composed of 193 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:04:32] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/790 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:32] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/790 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 21:04:34] [INFO ] Deduced a trap composed of 185 places in 91 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/790 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/790 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (OVERLAPS) 4/794 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 375 constraints, problems are : Problem set: 0 solved, 45 unsolved in 9602 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 280/280 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 17/17 constraints]
After SMT, in 11508ms problems are : Problem set: 0 solved, 45 unsolved
Fused 45 Parikh solutions to 43 different solutions.
Parikh walk visited 0 properties in 6671 ms.
Support contains 45 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 514/514 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 280 transition count 462
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 228 transition count 462
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 104 place count 228 transition count 459
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 225 transition count 459
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 211 transition count 444
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 211 transition count 444
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 178 place count 211 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 178 place count 211 transition count 401
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 184 place count 208 transition count 401
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 187 place count 205 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 190 place count 205 transition count 398
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 205 transition count 394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 203 transition count 394
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 242 place count 180 transition count 371
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 284 place count 159 transition count 446
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 296 place count 159 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 348 place count 159 transition count 382
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 356 place count 159 transition count 374
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 364 place count 151 transition count 374
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 367 place count 151 transition count 464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 370 place count 148 transition count 464
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 148 transition count 464
Applied a total of 371 rules in 97 ms. Remains 148 /280 variables (removed 132) and now considering 464/514 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 148/280 places, 464/514 transitions.
RANDOM walk for 4000000 steps (164398 resets) in 14644 ms. (273 steps per ms) remains 0/45 properties
Able to resolve query StableMarking after proving 331 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 54450 ms.
ITS solved all properties within timeout

BK_STOP 1717362288776

--------------------
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-17"
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-17, 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-171734907800188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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