Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r057-tajo-167813708100313.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
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 r057-tajo-167813708100313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:22 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 1679050504103

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BusinessProcesses-PT-07
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-17 10:55:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-17 10:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:55:05] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-17 10:55:05] [INFO ] Transformed 386 places.
[2023-03-17 10:55:05] [INFO ] Transformed 360 transitions.
[2023-03-17 10:55:05] [INFO ] Found NUPN structural information;
[2023-03-17 10:55:05] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 127 ms.
Graph (trivial) has 217 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Structural test allowed to assert that 118 places are NOT stable. Took 11 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 268) seen :67
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) 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 201) seen :0
Running SMT prover for 201 properties.
// Phase 1: matrix 353 rows 380 cols
[2023-03-17 10:55:06] [INFO ] Computed 62 place invariants in 21 ms
[2023-03-17 10:55:08] [INFO ] After 1606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:201
[2023-03-17 10:55:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2023-03-17 10:55:09] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-17 10:55:13] [INFO ] After 2394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :201
[2023-03-17 10:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-17 10:55:15] [INFO ] After 2054ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :201
[2023-03-17 10:55:15] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 6 ms to minimize.
[2023-03-17 10:55:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-17 10:55:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2023-03-17 10:55:15] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-17 10:55:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 233 ms
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 1 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 0 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 1 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 1 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 0 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 0 ms to minimize.
[2023-03-17 10:55:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 961 ms
[2023-03-17 10:55:17] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 0 ms to minimize.
[2023-03-17 10:55:17] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2023-03-17 10:55:17] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 1 ms to minimize.
[2023-03-17 10:55:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 0 ms to minimize.
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 1 ms to minimize.
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2023-03-17 10:55:18] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 0 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1066 ms
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2023-03-17 10:55:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2023-03-17 10:55:20] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 0 ms to minimize.
[2023-03-17 10:55:20] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 4 ms to minimize.
[2023-03-17 10:55:20] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2023-03-17 10:55:20] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 1 ms to minimize.
[2023-03-17 10:55:20] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 0 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 1 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2023-03-17 10:55:21] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 1 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 0 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 1 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 0 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-03-17 10:55:22] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3057 ms
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 0 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 1 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2023-03-17 10:55:23] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 1 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 0 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 0 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 1 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 0 ms to minimize.
[2023-03-17 10:55:24] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 0 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 1 ms to minimize.
[2023-03-17 10:55:25] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 0 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 0 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 0 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 1 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3104 ms
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-17 10:55:26] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2023-03-17 10:55:27] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 0 ms to minimize.
[2023-03-17 10:55:27] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2023-03-17 10:55:27] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 3 ms to minimize.
[2023-03-17 10:55:27] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 0 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 0 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 1 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 0 ms to minimize.
[2023-03-17 10:55:28] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 0 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 1 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 0 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 1 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 1 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 0 ms to minimize.
[2023-03-17 10:55:29] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 0 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 0 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 1 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 0 ms to minimize.
[2023-03-17 10:55:30] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 1 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 0 ms to minimize.
[2023-03-17 10:55:31] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 0 ms to minimize.
[2023-03-17 10:55:32] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 0 ms to minimize.
[2023-03-17 10:55:32] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 0 ms to minimize.
[2023-03-17 10:55:32] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 1 ms to minimize.
[2023-03-17 10:55:32] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2023-03-17 10:55:32] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 0 ms to minimize.
[2023-03-17 10:55:33] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 0 ms to minimize.
[2023-03-17 10:55:33] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 0 ms to minimize.
[2023-03-17 10:55:33] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 10:55:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 10:55:33] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:201
Fused 201 Parikh solutions to 196 different solutions.
Parikh walk visited 133 properties in 3720 ms.
Support contains 68 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.4 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 378 transition count 293
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 320 transition count 293
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 118 place count 320 transition count 250
Deduced a syphon composed of 43 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 212 place count 269 transition count 250
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 237 place count 244 transition count 225
Iterating global reduction 2 with 25 rules applied. Total rules applied 262 place count 244 transition count 225
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 262 place count 244 transition count 222
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 268 place count 241 transition count 222
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 390 place count 179 transition count 162
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 392 place count 178 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 178 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 396 place count 176 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 397 place count 176 transition count 163
Applied a total of 397 rules in 105 ms. Remains 176 /380 variables (removed 204) and now considering 163/353 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 176/380 places, 163/353 transitions.
Finished random walk after 2377 steps, including 97 resets, run visited all 68 properties in 31 ms. (steps per millisecond=76 )
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 31497 ms.
ITS solved all properties within timeout

BK_STOP 1679050537382

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="smartxred"
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-5348"
echo " Executing tool smartxred"
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 r057-tajo-167813708100313"
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 ;