Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S02J06T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 807K May 29 14:32 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 1748899622271

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:27:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 21:27:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:27:03] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2025-06-02 21:27:03] [INFO ] Transformed 690 places.
[2025-06-02 21:27:03] [INFO ] Transformed 1434 transitions.
[2025-06-02 21:27:03] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 239 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (11 resets) in 2249 ms. (17 steps per ms) remains 18/690 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 68 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (9 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
[2025-06-02 21:27:04] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-02 21:27:05] [INFO ] Computed 54 invariants in 73 ms
[2025-06-02 21:27:05] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/628 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 59/687 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/688 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 1290/1978 variables, 688/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1978 variables, 96/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1978 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1980 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1980 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 840 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4975 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:27:11] [INFO ] Deduced a trap composed of 369 places in 396 ms of which 42 ms to minimize.
[2025-06-02 21:27:12] [INFO ] Deduced a trap composed of 484 places in 389 ms of which 4 ms to minimize.
[2025-06-02 21:27:12] [INFO ] Deduced a trap composed of 476 places in 306 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:27:14] [INFO ] Deduced a trap composed of 348 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:27:14] [INFO ] Deduced a trap composed of 348 places in 227 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1980 variables, and 21 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 5/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 10155ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 450 place count 472 transition count 1074
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 466 place count 456 transition count 1074
Applied a total of 466 rules in 220 ms. Remains 456 /690 variables (removed 234) and now considering 1074/1306 (removed 232) transitions.
Running 1072 sub problems to find dead transitions.
[2025-06-02 21:27:15] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 456 cols
[2025-06-02 21:27:15] [INFO ] Computed 52 invariants in 31 ms
[2025-06-02 21:27:15] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 21:27:25] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 2 ms to minimize.
[2025-06-02 21:27:25] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 2 ms to minimize.
[2025-06-02 21:27:25] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:27:26] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 2 ms to minimize.
[2025-06-02 21:27:26] [INFO ] Deduced a trap composed of 151 places in 160 ms of which 2 ms to minimize.
[2025-06-02 21:27:28] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:27:28] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2025-06-02 21:27:33] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 2 ms to minimize.
[2025-06-02 21:27:33] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:27:34] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 2 ms to minimize.
[2025-06-02 21:27:34] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1514 variables, and 60 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1072/1072 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1072 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2025-06-02 21:27:39] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2025-06-02 21:27:39] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:27:40] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2025-06-02 21:27:40] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2025-06-02 21:27:40] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2025-06-02 21:27:40] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-02 21:27:41] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2025-06-02 21:27:49] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1514 variables, and 68 constraints, problems are : Problem set: 0 solved, 1072 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 35/38 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1072 constraints, Known Traps: 19/19 constraints]
After SMT, in 42182ms problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 42201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42443 ms. Remains : 456/690 places, 1074/1306 transitions.
RANDOM walk for 4000001 steps (1743 resets) in 33039 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (73 resets) in 1337 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (68 resets) in 1325 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (58 resets) in 1348 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (72 resets) in 1333 ms. (299 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1351 ms. (295 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (82 resets) in 1338 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (63 resets) in 1339 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (86 resets) in 1339 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (71 resets) in 1361 ms. (293 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (58 resets) in 1345 ms. (297 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (79 resets) in 1348 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (60 resets) in 1340 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1336 ms. (299 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (83 resets) in 1339 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (60 resets) in 1339 ms. (298 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1335 ms. (299 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (78 resets) in 1430 ms. (279 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (68 resets) in 1730 ms. (231 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1711172 steps, run timeout after 45001 ms. (steps per millisecond=38 ) properties seen :0 out of 18
Probabilistic random walk after 1711172 steps, saw 981138 distinct states, run finished after 45006 ms. (steps per millisecond=38 ) properties seen :0
[2025-06-02 21:28:57] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 21:28:57] [INFO ] Invariant cache hit.
[2025-06-02 21:28:57] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1058/1512 variables, 454/505 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/1514 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1514 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 604 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2385 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:29:00] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2025-06-02 21:29:00] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2025-06-02 21:29:00] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 177 places in 216 ms of which 3 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-06-02 21:29:02] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 7 ms to minimize.
[2025-06-02 21:29:02] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:29:02] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:29:04] [INFO ] Deduced a trap composed of 194 places in 239 ms of which 2 ms to minimize.
[2025-06-02 21:29:05] [INFO ] Deduced a trap composed of 199 places in 231 ms of which 3 ms to minimize.
[2025-06-02 21:29:05] [INFO ] Deduced a trap composed of 152 places in 246 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1058/1512 variables, 454/520 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 47418ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 3373 ms.
Support contains 18 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 28 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 456/456 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 28 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2025-06-02 21:29:48] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2025-06-02 21:29:48] [INFO ] Invariant cache hit.
[2025-06-02 21:29:49] [INFO ] Implicit Places using invariants in 561 ms returned [43, 116, 194, 231, 308, 324, 381, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 569 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/456 places, 1074/1074 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1070
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1070
Applied a total of 8 rules in 39 ms. Remains 444 /448 variables (removed 4) and now considering 1070/1074 (removed 4) transitions.
[2025-06-02 21:29:49] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
// Phase 1: matrix 1054 rows 444 cols
[2025-06-02 21:29:49] [INFO ] Computed 44 invariants in 28 ms
[2025-06-02 21:29:49] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-02 21:29:49] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:29:49] [INFO ] Invariant cache hit.
[2025-06-02 21:29:50] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:29:57] [INFO ] Implicit Places using invariants and state equation in 7438 ms returned []
Implicit Place search using SMT with State Equation took 7965 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/456 places, 1070/1074 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8602 ms. Remains : 444/456 places, 1070/1074 transitions.
RANDOM walk for 4000000 steps (1808 resets) in 30726 ms. (130 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (67 resets) in 1258 ms. (317 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (69 resets) in 1321 ms. (302 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (60 resets) in 1296 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (63 resets) in 1298 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (56 resets) in 1418 ms. (281 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (65 resets) in 1281 ms. (312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (63 resets) in 1316 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (51 resets) in 1287 ms. (310 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (71 resets) in 1291 ms. (309 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (67 resets) in 1313 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (74 resets) in 1271 ms. (314 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (62 resets) in 1275 ms. (313 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (61 resets) in 1278 ms. (312 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (75 resets) in 1283 ms. (311 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (81 resets) in 1291 ms. (309 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (76 resets) in 1271 ms. (314 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1294 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (85 resets) in 1272 ms. (314 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 1550509 steps, run timeout after 42001 ms. (steps per millisecond=36 ) properties seen :0 out of 18
Probabilistic random walk after 1550509 steps, saw 860112 distinct states, run finished after 42001 ms. (steps per millisecond=36 ) properties seen :0
[2025-06-02 21:30:53] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:30:53] [INFO ] Invariant cache hit.
[2025-06-02 21:30:53] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/442 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1054/1496 variables, 442/485 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1496 variables, 96/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/1498 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1498/1498 variables, and 584 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 444/444 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-06-02 21:30:57] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 3 ms to minimize.
[2025-06-02 21:30:57] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:30:57] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:30:58] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 2 ms to minimize.
[2025-06-02 21:30:58] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:30:58] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 2 ms to minimize.
[2025-06-02 21:30:58] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2025-06-02 21:30:58] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2025-06-02 21:30:59] [INFO ] Deduced a trap composed of 44 places in 224 ms of which 3 ms to minimize.
[2025-06-02 21:30:59] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 3 ms to minimize.
[2025-06-02 21:30:59] [INFO ] Deduced a trap composed of 217 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:30:59] [INFO ] Deduced a trap composed of 186 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:31:00] [INFO ] Deduced a trap composed of 189 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:31:00] [INFO ] Deduced a trap composed of 210 places in 220 ms of which 2 ms to minimize.
[2025-06-02 21:31:00] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/442 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1054/1496 variables, 442/500 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 96/596 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_98 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 14658ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1292 ms.
Support contains 18 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 39 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 444/444 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 19 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2025-06-02 21:31:09] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:31:09] [INFO ] Invariant cache hit.
[2025-06-02 21:31:09] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-02 21:31:09] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:31:09] [INFO ] Invariant cache hit.
[2025-06-02 21:31:10] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:31:17] [INFO ] Implicit Places using invariants and state equation in 7689 ms returned []
Implicit Place search using SMT with State Equation took 8173 ms to find 0 implicit places.
[2025-06-02 21:31:17] [INFO ] Redundant transitions in 64 ms returned []
Running 1068 sub problems to find dead transitions.
[2025-06-02 21:31:17] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:31:17] [INFO ] Invariant cache hit.
[2025-06-02 21:31:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
[2025-06-02 21:31:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-06-02 21:31:28] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2025-06-02 21:31:30] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
SMT process timed out in 31566ms, After SMT, problems are : Problem set: 0 solved, 1068 unsolved
Search for dead transitions found 0 dead transitions in 31575ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39848 ms. Remains : 444/444 places, 1070/1070 transitions.
RANDOM walk for 400000 steps (152 resets) in 4437 ms. (90 steps per ms) remains 18/18 properties
Running SMT prover for 18 properties.
[2025-06-02 21:31:50] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2025-06-02 21:31:50] [INFO ] Invariant cache hit.
[2025-06-02 21:31:50] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 21:31:50] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 32 ms returned sat
[2025-06-02 21:31:52] [INFO ] After 1436ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16
[2025-06-02 21:31:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 21:31:52] [INFO ] After 299ms SMT Verify possible using 96 Read/Feed constraints in real domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-02 21:31:53] [INFO ] After 1359ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-02 21:31:53] [INFO ] After 2936ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-02 21:31:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-02 21:31:53] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 29 ms returned sat
[2025-06-02 21:32:03] [INFO ] After 9926ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2025-06-02 21:32:04] [INFO ] After 1249ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-02 21:32:04] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2025-06-02 21:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-02 21:32:08] [INFO ] Deduced a trap composed of 188 places in 237 ms of which 3 ms to minimize.
[2025-06-02 21:32:11] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2025-06-02 21:32:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2508 ms
TRAPS : Iteration 1
[2025-06-02 21:32:15] [INFO ] After 11847ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
[2025-06-02 21:32:16] [INFO ] After 22793ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 312716 ms.
ITS solved all properties within timeout

BK_STOP 1748899936335

--------------------
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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S02J06T08, 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 r168-tall-174881266700278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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