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.r100-tall-171624200900433.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 DES-PT-20b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200900433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 1716365861140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 08:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:17:42] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-22 08:17:42] [INFO ] Transformed 360 places.
[2024-05-22 08:17:42] [INFO ] Transformed 311 transitions.
[2024-05-22 08:17:42] [INFO ] Found NUPN structural information;
[2024-05-22 08:17:42] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 193 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (338 resets) in 1925 ms. (20 steps per ms) remains 69/273 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
// Phase 1: matrix 311 rows 360 cols
[2024-05-22 08:17:43] [INFO ] Computed 65 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 71/359 variables, 25/352 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 71/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (OVERLAPS) 0/671 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 0 solved, 69 unsolved in 4232 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-22 08:17:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 71/359 variables, 25/353 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-22 08:17:49] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2024-05-22 08:17:49] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 1/360 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-22 08:17:50] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-22 08:17:50] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-22 08:17:50] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 08:17:51] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:17:51] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 08:17:51] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 3 ms to minimize.
[2024-05-22 08:17:51] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-22 08:17:51] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/360 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 17 (OVERLAPS) 311/671 variables, 360/796 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/671 variables, 69/865 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/671 variables, and 865 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5015 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 11/11 constraints]
After SMT, in 9328ms problems are : Problem set: 0 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 354 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 354 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 333 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 333 transition count 275
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 324 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 305 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 305 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 305 transition count 255
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 103 place count 304 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 289 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 289 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 2 with 15 rules applied. Total rules applied 148 place count 289 transition count 225
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 287 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 287 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 284 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 207 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 205 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 205 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 204 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 203 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 202 transition count 144
Applied a total of 319 rules in 114 ms. Remains 202 /360 variables (removed 158) and now considering 144/311 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 202/360 places, 144/311 transitions.
RANDOM walk for 4000000 steps (190924 resets) in 27903 ms. (143 steps per ms) remains 63/69 properties
BEST_FIRST walk for 400003 steps (3668 resets) in 732 ms. (545 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3684 resets) in 697 ms. (573 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3678 resets) in 713 ms. (560 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3696 resets) in 701 ms. (569 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3757 resets) in 693 ms. (576 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3684 resets) in 691 ms. (578 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3602 resets) in 695 ms. (574 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3677 resets) in 699 ms. (571 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3682 resets) in 711 ms. (561 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3617 resets) in 707 ms. (564 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3743 resets) in 716 ms. (557 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3636 resets) in 704 ms. (567 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3612 resets) in 704 ms. (567 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3604 resets) in 707 ms. (564 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3591 resets) in 703 ms. (568 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3665 resets) in 712 ms. (561 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (3662 resets) in 710 ms. (562 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3660 resets) in 1074 ms. (372 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3618 resets) in 748 ms. (534 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3702 resets) in 720 ms. (554 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3621 resets) in 735 ms. (543 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3714 resets) in 720 ms. (554 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3644 resets) in 709 ms. (563 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3692 resets) in 711 ms. (561 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3540 resets) in 717 ms. (557 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3662 resets) in 722 ms. (553 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3769 resets) in 1096 ms. (364 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3703 resets) in 736 ms. (542 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3695 resets) in 727 ms. (549 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3630 resets) in 714 ms. (559 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3644 resets) in 714 ms. (559 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3759 resets) in 723 ms. (552 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3659 resets) in 715 ms. (558 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3682 resets) in 723 ms. (552 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400004 steps (3705 resets) in 707 ms. (564 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (3664 resets) in 722 ms. (553 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400004 steps (3678 resets) in 703 ms. (568 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3738 resets) in 694 ms. (575 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3572 resets) in 697 ms. (573 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3577 resets) in 694 ms. (575 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3571 resets) in 696 ms. (573 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3643 resets) in 706 ms. (565 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3637 resets) in 699 ms. (571 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3665 resets) in 874 ms. (457 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3610 resets) in 737 ms. (542 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3631 resets) in 719 ms. (555 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3670 resets) in 720 ms. (554 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3601 resets) in 717 ms. (557 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3671 resets) in 719 ms. (555 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3661 resets) in 716 ms. (557 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3616 resets) in 1068 ms. (374 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3580 resets) in 733 ms. (544 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3579 resets) in 699 ms. (571 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3670 resets) in 710 ms. (562 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3671 resets) in 698 ms. (572 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3612 resets) in 712 ms. (561 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3632 resets) in 705 ms. (566 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3613 resets) in 706 ms. (565 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3628 resets) in 697 ms. (573 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3628 resets) in 700 ms. (570 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3597 resets) in 699 ms. (571 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3591 resets) in 708 ms. (564 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3694 resets) in 704 ms. (567 steps per ms) remains 62/62 properties
// Phase 1: matrix 144 rows 202 cols
[2024-05-22 08:18:12] [INFO ] Computed 64 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 14/344 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 2/346 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 19 (OVERLAPS) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 266 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 48/297 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 14/344 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:17] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:18:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:18] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 20 (OVERLAPS) 2/346 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/346 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:19] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:18:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:18:19] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:18:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/346 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/346 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:18:22] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/346 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/346 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:18:24] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:18:24] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/346 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-22 08:18:25] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/346 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/346 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 29 (OVERLAPS) 0/346 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 342 constraints, problems are : Problem set: 0 solved, 62 unsolved in 15448 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 14/14 constraints]
After SMT, in 18515ms problems are : Problem set: 0 solved, 62 unsolved
Parikh walk visited 6 properties in 6235 ms.
Support contains 56 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 202 /202 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 202/202 places, 144/144 transitions.
RANDOM walk for 4000000 steps (190817 resets) in 25427 ms. (157 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3658 resets) in 1315 ms. (303 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3684 resets) in 960 ms. (416 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3613 resets) in 833 ms. (479 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3665 resets) in 721 ms. (554 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3644 resets) in 710 ms. (562 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3641 resets) in 714 ms. (559 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3657 resets) in 1017 ms. (392 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3662 resets) in 927 ms. (431 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3578 resets) in 937 ms. (426 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3650 resets) in 933 ms. (428 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3709 resets) in 976 ms. (409 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3619 resets) in 998 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3656 resets) in 904 ms. (441 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3550 resets) in 1001 ms. (399 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400001 steps (3657 resets) in 933 ms. (428 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3677 resets) in 1165 ms. (343 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3646 resets) in 1184 ms. (337 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3609 resets) in 1270 ms. (314 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3629 resets) in 966 ms. (413 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3651 resets) in 1074 ms. (372 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3682 resets) in 1170 ms. (341 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3649 resets) in 1312 ms. (304 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400001 steps (3568 resets) in 891 ms. (448 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3669 resets) in 1228 ms. (325 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3558 resets) in 990 ms. (403 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3589 resets) in 951 ms. (420 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3674 resets) in 950 ms. (420 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3669 resets) in 1328 ms. (300 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3690 resets) in 933 ms. (428 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3653 resets) in 923 ms. (432 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3698 resets) in 942 ms. (424 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3610 resets) in 964 ms. (414 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3586 resets) in 947 ms. (421 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3667 resets) in 945 ms. (422 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3610 resets) in 974 ms. (410 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3642 resets) in 987 ms. (404 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3667 resets) in 951 ms. (420 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3581 resets) in 909 ms. (439 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3637 resets) in 946 ms. (422 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3729 resets) in 890 ms. (448 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3684 resets) in 877 ms. (455 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3675 resets) in 898 ms. (444 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3725 resets) in 923 ms. (432 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400002 steps (3641 resets) in 1015 ms. (393 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3656 resets) in 906 ms. (441 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3622 resets) in 1024 ms. (390 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3693 resets) in 948 ms. (421 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3655 resets) in 938 ms. (425 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (3528 resets) in 885 ms. (451 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400004 steps (3645 resets) in 923 ms. (432 steps per ms) remains 56/56 properties
Finished probabilistic random walk after 370523 steps, run visited all 56 properties in 2367 ms. (steps per millisecond=156 )
Probabilistic random walk after 370523 steps, saw 94386 distinct states, run finished after 2376 ms. (steps per millisecond=155 ) properties seen :56
Able to resolve query StableMarking after proving 274 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 80857 ms.
ITS solved all properties within timeout

BK_STOP 1716365943169

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DES-PT-20b"
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 DES-PT-20b, 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 r100-tall-171624200900433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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