fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038177000187
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
248.027 3600000.00 27900.00 55.40 TTFTFTFFTFFTFTTT 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/mcc2021-input.r037-tajo-162038177000187.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620936606600

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:10:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:10:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:10:08] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-13 20:10:08] [INFO ] Transformed 386 places.
[2021-05-13 20:10:08] [INFO ] Transformed 360 transitions.
[2021-05-13 20:10:08] [INFO ] Found NUPN structural information;
[2021-05-13 20:10:08] [INFO ] Parsed PT model containing 386 places and 360 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 112 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 360 rows 386 cols
[2021-05-13 20:10:08] [INFO ] Computed 62 place invariants in 17 ms
[2021-05-13 20:10:08] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-13 20:10:08] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2021-05-13 20:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:09] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-13 20:10:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:10:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2021-05-13 20:10:09] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 20:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:09] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 14 places in 242 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 14 places in 58 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2021-05-13 20:10:10] [INFO ] Deduced a trap composed of 30 places in 42 ms
[2021-05-13 20:10:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1092 ms
[2021-05-13 20:10:10] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 23 ms.
[2021-05-13 20:10:13] [INFO ] Added : 226 causal constraints over 46 iterations in 2259 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2021-05-13 20:10:13] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-13 20:10:13] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned unsat
[2021-05-13 20:10:13] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-13 20:10:13] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-13 20:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:14] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2021-05-13 20:10:14] [INFO ] Deduced a trap composed of 12 places in 209 ms
[2021-05-13 20:10:14] [INFO ] Deduced a trap composed of 15 places in 161 ms
[2021-05-13 20:10:14] [INFO ] Deduced a trap composed of 31 places in 147 ms
[2021-05-13 20:10:14] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2021-05-13 20:10:14] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2021-05-13 20:10:15] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2021-05-13 20:10:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 964 ms
[2021-05-13 20:10:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:10:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2021-05-13 20:10:15] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-13 20:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:15] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2021-05-13 20:10:15] [INFO ] Deduced a trap composed of 11 places in 201 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 13 places in 169 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 96 places in 150 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 14 places in 152 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2021-05-13 20:10:16] [INFO ] Deduced a trap composed of 105 places in 150 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 96 places in 138 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 101 places in 126 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 91 places in 129 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 103 places in 132 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 103 places in 124 ms
[2021-05-13 20:10:17] [INFO ] Deduced a trap composed of 95 places in 138 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 116 places in 128 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 108 places in 105 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 10 places in 106 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2021-05-13 20:10:18] [INFO ] Deduced a trap composed of 121 places in 196 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 101 places in 151 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 90 places in 141 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 105 places in 95 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 109 places in 99 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 91 places in 140 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 107 places in 108 ms
[2021-05-13 20:10:19] [INFO ] Deduced a trap composed of 93 places in 108 ms
[2021-05-13 20:10:20] [INFO ] Deduced a trap composed of 98 places in 135 ms
[2021-05-13 20:10:20] [INFO ] Deduced a trap composed of 97 places in 137 ms
[2021-05-13 20:10:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s17 s18 s21 s22 s26 s27 s28 s41 s42 s43 s73 s75 s82 s85 s98 s101 s128 s129 s130 s152 s153 s154 s163 s164 s165 s196 s201 s211 s225 s227 s231 s240 s241 s242 s246 s249 s250 s252 s253 s256 s261 s265 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s282 s283 s287 s288 s291 s292 s293 s294 s302 s303 s306 s310 s311 s312 s313 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s335 s336 s337 s338 s339 s340 s351 s366 s367 s377 s378 s379 s383 s384 s385) 0)") while checking expression at index 2
[2021-05-13 20:10:20] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2021-05-13 20:10:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned unsat
[2021-05-13 20:10:20] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2021-05-13 20:10:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-13 20:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:20] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2021-05-13 20:10:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:10:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2021-05-13 20:10:20] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:10:21] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 15 places in 123 ms
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 13 places in 110 ms
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2021-05-13 20:10:21] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2021-05-13 20:10:22] [INFO ] Deduced a trap composed of 11 places in 101 ms
[2021-05-13 20:10:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 840 ms
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 17500 steps, including 214 resets, run finished after 39 ms. (steps per millisecond=448 ) properties seen :[1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 210 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 378 transition count 272
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 168 place count 299 transition count 272
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 168 place count 299 transition count 213
Deduced a syphon composed of 59 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 127 rules applied. Total rules applied 295 place count 231 transition count 213
Symmetric choice reduction at 2 with 43 rule applications. Total rules 338 place count 231 transition count 213
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 424 place count 188 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 424 place count 188 transition count 165
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 435 place count 182 transition count 165
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 549 place count 124 transition count 109
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 551 place count 123 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 553 place count 123 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 555 place count 121 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 556 place count 121 transition count 110
Applied a total of 556 rules in 105 ms. Remains 121 /386 variables (removed 265) and now considering 110/360 (removed 250) transitions.
Finished structural reductions, in 1 iterations. Remains : 121/386 places, 110/360 transitions.
Finished random walk after 478 steps, including 31 resets, run visited all 1 properties in 2 ms. (steps per millisecond=239 )
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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