Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r439-tajo-167905985900068.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-tajo-167905985900068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 244K Mar 5 18:23 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 1679552763059

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:26:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-23 06:26:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:26:04] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-23 06:26:04] [INFO ] Transformed 803 places.
[2023-03-23 06:26:04] [INFO ] Transformed 903 transitions.
[2023-03-23 06:26:04] [INFO ] Found NUPN structural information;
[2023-03-23 06:26:04] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 141 ms.
Structural test allowed to assert that 381 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 422) seen :366
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 56) seen :0
Running SMT prover for 56 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-23 06:26:05] [INFO ] Computed 81 place invariants in 19 ms
[2023-03-23 06:26:06] [INFO ] After 1053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:56
[2023-03-23 06:26:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2023-03-23 06:26:09] [INFO ] After 1604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :56
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 26 places in 255 ms of which 11 ms to minimize.
[2023-03-23 06:26:09] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 1 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2023-03-23 06:26:10] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2023-03-23 06:26:11] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2023-03-23 06:26:12] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3894 ms
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2023-03-23 06:26:13] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2023-03-23 06:26:14] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-03-23 06:26:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2023-03-23 06:26:14] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-23 06:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-23 06:26:14] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 0 ms to minimize.
[2023-03-23 06:26:14] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 0 ms to minimize.
[2023-03-23 06:26:15] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2023-03-23 06:26:15] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2023-03-23 06:26:15] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 0 ms to minimize.
[2023-03-23 06:26:15] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 2 ms to minimize.
[2023-03-23 06:26:16] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 5 ms to minimize.
[2023-03-23 06:26:16] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 0 ms to minimize.
[2023-03-23 06:26:16] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 1 ms to minimize.
[2023-03-23 06:26:17] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 0 ms to minimize.
[2023-03-23 06:26:17] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 1 ms to minimize.
[2023-03-23 06:26:17] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2023-03-23 06:26:18] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-23 06:26:18] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2023-03-23 06:26:18] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-23 06:26:18] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2023-03-23 06:26:18] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 1 ms to minimize.
[2023-03-23 06:26:19] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2023-03-23 06:26:19] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2023-03-23 06:26:19] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 1 ms to minimize.
[2023-03-23 06:26:19] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2023-03-23 06:26:20] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 0 ms to minimize.
[2023-03-23 06:26:20] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2023-03-23 06:26:20] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2023-03-23 06:26:20] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 1 ms to minimize.
[2023-03-23 06:26:21] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2023-03-23 06:26:21] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 1 ms to minimize.
[2023-03-23 06:26:21] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-23 06:26:21] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 1 ms to minimize.
[2023-03-23 06:26:22] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 1 ms to minimize.
[2023-03-23 06:26:22] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2023-03-23 06:26:22] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2023-03-23 06:26:22] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 1 ms to minimize.
[2023-03-23 06:26:23] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 1 ms to minimize.
[2023-03-23 06:26:23] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 0 ms to minimize.
[2023-03-23 06:26:23] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-23 06:26:23] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 0 ms to minimize.
[2023-03-23 06:26:23] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 2 ms to minimize.
[2023-03-23 06:26:24] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2023-03-23 06:26:24] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2023-03-23 06:26:24] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 8 ms to minimize.
[2023-03-23 06:26:24] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 0 ms to minimize.
[2023-03-23 06:26:24] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2023-03-23 06:26:25] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2023-03-23 06:26:25] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2023-03-23 06:26:25] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2023-03-23 06:26:25] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 0 ms to minimize.
[2023-03-23 06:26:25] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 1 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 1 ms to minimize.
[2023-03-23 06:26:26] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 1 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 1 ms to minimize.
[2023-03-23 06:26:27] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 5 ms to minimize.
[2023-03-23 06:26:28] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 14222 ms
[2023-03-23 06:26:28] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 2 ms to minimize.
[2023-03-23 06:26:29] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 2 ms to minimize.
[2023-03-23 06:26:30] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 1 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 0 ms to minimize.
[2023-03-23 06:26:31] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:26:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 06:26:31] [INFO ] After 25122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:56
Parikh walk visited 0 properties in 10897 ms.
Support contains 56 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 803 transition count 822
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 722 transition count 822
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 722 transition count 722
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 622 transition count 722
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 463 place count 521 transition count 621
Iterating global reduction 2 with 101 rules applied. Total rules applied 564 place count 521 transition count 621
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 564 place count 521 transition count 561
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 684 place count 461 transition count 561
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 930 place count 338 transition count 438
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 972 place count 338 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 973 place count 337 transition count 437
Applied a total of 973 rules in 162 ms. Remains 337 /803 variables (removed 466) and now considering 437/903 (removed 466) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 337/803 places, 437/903 transitions.
Finished random walk after 8418 steps, including 32 resets, run visited all 56 properties in 111 ms. (steps per millisecond=75 )
Able to resolve query StableMarking after proving 423 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 38452 ms.
ITS solved all properties within timeout

BK_STOP 1679552803222

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldRVs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-020B, 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 r439-tajo-167905985900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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