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.r043-tajo-167813697000575.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-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 159K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678794246348

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:44:08] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-14 11:44:08] [INFO ] Transformed 638 places.
[2023-03-14 11:44:08] [INFO ] Transformed 578 transitions.
[2023-03-14 11:44:08] [INFO ] Found NUPN structural information;
[2023-03-14 11:44:08] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-14 11:44:09] [INFO ] Computed 100 place invariants in 45 ms
[2023-03-14 11:44:09] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-14 11:44:09] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-14 11:44:09] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-14 11:44:09] [INFO ] [Nat]Absence check using 62 positive place invariants in 17 ms returned sat
[2023-03-14 11:44:09] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2023-03-14 11:44:10] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 7 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 4 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 1 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 0 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 0 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 7 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 0 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 15 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 0 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 13 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Trap strengthening (SAT) tested/added 86/85 trap constraints in 12467 ms
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 0 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 147 places in 195 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 0 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 0 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 157 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 160 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 159 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 0 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 3 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 1 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 1 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 144 places in 154 ms of which 0 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 147 places in 172 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 155 places in 154 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:44:33] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:44:33] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:44:33] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:44:34] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:44:34] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:44:34] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 0 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.Application.startNoEx(Application.java:902)
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-14 11:44:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:44:34] [INFO ] After 25184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 133 ms.
Support contains 47 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 624 transition count 489
Reduce places removed 80 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 87 rules applied. Total rules applied 168 place count 544 transition count 482
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 175 place count 537 transition count 482
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 175 place count 537 transition count 357
Deduced a syphon composed of 125 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 437 place count 400 transition count 357
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 520 place count 317 transition count 274
Iterating global reduction 3 with 83 rules applied. Total rules applied 603 place count 317 transition count 274
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 603 place count 317 transition count 268
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 617 place count 309 transition count 268
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 767 place count 234 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 768 place count 234 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 769 place count 234 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 770 place count 233 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 771 place count 233 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 772 place count 232 transition count 190
Applied a total of 772 rules in 189 ms. Remains 232 /630 variables (removed 398) and now considering 190/570 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 232/630 places, 190/570 transitions.
Incomplete random walk after 10000 steps, including 346 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1475332 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 1475332 steps, saw 258804 distinct states, run finished after 3002 ms. (steps per millisecond=491 ) properties seen :4
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 232 cols
[2023-03-14 11:44:38] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-14 11:44:38] [INFO ] [Real]Absence check using 57 positive place invariants in 10 ms returned sat
[2023-03-14 11:44:38] [INFO ] [Real]Absence check using 57 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-14 11:44:38] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 11:44:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-14 11:44:38] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-14 11:44:38] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-14 11:44:38] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 190/190 transitions.
Graph (trivial) has 41 edges and 232 vertex of which 2 / 232 are part of one of the 1 SCC in 10 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 231 transition count 178
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 221 transition count 178
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 21 place count 221 transition count 165
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 52 place count 203 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 200 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 200 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 200 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 199 transition count 161
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 119 place count 168 transition count 133
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 168 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 165 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 163 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 161 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 161 transition count 127
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 597 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 158 transition count 127
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 158 transition count 125
Applied a total of 134 rules in 98 ms. Remains 158 /232 variables (removed 74) and now considering 125/190 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 158/232 places, 125/190 transitions.
Finished random walk after 283 steps, including 10 resets, run visited all 1 properties in 2 ms. (steps per millisecond=141 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31087 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 16
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 638 places, 578 transitions, 1694 arcs.
Final Score: 32050.347
Took : 20 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15037392 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16110968 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-16"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is BusinessProcesses-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697000575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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