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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.2K 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 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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 1717352255140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:17:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:17:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:17:36] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 18:17:36] [INFO ] Transformed 254 places.
[2024-06-02 18:17:36] [INFO ] Transformed 368 transitions.
[2024-06-02 18:17:36] [INFO ] Found NUPN structural information;
[2024-06-02 18:17:36] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 179 ms.
Graph (trivial) has 218 edges and 254 vertex of which 19 / 254 are part of one of the 3 SCC in 3 ms
Free SCC test removed 16 places
Structural test allowed to assert that 59 places are NOT stable. Took 20 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 17 transitions.
RANDOM walk for 40000 steps (1082 resets) in 1724 ms. (23 steps per ms) remains 131/195 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 131/131 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 401 steps (8 resets) in 5 ms. (66 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 131/131 properties
[2024-06-02 18:17:37] [INFO ] Flow matrix only has 349 transitions (discarded 2 similar events)
// Phase 1: matrix 349 rows 238 cols
[2024-06-02 18:17:37] [INFO ] Computed 5 invariants in 18 ms
[2024-06-02 18:17:37] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 80/211 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 27/238 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 27/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 348/586 variables, 238/481 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/587 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 587/587 variables, and 482 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5048 ms.
Refiners :[Domain max(s): 238/238 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 238/238 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 80/211 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 80/215 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 18 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 112 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:17:44] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:17:44] [INFO ] Deduced a trap composed of 111 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:17:44] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:17:44] [INFO ] Deduced a trap composed of 116 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 11/226 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:17:45] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:17:45] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2024-06-02 18:17:45] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 1 ms to minimize.
[2024-06-02 18:17:45] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:17:46] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 1 ms to minimize.
[2024-06-02 18:17:46] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 18:17:46] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 1 ms to minimize.
[2024-06-02 18:17:47] [INFO ] Deduced a trap composed of 131 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:17:47] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 211/587 variables, and 235 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5010 ms.
Refiners :[Domain max(s): 211/238 constraints, Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/238 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/131 constraints, Known Traps: 20/20 constraints]
After SMT, in 10176ms problems are : Problem set: 0 solved, 131 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 351/351 transitions.
Graph (complete) has 581 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 235 transition count 306
Reduce places removed 41 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 44 rules applied. Total rules applied 90 place count 194 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 192 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 92 place count 192 transition count 300
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 98 place count 189 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 185 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 185 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 185 transition count 295
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 135 place count 171 transition count 281
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 145 place count 166 transition count 283
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 166 transition count 275
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 161 place count 158 transition count 275
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 158 transition count 275
Applied a total of 162 rules in 74 ms. Remains 158 /238 variables (removed 80) and now considering 275/351 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 158/238 places, 275/351 transitions.
RANDOM walk for 4000000 steps (452352 resets) in 33960 ms. (117 steps per ms) remains 107/131 properties
BEST_FIRST walk for 40003 steps (1410 resets) in 159 ms. (250 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1430 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1427 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (1392 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1423 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1415 resets) in 103 ms. (384 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1402 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1411 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1417 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1444 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1461 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1434 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1420 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1430 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1424 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1416 resets) in 106 ms. (373 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (1423 resets) in 105 ms. (377 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1434 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1451 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1418 resets) in 226 ms. (176 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1420 resets) in 125 ms. (317 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1434 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1423 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1420 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1433 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (1432 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1419 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1436 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1427 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1434 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1431 resets) in 97 ms. (408 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1414 resets) in 96 ms. (412 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1406 resets) in 105 ms. (377 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1431 resets) in 97 ms. (408 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1433 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1437 resets) in 99 ms. (400 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1435 resets) in 103 ms. (384 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1435 resets) in 97 ms. (408 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1415 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1428 resets) in 98 ms. (404 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1429 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40001 steps (1409 resets) in 101 ms. (392 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1435 resets) in 100 ms. (396 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1421 resets) in 104 ms. (380 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40002 steps (1419 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
BEST_FIRST walk for 40003 steps (1421 resets) in 102 ms. (388 steps per ms) remains 107/107 properties
// Phase 1: matrix 275 rows 158 cols
[2024-06-02 18:17:57] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:17:57] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 49/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 275/431 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 2/433 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/433 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 165 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 49/156 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-02 18:18:01] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:18:01] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:18:01] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:18:01] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:18:01] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 104 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 105 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-02 18:18:02] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-02 18:18:03] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:18:03] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:18:03] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:18:03] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:18:03] [INFO ] Deduced a trap composed of 112 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:18:04] [INFO ] Deduced a trap composed of 114 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-02 18:18:04] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 275/431 variables, 156/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 107/289 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-02 18:18:06] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:18:06] [INFO ] Deduced a trap composed of 105 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:18:06] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:18:06] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 2/433 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 0/433 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 295 constraints, problems are : Problem set: 0 solved, 107 unsolved in 15381 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 23/23 constraints]
After SMT, in 18726ms problems are : Problem set: 0 solved, 107 unsolved
Fused 107 Parikh solutions to 106 different solutions.
Parikh walk visited 18 properties in 17672 ms.
Support contains 89 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 275/275 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 158 transition count 265
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 148 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 148 transition count 264
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 147 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 142 transition count 259
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 142 transition count 259
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 52 place count 142 transition count 239
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 64 place count 136 transition count 233
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 74 place count 131 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 131 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 83 place count 131 transition count 246
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 131 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 85 place count 130 transition count 245
Applied a total of 85 rules in 35 ms. Remains 130 /158 variables (removed 28) and now considering 245/275 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 130/158 places, 245/275 transitions.
RANDOM walk for 4000000 steps (452305 resets) in 34507 ms. (115 steps per ms) remains 86/89 properties
BEST_FIRST walk for 400004 steps (14311 resets) in 1645 ms. (243 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14310 resets) in 1352 ms. (295 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14292 resets) in 1130 ms. (353 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14311 resets) in 1800 ms. (222 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14289 resets) in 1456 ms. (274 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14301 resets) in 1363 ms. (293 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400001 steps (14217 resets) in 1262 ms. (316 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14268 resets) in 1892 ms. (211 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14252 resets) in 1175 ms. (340 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14381 resets) in 1339 ms. (298 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14275 resets) in 1140 ms. (350 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14280 resets) in 1288 ms. (310 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14306 resets) in 1174 ms. (340 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14331 resets) in 1482 ms. (269 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14300 resets) in 1142 ms. (349 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14286 resets) in 1289 ms. (310 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14318 resets) in 897 ms. (445 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14284 resets) in 851 ms. (469 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14296 resets) in 871 ms. (458 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14279 resets) in 857 ms. (466 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14248 resets) in 851 ms. (469 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14291 resets) in 840 ms. (475 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14237 resets) in 852 ms. (468 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14296 resets) in 864 ms. (462 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (14308 resets) in 862 ms. (463 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14284 resets) in 862 ms. (463 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (14320 resets) in 867 ms. (460 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (14264 resets) in 841 ms. (475 steps per ms) remains 85/86 properties
BEST_FIRST walk for 400002 steps (14290 resets) in 833 ms. (479 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (14363 resets) in 831 ms. (480 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (14307 resets) in 835 ms. (478 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400001 steps (14259 resets) in 859 ms. (465 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (14352 resets) in 838 ms. (476 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (14315 resets) in 838 ms. (476 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400002 steps (14262 resets) in 839 ms. (476 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (14348 resets) in 854 ms. (467 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (14263 resets) in 835 ms. (478 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400004 steps (14297 resets) in 1315 ms. (303 steps per ms) remains 83/85 properties
BEST_FIRST walk for 400003 steps (14276 resets) in 1693 ms. (236 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14256 resets) in 1536 ms. (260 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400001 steps (14263 resets) in 1293 ms. (309 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14375 resets) in 900 ms. (443 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14257 resets) in 853 ms. (468 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14276 resets) in 816 ms. (489 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14291 resets) in 1006 ms. (397 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14343 resets) in 1439 ms. (277 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14230 resets) in 1280 ms. (312 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14324 resets) in 1365 ms. (292 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400001 steps (14309 resets) in 1569 ms. (254 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14266 resets) in 1897 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14284 resets) in 1538 ms. (259 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14255 resets) in 1134 ms. (352 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14309 resets) in 1573 ms. (254 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14273 resets) in 1375 ms. (290 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14305 resets) in 844 ms. (473 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14269 resets) in 844 ms. (473 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14296 resets) in 817 ms. (489 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14311 resets) in 821 ms. (486 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14294 resets) in 834 ms. (479 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14350 resets) in 1315 ms. (303 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14283 resets) in 1778 ms. (224 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14248 resets) in 1140 ms. (350 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14314 resets) in 1571 ms. (254 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14288 resets) in 856 ms. (466 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14309 resets) in 859 ms. (465 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14278 resets) in 856 ms. (466 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14353 resets) in 864 ms. (462 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14303 resets) in 856 ms. (466 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14300 resets) in 862 ms. (463 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14371 resets) in 868 ms. (460 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14269 resets) in 895 ms. (446 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14272 resets) in 855 ms. (467 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14317 resets) in 844 ms. (473 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14256 resets) in 862 ms. (463 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14342 resets) in 856 ms. (466 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14297 resets) in 842 ms. (474 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14296 resets) in 855 ms. (467 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14275 resets) in 833 ms. (479 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14246 resets) in 846 ms. (472 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14281 resets) in 848 ms. (471 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14266 resets) in 838 ms. (476 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (14292 resets) in 836 ms. (477 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400002 steps (14242 resets) in 831 ms. (480 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (14259 resets) in 1095 ms. (364 steps per ms) remains 83/83 properties
Finished probabilistic random walk after 75610 steps, run visited all 83 properties in 341 ms. (steps per millisecond=221 )
Probabilistic random walk after 75610 steps, saw 21780 distinct states, run finished after 345 ms. (steps per millisecond=219 ) properties seen :83
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 99653 ms.
ITS solved all properties within timeout

BK_STOP 1717352356090

--------------------
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-16"
export BK_EXAMINATION="StableMarking"
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-16, 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 r560-tall-171734905900183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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