Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918500430.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200724817

Running Version 202205111006
[2022-06-02 20:12:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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, 3600]
[2022-06-02 20:12:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:12:06] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-06-02 20:12:06] [INFO ] Transformed 624 places.
[2022-06-02 20:12:06] [INFO ] Transformed 564 transitions.
[2022-06-02 20:12:06] [INFO ] Found NUPN structural information;
[2022-06-02 20:12:06] [INFO ] Parsed PT model containing 624 places and 564 transitions in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :2
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 556 rows 616 cols
[2022-06-02 20:12:07] [INFO ] Computed 99 place invariants in 43 ms
[2022-06-02 20:12:08] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 20:12:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-02 20:12:08] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2022-06-02 20:12:09] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 5 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 2 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2022-06-02 20:12:09] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2022-06-02 20:12:10] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2022-06-02 20:12:10] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:12:10] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:12:10] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:12:10] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 1 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:12:11] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 133 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:12:12] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:12:13] [INFO ] Deduced a trap composed of 145 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:12:14] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:12:15] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 153 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:12:16] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:12:17] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 8 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:12:18] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 152 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:19] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 151 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 157 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 156 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:12:20] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 151 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 156 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 151 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:21] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 156 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:12:22] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:12:23] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:12:24] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 140 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:25] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 140 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 150 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 157 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:12:26] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:12:27] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:12:28] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:12:29] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:12:30] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2022-06-02 20:12:31] [INFO ] Trap strengthening (SAT) tested/added 157/156 trap constraints in 22802 ms
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:12:32] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:12:33] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:12:33] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:12:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:12:33] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 799 ms.
Support contains 5 out of 616 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 351 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 604 transition count 409
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 279 place count 466 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 465 transition count 408
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 280 place count 465 transition count 321
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 469 place count 363 transition count 321
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 551 place count 281 transition count 239
Iterating global reduction 3 with 82 rules applied. Total rules applied 633 place count 281 transition count 239
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 633 place count 281 transition count 229
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 656 place count 268 transition count 229
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 844 place count 173 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 846 place count 172 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 848 place count 172 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 850 place count 170 transition count 138
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 170 transition count 138
Applied a total of 851 rules in 138 ms. Remains 170 /616 variables (removed 446) and now considering 138/556 (removed 418) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/616 places, 138/556 transitions.
Finished random walk after 551 steps, including 21 resets, run visited all 3 properties in 7 ms. (steps per millisecond=78 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 28179 ms.

BK_STOP 1654200754281

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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 3600 -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-14"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-14, 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 r024-tall-165251918500430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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