fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r064-tajo-167813712100328
Last Updated
May 14, 2023

About the Execution of 2022-gold for BusinessProcesses-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
282.903 37226.00 57640.00 45.30 F normal

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.r064-tajo-167813712100328.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 BusinessProcesses-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tajo-167813712100328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K Mar 5 18:22 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 1678218602690

Running Version 202205111006
[2023-03-07 19:50:03] [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-07 19:50:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:50:04] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-07 19:50:04] [INFO ] Transformed 518 places.
[2023-03-07 19:50:04] [INFO ] Transformed 471 transitions.
[2023-03-07 19:50:04] [INFO ] Found NUPN structural information;
[2023-03-07 19:50:04] [INFO ] Parsed PT model containing 518 places and 471 transitions in 210 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 13 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 356) seen :36
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 320) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 320) seen :0
Running SMT prover for 320 properties.
// Phase 1: matrix 464 rows 512 cols
[2023-03-07 19:50:05] [INFO ] Computed 85 place invariants in 27 ms
[2023-03-07 19:50:08] [INFO ] After 2909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:320
[2023-03-07 19:50:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2023-03-07 19:50:10] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-07 19:50:17] [INFO ] After 5021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :320
[2023-03-07 19:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 19:50:21] [INFO ] After 4394ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :320
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 1 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 2 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 2 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 739 ms
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 1 ms to minimize.
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 0 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 1 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 0 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 1 ms to minimize.
[2023-03-07 19:50:25] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 1 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 1 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 1 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 1 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2023-03-07 19:50:26] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 1 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 1 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 1 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 1 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 1 ms to minimize.
[2023-03-07 19:50:27] [INFO ] Deduced a trap composed of 130 places in 112 ms of which 0 ms to minimize.
[2023-03-07 19:50:28] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 1 ms to minimize.
[2023-03-07 19:50:28] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2023-03-07 19:50:28] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2023-03-07 19:50:28] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 0 ms to minimize.
[2023-03-07 19:50:28] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 0 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 1 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 1 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 1 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2023-03-07 19:50:29] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2023-03-07 19:50:30] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 1 ms to minimize.
[2023-03-07 19:50:30] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 1 ms to minimize.
[2023-03-07 19:50:30] [INFO ] Deduced a trap composed of 105 places in 165 ms of which 1 ms to minimize.
[2023-03-07 19:50:30] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 0 ms to minimize.
[2023-03-07 19:50:30] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 1 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 0 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 104 places in 221 ms of which 1 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2023-03-07 19:50:31] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 1 ms to minimize.
[2023-03-07 19:50:32] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:32] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 7500 ms
[2023-03-07 19:50:32] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2023-03-07 19:50:32] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2023-03-07 19:50:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2023-03-07 19:50:33] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2023-03-07 19:50:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-07 19:50:33] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:320
Fused 320 Parikh solutions to 305 different solutions.
Parikh walk visited 217 properties in 6123 ms.
Support contains 103 out of 512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 510 transition count 384
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 432 transition count 384
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 158 place count 432 transition count 327
Deduced a syphon composed of 57 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 280 place count 367 transition count 327
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 321 place count 326 transition count 286
Iterating global reduction 2 with 41 rules applied. Total rules applied 362 place count 326 transition count 286
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 362 place count 326 transition count 280
Deduced a syphon composed of 6 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 375 place count 319 transition count 280
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 532 place count 239 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 534 place count 238 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 238 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 538 place count 236 transition count 204
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 539 place count 236 transition count 204
Applied a total of 539 rules in 171 ms. Remains 236 /512 variables (removed 276) and now considering 204/464 (removed 260) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/512 places, 204/464 transitions.
Finished random walk after 552 steps, including 8 resets, run visited all 103 properties in 65 ms. (steps per millisecond=8 )
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 35798 ms.

BK_STOP 1678218639916

--------------------
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="BusinessProcesses-PT-10"
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 BusinessProcesses-PT-10, 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 r064-tajo-167813712100328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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