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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 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 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200600756

Running Version 202205111006
[2022-06-02 20:10:02] [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:10:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:10:02] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-06-02 20:10:02] [INFO ] Transformed 518 places.
[2022-06-02 20:10:02] [INFO ] Transformed 471 transitions.
[2022-06-02 20:10:02] [INFO ] Found NUPN structural information;
[2022-06-02 20:10:02] [INFO ] Parsed PT model containing 518 places and 471 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 13) seen :4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 471 rows 518 cols
[2022-06-02 20:10:03] [INFO ] Computed 85 place invariants in 28 ms
[2022-06-02 20:10:04] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 20:10:04] [INFO ] [Nat]Absence check using 48 positive place invariants in 18 ms returned sat
[2022-06-02 20:10:04] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned sat
[2022-06-02 20:10:05] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2022-06-02 20:10:05] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 6 ms to minimize.
[2022-06-02 20:10:05] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:05] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:05] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1306 ms
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:10:06] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:10:07] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:10:07] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:07] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:10:07] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:10:07] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-06-02 20:10:08] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2576 ms
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2022-06-02 20:10:09] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:10:10] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:10:11] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:12] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:10:13] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 2 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 2 ms to minimize.
[2022-06-02 20:10:14] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 122 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:10:15] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:10:16] [INFO ] Deduced a trap composed of 125 places in 168 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:10:17] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:10:18] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 4 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:19] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 11 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:10:20] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 1 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:21] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:10:22] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:10:23] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 3 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:10:24] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 1 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 0 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2022-06-02 20:10:25] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 1 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:10:26] [INFO ] Deduced a trap composed of 114 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 1 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 1 ms to minimize.
[2022-06-02 20:10:27] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 0 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 119 places in 105 ms of which 1 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 124 places in 110 ms of which 0 ms to minimize.
[2022-06-02 20:10:28] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 0 ms to minimize.
[2022-06-02 20:10:29] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 0 ms to minimize.
[2022-06-02 20:10:29] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:10:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:10:29] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1199 ms.
Support contains 48 out of 518 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 246 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 512 transition count 378
Reduce places removed 85 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 93 rules applied. Total rules applied 179 place count 427 transition count 370
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 187 place count 419 transition count 370
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 187 place count 419 transition count 303
Deduced a syphon composed of 67 places in 17 ms
Ensure Unique test removed 8 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 329 place count 344 transition count 303
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 385 place count 288 transition count 247
Iterating global reduction 3 with 56 rules applied. Total rules applied 441 place count 288 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 441 place count 288 transition count 243
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 449 place count 284 transition count 243
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 583 place count 217 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 585 place count 216 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 587 place count 216 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 589 place count 214 transition count 177
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 591 place count 214 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 592 place count 213 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 593 place count 212 transition count 176
Applied a total of 593 rules in 185 ms. Remains 212 /518 variables (removed 306) and now considering 176/471 (removed 295) transitions.
Finished structural reductions, in 1 iterations. Remains : 212/518 places, 176/471 transitions.
Incomplete random walk after 1000000 steps, including 18654 resets, run finished after 2458 ms. (steps per millisecond=406 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1046 steps, including 4 resets, run visited all 1 properties in 4 ms. (steps per millisecond=261 )
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 31121 ms.

BK_STOP 1654200633188

--------------------
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
++ 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 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-10"
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-10, 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-165251918500398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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