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-165251918500439.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-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500439
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 29 23:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 23:49 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.5K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 29 23:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 29 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 23:51 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654200779681

Running Version 202205111006
[2022-06-02 20:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:13:01] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-06-02 20:13:01] [INFO ] Transformed 630 places.
[2022-06-02 20:13:01] [INFO ] Transformed 566 transitions.
[2022-06-02 20:13:01] [INFO ] Found NUPN structural information;
[2022-06-02 20:13:01] [INFO ] Parsed PT model containing 630 places and 566 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 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 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) 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
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 626 cols
[2022-06-02 20:13:02] [INFO ] Computed 102 place invariants in 35 ms
[2022-06-02 20:13:03] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2022-06-02 20:13:03] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2022-06-02 20:13:03] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 20:13:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2022-06-02 20:13:03] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2022-06-02 20:13:04] [INFO ] After 715ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-02 20:13:04] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 5 ms to minimize.
[2022-06-02 20:13:04] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2022-06-02 20:13:04] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 1 ms to minimize.
[2022-06-02 20:13:05] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 2 ms to minimize.
[2022-06-02 20:13:05] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 1 ms to minimize.
[2022-06-02 20:13:05] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 1 ms to minimize.
[2022-06-02 20:13:05] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2022-06-02 20:13:05] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 0 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 0 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 4 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 146 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 142 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 9 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 2 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 146 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 153 places in 102 ms of which 1 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 146 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 0 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 133 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 142 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 146 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 156 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 146 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 158 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 152 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 153 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 152 places in 119 ms of which 2 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 150 places in 114 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 0 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:13:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:13:28] [INFO ] After 25087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2214 ms.
Support contains 35 out of 626 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 622 transition count 471
Reduce places removed 90 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 95 rules applied. Total rules applied 186 place count 532 transition count 466
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 191 place count 527 transition count 466
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 191 place count 527 transition count 344
Deduced a syphon composed of 122 places in 7 ms
Ensure Unique test removed 17 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 452 place count 388 transition count 344
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 527 place count 313 transition count 269
Iterating global reduction 3 with 75 rules applied. Total rules applied 602 place count 313 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 602 place count 313 transition count 262
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 304 transition count 262
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 796 place count 214 transition count 174
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 797 place count 214 transition count 173
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 798 place count 214 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 213 transition count 172
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 805 place count 213 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 806 place count 212 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 807 place count 211 transition count 171
Applied a total of 807 rules in 186 ms. Remains 211 /626 variables (removed 415) and now considering 171/562 (removed 391) transitions.
Finished structural reductions, in 1 iterations. Remains : 211/626 places, 171/562 transitions.
Incomplete random walk after 1000000 steps, including 49814 resets, run finished after 15825 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12447 resets, run finished after 4487 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12419 resets, run finished after 4466 ms. (steps per millisecond=223 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 12717 resets, run finished after 4671 ms. (steps per millisecond=214 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12537 resets, run finished after 4956 ms. (steps per millisecond=201 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12938 resets, run finished after 4836 ms. (steps per millisecond=206 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 171 rows 211 cols
[2022-06-02 20:14:09] [INFO ] Computed 77 place invariants in 6 ms
[2022-06-02 20:14:09] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2022-06-02 20:14:09] [INFO ] [Real]Absence check using 57 positive and 20 generalized place invariants in 5 ms returned sat
[2022-06-02 20:14:09] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 20:14:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2022-06-02 20:14:09] [INFO ] [Nat]Absence check using 57 positive and 20 generalized place invariants in 4 ms returned sat
[2022-06-02 20:14:10] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 20:14:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-02 20:14:10] [INFO ] After 86ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 618 ms
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2022-06-02 20:14:10] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 154 ms
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 350 ms
[2022-06-02 20:14:11] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2022-06-02 20:14:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-02 20:14:11] [INFO ] After 1402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-06-02 20:14:11] [INFO ] After 1744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 493 ms.
Support contains 34 out of 211 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 211/211 places, 171/171 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 210 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 209 transition count 169
Applied a total of 4 rules in 20 ms. Remains 209 /211 variables (removed 2) and now considering 169/171 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 209/211 places, 169/171 transitions.
Incomplete random walk after 1000000 steps, including 49738 resets, run finished after 15582 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12516 resets, run finished after 4518 ms. (steps per millisecond=221 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12698 resets, run finished after 4631 ms. (steps per millisecond=215 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12519 resets, run finished after 4770 ms. (steps per millisecond=209 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 12863 resets, run finished after 4690 ms. (steps per millisecond=213 ) properties (out of 4) seen :0
Finished probabilistic random walk after 567 steps, run visited all 4 properties in 17 ms. (steps per millisecond=33 )
Probabilistic random walk after 567 steps, saw 317 distinct states, run finished after 17 ms. (steps per millisecond=33 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 105528 ms.

BK_STOP 1654200886471

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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 ReachabilityFireability -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-15"
export BK_EXAMINATION="ReachabilityFireability"
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-15, examination is ReachabilityFireability"
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-165251918500439"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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