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.r448-tajo-167905989600068.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 gold2022
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 r448-tajo-167905989600068
=====================================================================

--------------------
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 1679476701118

Running Version 202205111006
[2023-03-22 09:18:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 09:18:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:18:22] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-22 09:18:22] [INFO ] Transformed 803 places.
[2023-03-22 09:18:22] [INFO ] Transformed 903 transitions.
[2023-03-22 09:18:22] [INFO ] Found NUPN structural information;
[2023-03-22 09:18:22] [INFO ] Parsed PT model containing 803 places and 903 transitions in 234 ms.
Structural test allowed to assert that 381 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 422) seen :379
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) 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 43) 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 43) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) seen :0
Running SMT prover for 43 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-22 09:18:23] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-22 09:18:24] [INFO ] After 735ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2023-03-22 09:18:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2023-03-22 09:18:28] [INFO ] After 2227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :43
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 8 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 2 ms to minimize.
[2023-03-22 09:18:28] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2023-03-22 09:18:29] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2023-03-22 09:18:29] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 1 ms to minimize.
[2023-03-22 09:18:29] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2023-03-22 09:18:29] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-22 09:18:30] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-22 09:18:30] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2023-03-22 09:18:30] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 1 ms to minimize.
[2023-03-22 09:18:30] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-22 09:18:30] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2023-03-22 09:18:31] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2023-03-22 09:18:32] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 1 ms to minimize.
[2023-03-22 09:18:32] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-22 09:18:32] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-22 09:18:32] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2023-03-22 09:18:32] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 1 ms to minimize.
[2023-03-22 09:18:33] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2023-03-22 09:18:33] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-22 09:18:33] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 1 ms to minimize.
[2023-03-22 09:18:33] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2023-03-22 09:18:34] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 0 ms to minimize.
[2023-03-22 09:18:34] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2023-03-22 09:18:34] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2023-03-22 09:18:34] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 0 ms to minimize.
[2023-03-22 09:18:35] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2023-03-22 09:18:35] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2023-03-22 09:18:35] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2023-03-22 09:18:35] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2023-03-22 09:18:36] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2023-03-22 09:18:36] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-22 09:18:36] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 0 ms to minimize.
[2023-03-22 09:18:36] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-22 09:18:37] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2023-03-22 09:18:37] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
[2023-03-22 09:18:37] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2023-03-22 09:18:37] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2023-03-22 09:18:38] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2023-03-22 09:18:38] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 0 ms to minimize.
[2023-03-22 09:18:38] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2023-03-22 09:18:38] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 0 ms to minimize.
[2023-03-22 09:18:39] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 1 ms to minimize.
[2023-03-22 09:18:39] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 1 ms to minimize.
[2023-03-22 09:18:39] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 0 ms to minimize.
[2023-03-22 09:18:39] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 0 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-22 09:18:40] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2023-03-22 09:18:41] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 0 ms to minimize.
[2023-03-22 09:18:41] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 0 ms to minimize.
[2023-03-22 09:18:41] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2023-03-22 09:18:41] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2023-03-22 09:18:41] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2023-03-22 09:18:42] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2023-03-22 09:18:42] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2023-03-22 09:18:42] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2023-03-22 09:18:42] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 14283 ms
[2023-03-22 09:18:42] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 1 ms to minimize.
[2023-03-22 09:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-22 09:18:43] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2023-03-22 09:18:43] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-03-22 09:18:43] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 5 ms to minimize.
[2023-03-22 09:18:43] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 1 ms to minimize.
[2023-03-22 09:18:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 679 ms
[2023-03-22 09:18:44] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 1 ms to minimize.
[2023-03-22 09:18:44] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 0 ms to minimize.
[2023-03-22 09:18:44] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 1 ms to minimize.
[2023-03-22 09:18:44] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 1 ms to minimize.
[2023-03-22 09:18:45] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 0 ms to minimize.
[2023-03-22 09:18:45] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 1 ms to minimize.
[2023-03-22 09:18:45] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 0 ms to minimize.
[2023-03-22 09:18:45] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 0 ms to minimize.
[2023-03-22 09:18:46] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2023-03-22 09:18:46] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 1 ms to minimize.
[2023-03-22 09:18:46] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 0 ms to minimize.
[2023-03-22 09:18:46] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 0 ms to minimize.
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-22 09:18:47] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 0 ms to minimize.
[2023-03-22 09:18:48] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 1 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 0 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2023-03-22 09:18:49] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 0 ms to minimize.
[2023-03-22 09:18:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:18:49] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:43
Parikh walk visited 0 properties in 11614 ms.
Support contains 43 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 107 places :
Symmetric choice reduction at 2 with 107 rule applications. Total rules 469 place count 515 transition count 615
Iterating global reduction 2 with 107 rules applied. Total rules applied 576 place count 515 transition count 615
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 576 place count 515 transition count 555
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 696 place count 455 transition count 555
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 956 place count 325 transition count 425
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 998 place count 325 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 999 place count 324 transition count 424
Applied a total of 999 rules in 284 ms. Remains 324 /803 variables (removed 479) and now considering 424/903 (removed 479) transitions.
Finished structural reductions, in 1 iterations. Remains : 324/803 places, 424/903 transitions.
Finished random walk after 9957 steps, including 38 resets, run visited all 43 properties in 220 ms. (steps per millisecond=45 )
Able to resolve query StableMarking after proving 423 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 39389 ms.

BK_STOP 1679476742005

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
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 gold2022"
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 r448-tajo-167905989600068"
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 ;