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.r560-tall-171734905800147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717351748155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:09] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:09:09] [INFO ] Transformed 130 places.
[2024-06-02 18:09:09] [INFO ] Transformed 408 transitions.
[2024-06-02 18:09:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:09] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 173 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 130/130 places, 408/408 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 130 transition count 352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 129 transition count 351
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 126 transition count 357
Applied a total of 64 rules in 49 ms. Remains 126 /130 variables (removed 4) and now considering 357/408 (removed 51) transitions.
[2024-06-02 18:09:09] [INFO ] Flow matrix only has 315 transitions (discarded 42 similar events)
// Phase 1: matrix 315 rows 126 cols
[2024-06-02 18:09:09] [INFO ] Computed 8 invariants in 14 ms
[2024-06-02 18:09:09] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-02 18:09:09] [INFO ] Flow matrix only has 315 transitions (discarded 42 similar events)
[2024-06-02 18:09:09] [INFO ] Invariant cache hit.
[2024-06-02 18:09:10] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:09:10] [INFO ] Implicit Places using invariants and state equation in 304 ms returned [13, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 597 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 124/130 places, 357/408 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 357/357 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 669 ms. Remains : 124/130 places, 357/408 transitions.
Discarding 116 transitions out of 357. Remains 241
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2251 resets) in 1912 ms. (20 steps per ms) remains 133/240 properties
BEST_FIRST walk for 403 steps (14 resets) in 45 ms. (8 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 11 ms. (33 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 28 ms. (13 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (11 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (9 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (12 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 13 ms. (28 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (12 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (12 resets) in 29 ms. (13 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (11 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (9 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (11 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (10 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (10 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 8 ms. (44 steps per ms) remains 133/133 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (10 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (10 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (9 resets) in 9 ms. (40 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (12 resets) in 6 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 133/133 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 404 steps (10 resets) in 5 ms. (67 steps per ms) remains 133/133 properties
[2024-06-02 18:09:11] [INFO ] Flow matrix only has 315 transitions (discarded 42 similar events)
// Phase 1: matrix 315 rows 124 cols
[2024-06-02 18:09:11] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 18:09:11] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 36/121 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 36/127 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 18:09:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 14 ms to minimize.
[2024-06-02 18:09:12] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:09:12] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:09:12] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 314/435 variables, 121/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 46/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 3/438 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 133 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 438/439 variables, and 304 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5013 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 46/47 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 36/121 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 36/127 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 314/435 variables, 121/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 46/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 124/422 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 3/438 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SMT process timed out in 10223ms, After SMT, problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 357/357 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 124 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 124 transition count 339
Applied a total of 18 rules in 28 ms. Remains 124 /124 variables (removed 0) and now considering 339/357 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 124/124 places, 339/357 transitions.
RANDOM walk for 4000000 steps (219024 resets) in 30120 ms. (132 steps per ms) remains 65/133 properties
BEST_FIRST walk for 400004 steps (5660 resets) in 682 ms. (585 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (5645 resets) in 698 ms. (572 steps per ms) remains 65/65 properties
BEST_FIRST walk for 400003 steps (331 resets) in 1185 ms. (337 steps per ms) remains 64/65 properties
BEST_FIRST walk for 400004 steps (5468 resets) in 695 ms. (574 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (10833 resets) in 775 ms. (515 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (5806 resets) in 672 ms. (594 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (302 resets) in 724 ms. (551 steps per ms) remains 63/64 properties
BEST_FIRST walk for 400002 steps (5520 resets) in 697 ms. (573 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (10644 resets) in 748 ms. (534 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (5644 resets) in 662 ms. (603 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (364 resets) in 597 ms. (668 steps per ms) remains 59/63 properties
BEST_FIRST walk for 400002 steps (5493 resets) in 694 ms. (575 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400002 steps (10858 resets) in 726 ms. (550 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (5681 resets) in 648 ms. (616 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (493 resets) in 805 ms. (496 steps per ms) remains 54/58 properties
BEST_FIRST walk for 400002 steps (5497 resets) in 668 ms. (597 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (10763 resets) in 740 ms. (539 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5660 resets) in 651 ms. (613 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (315 resets) in 653 ms. (611 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5476 resets) in 618 ms. (646 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (10787 resets) in 711 ms. (561 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (5770 resets) in 643 ms. (621 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (463 resets) in 628 ms. (635 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5518 resets) in 629 ms. (634 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400001 steps (10790 resets) in 721 ms. (554 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5666 resets) in 631 ms. (632 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400004 steps (368 resets) in 600 ms. (665 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400002 steps (5456 resets) in 653 ms. (611 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (10761 resets) in 732 ms. (545 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (5540 resets) in 641 ms. (623 steps per ms) remains 54/54 properties
BEST_FIRST walk for 400003 steps (337 resets) in 583 ms. (684 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400001 steps (5410 resets) in 660 ms. (605 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (10796 resets) in 722 ms. (553 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (5726 resets) in 637 ms. (626 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (415 resets) in 820 ms. (487 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (5477 resets) in 656 ms. (608 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (10773 resets) in 719 ms. (555 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (5865 resets) in 648 ms. (616 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (254 resets) in 1043 ms. (383 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (5436 resets) in 682 ms. (585 steps per ms) remains 51/53 properties
BEST_FIRST walk for 400003 steps (10798 resets) in 714 ms. (559 steps per ms) remains 51/51 properties
BEST_FIRST walk for 400003 steps (575 resets) in 985 ms. (405 steps per ms) remains 43/51 properties
BEST_FIRST walk for 400002 steps (5349 resets) in 596 ms. (670 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (5657 resets) in 598 ms. (667 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (5397 resets) in 576 ms. (693 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (5598 resets) in 586 ms. (681 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (5687 resets) in 598 ms. (667 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (5465 resets) in 588 ms. (679 steps per ms) remains 43/43 properties
[2024-06-02 18:09:42] [INFO ] Flow matrix only has 311 transitions (discarded 28 similar events)
// Phase 1: matrix 311 rows 124 cols
[2024-06-02 18:09:42] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 18:09:42] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 85/120 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 311/431 variables, 120/250 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 46/296 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/435 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/435 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/435 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 304 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2252 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 85/120 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 311/431 variables, 120/250 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 46/296 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 43/339 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-02 18:09:45] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 14 (OVERLAPS) 0/435 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 348 constraints, problems are : Problem set: 0 solved, 43 unsolved in 4456 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 5/5 constraints]
After SMT, in 6755ms problems are : Problem set: 0 solved, 43 unsolved
Parikh walk visited 2 properties in 3204 ms.
Support contains 33 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 339/339 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 335
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 122 transition count 333
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 122 transition count 331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 120 transition count 331
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 119 transition count 330
Applied a total of 11 rules in 42 ms. Remains 119 /124 variables (removed 5) and now considering 330/339 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 119/124 places, 330/339 transitions.
RANDOM walk for 4000000 steps (230691 resets) in 19519 ms. (204 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (5512 resets) in 561 ms. (711 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (709 resets) in 452 ms. (883 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (10958 resets) in 582 ms. (686 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (6016 resets) in 566 ms. (705 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (702 resets) in 457 ms. (873 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (5616 resets) in 552 ms. (723 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (11106 resets) in 594 ms. (672 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (5585 resets) in 540 ms. (739 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (702 resets) in 511 ms. (781 steps per ms) remains 27/41 properties
BEST_FIRST walk for 400004 steps (5813 resets) in 483 ms. (826 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5383 resets) in 530 ms. (753 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5641 resets) in 489 ms. (816 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5394 resets) in 468 ms. (852 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5645 resets) in 466 ms. (856 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5420 resets) in 470 ms. (849 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5823 resets) in 488 ms. (818 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5613 resets) in 499 ms. (800 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5651 resets) in 490 ms. (814 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (710 resets) in 413 ms. (966 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5562 resets) in 492 ms. (811 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (11088 resets) in 530 ms. (753 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5721 resets) in 487 ms. (819 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5536 resets) in 482 ms. (828 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5762 resets) in 492 ms. (811 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (5716 resets) in 474 ms. (842 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5734 resets) in 477 ms. (836 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5596 resets) in 473 ms. (843 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (5853 resets) in 465 ms. (858 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (5530 resets) in 499 ms. (800 steps per ms) remains 27/27 properties
[2024-06-02 18:10:01] [INFO ] Flow matrix only has 302 transitions (discarded 28 similar events)
// Phase 1: matrix 302 rows 119 cols
[2024-06-02 18:10:01] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:10:01] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 78/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 297/405 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 45/159 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 13/418 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/419 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:03] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 2/421 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 0/421 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 173 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 78/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 297/405 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 45/161 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 21/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 13/418 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:05] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 1/419 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:06] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 2/421 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/421 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-06-02 18:10:07] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/421 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/421 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 0/421 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 204 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 7/7 constraints]
After SMT, in 6726ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 0 properties in 1069 ms.
Support contains 30 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 330/330 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 118 transition count 330
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 117 transition count 326
Applied a total of 8 rules in 29 ms. Remains 117 /119 variables (removed 2) and now considering 326/330 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 117/119 places, 326/330 transitions.
RANDOM walk for 4000000 steps (231412 resets) in 16864 ms. (237 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (5692 resets) in 494 ms. (808 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (700 resets) in 401 ms. (995 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (10988 resets) in 511 ms. (781 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5594 resets) in 469 ms. (851 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5709 resets) in 478 ms. (835 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5639 resets) in 487 ms. (819 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5621 resets) in 478 ms. (835 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5690 resets) in 462 ms. (863 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5641 resets) in 462 ms. (863 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5621 resets) in 455 ms. (877 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5500 resets) in 466 ms. (856 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5552 resets) in 462 ms. (863 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5625 resets) in 468 ms. (852 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5777 resets) in 460 ms. (867 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5443 resets) in 480 ms. (831 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5736 resets) in 467 ms. (854 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (546 resets) in 451 ms. (884 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5599 resets) in 474 ms. (842 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (11011 resets) in 511 ms. (781 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5793 resets) in 463 ms. (862 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (5561 resets) in 470 ms. (849 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5506 resets) in 454 ms. (879 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5650 resets) in 468 ms. (852 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (5570 resets) in 462 ms. (863 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (5778 resets) in 467 ms. (854 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (5801 resets) in 473 ms. (843 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 3415168 steps, run visited all 26 properties in 14382 ms. (steps per millisecond=237 )
Probabilistic random walk after 3415168 steps, saw 729668 distinct states, run finished after 14399 ms. (steps per millisecond=237 ) properties seen :26
Able to resolve query QuasiLiveness after proving 241 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 82855 ms.
ITS solved all properties within timeout

BK_STOP 1717351832256

--------------------
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="FireWire-PT-09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-09, 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 r560-tall-171734905800147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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