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.r224-tall-174902009500057.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 ShieldRVs-PT-010B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009500057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 122K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749106360130

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:52:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:41] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-05 06:52:41] [INFO ] Transformed 403 places.
[2025-06-05 06:52:41] [INFO ] Transformed 453 transitions.
[2025-06-05 06:52:41] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:41] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 196 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 502 place count 152 transition count 202
Applied a total of 502 rules in 86 ms. Remains 152 /403 variables (removed 251) and now considering 202/453 (removed 251) transitions.
// Phase 1: matrix 202 rows 152 cols
[2025-06-05 06:52:41] [INFO ] Computed 41 invariants in 20 ms
[2025-06-05 06:52:42] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-05 06:52:42] [INFO ] Invariant cache hit.
[2025-06-05 06:52:42] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-05 06:52:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 41/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 7 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 4 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 13 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 7 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 15/248 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:52:48] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 8 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2025-06-05 06:52:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 14/288 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:52:52] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 202/354 variables, 152/442 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/354 variables, 13/515 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 10/525 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 16/541 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:53:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 11/552 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 21 (INCLUDED_ONLY) 0/354 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 561 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30029 ms.
Refiners :[Domain max(s): 152/152 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 216/216 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 41/192 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 216/409 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 11/420 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-05 06:53:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2025-06-05 06:53:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 202/354 variables, 152/579 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 201/780 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2025-06-05 06:53:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2025-06-05 06:53:21] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:53:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2025-06-05 06:53:21] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2025-06-05 06:53:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:53:22] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2025-06-05 06:53:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:23] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2025-06-05 06:53:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2025-06-05 06:53:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2025-06-05 06:53:24] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:53:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 20/800 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 06:53:30] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:53:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
[2025-06-05 06:53:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:53:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:53:33] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:53:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2025-06-05 06:53:34] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2025-06-05 06:53:35] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:35] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2025-06-05 06:53:36] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 10/810 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 810 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30025 ms.
Refiners :[Domain max(s): 152/152 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 264/264 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LIVENESS mode, iteration 1 : 152/403 places, 202/453 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 60834 ms. Remains : 152/403 places, 202/453 transitions.
Discarding 60 transitions out of 202. Remains 142
Initial state reduction rules removed 1 formulas.
RANDOM walk for 36332 steps (252 resets) in 1379 ms. (26 steps per ms) remains 0/141 properties
Able to resolve query QuasiLiveness after proving 142 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 61690 ms.
ITS solved all properties within timeout

BK_STOP 1749106423141

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-010B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldRVs-PT-010B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009500057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;