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.r140-smll-174876533400078.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 MedleyA-PT-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533400078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K 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 1748927892959

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 05:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:18:15] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-06-03 05:18:15] [INFO ] Transformed 115 places.
[2025-06-03 05:18:15] [INFO ] Transformed 107 transitions.
[2025-06-03 05:18:15] [INFO ] Found NUPN structural information;
[2025-06-03 05:18:15] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 293 ms.
Structural test allowed to assert that 32 places are NOT stable. Took 16 ms.
RANDOM walk for 40000 steps (1117 resets) in 2420 ms. (16 steps per ms) remains 28/83 properties
BEST_FIRST walk for 4004 steps (29 resets) in 104 ms. (38 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (29 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (23 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 90 ms. (43 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 69 ms. (57 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (27 resets) in 92 ms. (43 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 64 ms. (61 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (32 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (34 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (29 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (27 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (32 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (27 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (28 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (30 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (27 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (27 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (28 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
// Phase 1: matrix 107 rows 115 cols
[2025-06-03 05:18:16] [INFO ] Computed 9 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 52/80 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 35/115 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 35/124 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 107/222 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 239 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1322 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 52/80 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-03 05:18:18] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 19 ms to minimize.
[2025-06-03 05:18:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
[2025-06-03 05:18:18] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2025-06-03 05:18:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 35/115 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2025-06-03 05:18:19] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2025-06-03 05:18:19] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2025-06-03 05:18:19] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 107/222 variables, 115/246 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 28/274 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 274 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2193 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 7/7 constraints]
After SMT, in 3589ms problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 2519 ms.
Support contains 28 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 115 transition count 84
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 92 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 92 transition count 78
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 86 transition count 78
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 79 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 79 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 79 transition count 70
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 108 place count 61 transition count 53
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 61 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 60 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 59 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 58 transition count 51
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 58 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 57 transition count 50
Applied a total of 114 rules in 69 ms. Remains 57 /115 variables (removed 58) and now considering 50/107 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 57/115 places, 50/107 transitions.
RANDOM walk for 4000000 steps (436298 resets) in 22303 ms. (179 steps per ms) remains 22/28 properties
BEST_FIRST walk for 400004 steps (20863 resets) in 936 ms. (426 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (20770 resets) in 915 ms. (436 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (20788 resets) in 909 ms. (439 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (20908 resets) in 925 ms. (431 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400000 steps (20859 resets) in 910 ms. (439 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20825 resets) in 918 ms. (435 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (20891 resets) in 919 ms. (434 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20875 resets) in 905 ms. (441 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20725 resets) in 876 ms. (456 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20838 resets) in 902 ms. (442 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20887 resets) in 913 ms. (437 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20770 resets) in 906 ms. (441 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400001 steps (20732 resets) in 915 ms. (436 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20718 resets) in 978 ms. (408 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (20838 resets) in 982 ms. (406 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20770 resets) in 955 ms. (418 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (20643 resets) in 913 ms. (437 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (20754 resets) in 1045 ms. (382 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (20793 resets) in 1060 ms. (377 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (20787 resets) in 1243 ms. (321 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (20898 resets) in 1249 ms. (320 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (20830 resets) in 981 ms. (407 steps per ms) remains 22/22 properties
// Phase 1: matrix 50 rows 57 cols
[2025-06-03 05:18:37] [INFO ] Computed 8 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 35/71 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 14/85 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/87 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 15/102 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 1/103 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 4/107 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 0/107 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 65 constraints, problems are : Problem set: 0 solved, 22 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 14/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 35/71 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-03 05:18:38] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 14/85 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 19/68 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-03 05:18:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/87 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 15/102 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/102 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 1/103 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/103 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/103 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 4/107 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/107 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-06-03 05:18:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/107 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (OVERLAPS) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 90 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 3/3 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 755 ms.
Support contains 22 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 55 transition count 48
Applied a total of 4 rules in 7 ms. Remains 55 /57 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 55/57 places, 48/50 transitions.
RANDOM walk for 4000000 steps (436580 resets) in 18724 ms. (213 steps per ms) remains 18/22 properties
BEST_FIRST walk for 400004 steps (20877 resets) in 808 ms. (494 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20762 resets) in 803 ms. (497 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20750 resets) in 807 ms. (495 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20711 resets) in 796 ms. (501 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20822 resets) in 903 ms. (442 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20819 resets) in 808 ms. (494 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20785 resets) in 807 ms. (495 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (20765 resets) in 812 ms. (492 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20866 resets) in 813 ms. (491 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20695 resets) in 868 ms. (460 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20817 resets) in 869 ms. (459 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20668 resets) in 896 ms. (445 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20835 resets) in 917 ms. (435 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (20831 resets) in 1195 ms. (334 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20987 resets) in 1325 ms. (301 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20805 resets) in 879 ms. (454 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20650 resets) in 875 ms. (456 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20824 resets) in 906 ms. (441 steps per ms) remains 18/18 properties
// Phase 1: matrix 48 rows 55 cols
[2025-06-03 05:18:50] [INFO ] Computed 8 invariants in 3 ms
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) 9/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 6/59 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 7/67 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 7/74 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/74 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 7/81 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/81 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 7/88 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/88 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 8/96 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/96 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (OVERLAPS) 1/97 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/97 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (OVERLAPS) 5/102 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/102 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (OVERLAPS) 1/103 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/103 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 18 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 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) 9/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 26/53 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 6/59 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 7/67 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/67 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 7/74 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/74 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/74 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 7/81 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/81 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 20 (OVERLAPS) 7/88 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/88 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 23 (OVERLAPS) 8/96 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/96 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 25 (OVERLAPS) 1/97 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/97 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/97 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 28 (OVERLAPS) 5/102 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/102 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 30 (OVERLAPS) 1/103 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/103 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/103 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 33 (OVERLAPS) 0/103 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 81 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 2162ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 516 ms.
Support contains 18 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 47
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 2 with 4 rules applied. Total rules applied 6 place count 52 transition count 45
Applied a total of 6 rules in 8 ms. Remains 52 /55 variables (removed 3) and now considering 45/48 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 52/55 places, 45/48 transitions.
RANDOM walk for 4000000 steps (436081 resets) in 17778 ms. (224 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20740 resets) in 877 ms. (455 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20806 resets) in 873 ms. (457 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20678 resets) in 884 ms. (451 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20776 resets) in 876 ms. (456 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20860 resets) in 878 ms. (455 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20599 resets) in 878 ms. (455 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20642 resets) in 864 ms. (462 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (20692 resets) in 871 ms. (458 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20841 resets) in 879 ms. (454 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20943 resets) in 896 ms. (445 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20893 resets) in 874 ms. (457 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20716 resets) in 875 ms. (456 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (20971 resets) in 958 ms. (417 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (20746 resets) in 935 ms. (427 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20737 resets) in 877 ms. (455 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20717 resets) in 876 ms. (456 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (20841 resets) in 915 ms. (436 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (20733 resets) in 871 ms. (458 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 2204 steps, run visited all 18 properties in 38 ms. (steps per millisecond=58 )
Probabilistic random walk after 2204 steps, saw 1070 distinct states, run finished after 45 ms. (steps per millisecond=48 ) properties seen :18
Able to resolve query StableMarking after proving 84 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 49301 ms.
ITS solved all properties within timeout

BK_STOP 1748927944500

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r140-smll-174876533400078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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