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.r035-tall-165252016300233.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-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tall-165252016300233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652542903727

Running Version 202205111006
[2022-05-14 15:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-14 15:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:41:45] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-14 15:41:45] [INFO ] Transformed 386 places.
[2022-05-14 15:41:45] [INFO ] Transformed 360 transitions.
[2022-05-14 15:41:45] [INFO ] Found NUPN structural information;
[2022-05-14 15:41:45] [INFO ] Parsed PT model containing 386 places and 360 transitions in 207 ms.
Graph (trivial) has 217 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 118 places are NOT stable. Took 13 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 268) seen :90
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 178) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 178) seen :0
Running SMT prover for 178 properties.
// Phase 1: matrix 353 rows 380 cols
[2022-05-14 15:41:45] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-14 15:41:48] [INFO ] After 2076ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:178
[2022-05-14 15:41:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-14 15:41:49] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2022-05-14 15:41:53] [INFO ] After 2868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :178
[2022-05-14 15:41:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-14 15:41:56] [INFO ] After 2664ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :178
[2022-05-14 15:41:56] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 6 ms to minimize.
[2022-05-14 15:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-14 15:41:56] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 2 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 1 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 1 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 1 ms to minimize.
[2022-05-14 15:41:57] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-05-14 15:41:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2191 ms
[2022-05-14 15:41:59] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 1 ms to minimize.
[2022-05-14 15:41:59] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2022-05-14 15:41:59] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 1 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 91 places in 195 ms of which 1 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 1 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 1 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 0 ms to minimize.
[2022-05-14 15:42:00] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 0 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 83 places in 192 ms of which 1 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2309 ms
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-05-14 15:42:01] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2022-05-14 15:42:02] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 5 ms to minimize.
[2022-05-14 15:42:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2022-05-14 15:42:02] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:42:02] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:02] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2022-05-14 15:42:03] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 0 ms to minimize.
[2022-05-14 15:42:03] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:42:03] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:42:04] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 1 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 8 ms to minimize.
[2022-05-14 15:42:05] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2022-05-14 15:42:06] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 4 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 0 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2022-05-14 15:42:07] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 5 ms to minimize.
[2022-05-14 15:42:08] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 0 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:42:09] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 6832 ms
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-05-14 15:42:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 323 ms
[2022-05-14 15:42:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2022-05-14 15:42:11] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-14 15:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2022-05-14 15:42:11] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-14 15:42:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2022-05-14 15:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2022-05-14 15:42:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2022-05-14 15:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 0 ms to minimize.
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 0 ms to minimize.
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 0 ms to minimize.
[2022-05-14 15:42:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:42:12] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:42:13] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:42:13] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 1 ms to minimize.
[2022-05-14 15:42:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-14 15:42:13] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:178
Fused 178 Parikh solutions to 173 different solutions.
Parikh walk visited 136 properties in 7139 ms.
Support contains 42 out of 380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 353/353 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 378 transition count 287
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 314 transition count 287
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 130 place count 314 transition count 236
Deduced a syphon composed of 51 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 240 place count 255 transition count 236
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 271 place count 224 transition count 205
Iterating global reduction 2 with 31 rules applied. Total rules applied 302 place count 224 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 302 place count 224 transition count 202
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 308 place count 221 transition count 202
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 428 place count 160 transition count 143
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 2 with 2 rules applied. Total rules applied 430 place count 159 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 159 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 434 place count 157 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 157 transition count 144
Applied a total of 435 rules in 102 ms. Remains 157 /380 variables (removed 223) and now considering 144/353 (removed 209) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/380 places, 144/353 transitions.
Finished random walk after 5199 steps, including 246 resets, run visited all 42 properties in 169 ms. (steps per millisecond=30 )
Able to resolve query StableMarking after proving 270 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 35709 ms.

BK_STOP 1652542940685

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-07"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-07, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tall-165252016300233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;