Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r012-smll-171620124100204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124100204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716261491799

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:18:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 03:18:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:18:14] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-21 03:18:14] [INFO ] Transformed 161 places.
[2024-05-21 03:18:14] [INFO ] Transformed 365 transitions.
[2024-05-21 03:18:14] [INFO ] Found NUPN structural information;
[2024-05-21 03:18:14] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 398 ms.
Built sparse matrix representations for Structural reductions in 8 ms.21859KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 165 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 198 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 21 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 161 cols
[2024-05-21 03:18:14] [INFO ] Computed 13 invariants in 26 ms
[2024-05-21 03:18:15] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-21 03:18:15] [INFO ] Invariant cache hit.
[2024-05-21 03:18:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:18:15] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-05-21 03:18:15] [INFO ] Redundant transitions in 33 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-21 03:18:15] [INFO ] Invariant cache hit.
[2024-05-21 03:18:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:19] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 24 ms to minimize.
[2024-05-21 03:18:20] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:18:20] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:18:20] [INFO ] Deduced a trap composed of 93 places in 211 ms of which 3 ms to minimize.
[2024-05-21 03:18:20] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-21 03:18:20] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 4 ms to minimize.
[2024-05-21 03:18:21] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 3 ms to minimize.
[2024-05-21 03:18:21] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 3 ms to minimize.
[2024-05-21 03:18:21] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 4 ms to minimize.
[2024-05-21 03:18:21] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:18:21] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-05-21 03:18:22] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-05-21 03:18:22] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-21 03:18:22] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-21 03:18:22] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2024-05-21 03:18:22] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 03:18:23] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 03:18:23] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 2 ms to minimize.
[2024-05-21 03:18:23] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-21 03:18:23] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:26] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 3 ms to minimize.
[2024-05-21 03:18:26] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:18:26] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 2 ms to minimize.
[2024-05-21 03:18:27] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 03:18:28] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-05-21 03:18:28] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:18:28] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 03:18:28] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-21 03:18:28] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 2 ms to minimize.
[2024-05-21 03:18:29] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 3 ms to minimize.
[2024-05-21 03:18:29] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 3 ms to minimize.
[2024-05-21 03:18:29] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 11 ms to minimize.
[2024-05-21 03:18:29] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:31] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 03:18:31] [INFO ] Deduced a trap composed of 96 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:18:31] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:18:31] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 03:18:31] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-05-21 03:18:32] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-21 03:18:32] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 2 ms to minimize.
[2024-05-21 03:18:32] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:18:32] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2024-05-21 03:18:33] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 3 ms to minimize.
[2024-05-21 03:18:33] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 3 ms to minimize.
[2024-05-21 03:18:33] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 2 ms to minimize.
[2024-05-21 03:18:33] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:18:33] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-05-21 03:18:34] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 2 ms to minimize.
[2024-05-21 03:18:34] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
[2024-05-21 03:18:34] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 2 ms to minimize.
[2024-05-21 03:18:34] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2024-05-21 03:18:34] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 3 ms to minimize.
[2024-05-21 03:18:35] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:37] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:18:37] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-05-21 03:18:37] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:18:37] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 2 ms to minimize.
[2024-05-21 03:18:37] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:18:38] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2024-05-21 03:18:38] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 4 ms to minimize.
[2024-05-21 03:18:38] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-21 03:18:39] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 2 ms to minimize.
[2024-05-21 03:18:39] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 3 ms to minimize.
[2024-05-21 03:18:39] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 3 ms to minimize.
[2024-05-21 03:18:39] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-21 03:18:40] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:18:40] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 3 ms to minimize.
[2024-05-21 03:18:40] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2024-05-21 03:18:40] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2024-05-21 03:18:41] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 3 ms to minimize.
[2024-05-21 03:18:41] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-05-21 03:18:41] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2024-05-21 03:18:41] [INFO ] Deduced a trap composed of 56 places in 194 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/526 variables, and 254 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30046 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/161 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 80/254 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:49] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:18:49] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 3 ms to minimize.
[2024-05-21 03:18:50] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 2 ms to minimize.
[2024-05-21 03:18:50] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 3 ms to minimize.
[2024-05-21 03:18:50] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 3 ms to minimize.
[2024-05-21 03:18:51] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 3 ms to minimize.
[2024-05-21 03:18:51] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 3 ms to minimize.
[2024-05-21 03:18:52] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 2 ms to minimize.
[2024-05-21 03:18:52] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 2 ms to minimize.
[2024-05-21 03:18:52] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 2 ms to minimize.
[2024-05-21 03:18:52] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 2 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 3 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-05-21 03:18:53] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:18:54] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2024-05-21 03:18:54] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2024-05-21 03:18:54] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:18:56] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2024-05-21 03:18:57] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 3 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:18:58] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 3 ms to minimize.
[2024-05-21 03:18:59] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-21 03:18:59] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-21 03:18:59] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 3 ms to minimize.
[2024-05-21 03:18:59] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-05-21 03:19:00] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 3 ms to minimize.
[2024-05-21 03:19:00] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 3 ms to minimize.
[2024-05-21 03:19:00] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:19:02] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-21 03:19:02] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:19:03] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 3 ms to minimize.
[2024-05-21 03:19:03] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
[2024-05-21 03:19:03] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-05-21 03:19:03] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 2 ms to minimize.
[2024-05-21 03:19:04] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:19:04] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-21 03:19:05] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-21 03:19:05] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:19:05] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:19:05] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 03:19:05] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-05-21 03:19:06] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-05-21 03:19:06] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 3 ms to minimize.
[2024-05-21 03:19:07] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 3 ms to minimize.
[2024-05-21 03:19:07] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 3 ms to minimize.
[2024-05-21 03:19:07] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:19:07] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-05-21 03:19:07] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-21 03:19:11] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-05-21 03:19:12] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-21 03:19:13] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-21 03:19:13] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:19:13] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-21 03:19:13] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-21 03:19:14] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-21 03:19:14] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:19:15] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:19:15] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-21 03:19:15] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:19:15] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:19:15] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:19:16] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/526 variables, and 328 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30015 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/161 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/360 constraints, Known Traps: 154/154 constraints]
After SMT, in 60837ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60874ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61928 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1749 ms (no deadlock found). (steps per millisecond=714 )
Random directed walk for 1250000 steps, including 0 resets, run took 1374 ms (no deadlock found). (steps per millisecond=909 )
[2024-05-21 03:19:19] [INFO ] Invariant cache hit.
[2024-05-21 03:19:20] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-21 03:19:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 123 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 28 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2024-05-21 03:19:20] [INFO ] Computed 13 invariants in 7 ms
[2024-05-21 03:19:20] [INFO ] Implicit Places using invariants in 389 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 6 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2024-05-21 03:19:20] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 03:19:20] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-21 03:19:20] [INFO ] Invariant cache hit.
[2024-05-21 03:19:20] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:19:21] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1165 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 2915 ms. (13 steps per ms) remains 22/315 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 10/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 9/9 properties
[2024-05-21 03:19:22] [INFO ] Invariant cache hit.
[2024-05-21 03:19:22] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 71/81 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 28/109 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 28/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 6/115 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-21 03:19:22] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2024-05-21 03:19:22] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 1 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-21 03:19:23] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-21 03:19:24] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-21 03:19:24] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-21 03:19:24] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-21 03:19:24] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 15/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 292 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2518 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 71/81 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 28/109 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 28/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 6/115 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 15/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 9/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 301 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1247 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 15/15 constraints]
After SMT, in 3797ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 84 transition count 201
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 84 transition count 201
Applied a total of 62 rules in 20 ms. Remains 84 /115 variables (removed 31) and now considering 201/320 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 84/115 places, 201/320 transitions.
RANDOM walk for 3050236 steps (6 resets) in 12484 ms. (244 steps per ms) remains 0/9 properties
Able to resolve query QuasiLiveness after proving 320 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 12 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2024-05-21 03:19:30] [INFO ] Computed 13 invariants in 4 ms
[2024-05-21 03:19:30] [INFO ] Implicit Places using invariants in 316 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 4 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2024-05-21 03:19:30] [INFO ] Computed 12 invariants in 3 ms
[2024-05-21 03:19:30] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-21 03:19:30] [INFO ] Invariant cache hit.
[2024-05-21 03:19:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 03:19:31] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1184 ms. Remains : 115/161 places, 320/365 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :320 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 320 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 77730 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-05

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 161
TRANSITIONS: 365
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1380
NUPN UNITS: 8
LOADING TIME: 0.484

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.043
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.888
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1099
MODEL NAME: /home/mcc/execution/model
161 places, 365 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716262147527

--------------------
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 Liveness -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="Anderson-PT-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-05, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124100204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;