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-167813697000574.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000574
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678794244592

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=ReachabilityCardinality
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:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 11:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:44:06] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-14 11:44:06] [INFO ] Transformed 638 places.
[2023-03-14 11:44:06] [INFO ] Transformed 578 transitions.
[2023-03-14 11:44:06] [INFO ] Found NUPN structural information;
[2023-03-14 11:44:06] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 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.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 13) seen :6
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-14 11:44:07] [INFO ] Computed 100 place invariants in 21 ms
[2023-03-14 11:44:07] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 11:44:07] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2023-03-14 11:44:08] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2023-03-14 11:44:08] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-14 11:44:08] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 21 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 2 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:44:09] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-14 11:44:10] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:44:11] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 123 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 148 places in 178 ms of which 0 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2023-03-14 11:44:12] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 1 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 1 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:44:13] [INFO ] Deduced a trap composed of 154 places in 160 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 1 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 107 places in 85 ms of which 1 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2023-03-14 11:44:14] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6048 ms
[2023-03-14 11:44:14] [INFO ] Deduced a trap composed of 133 places in 205 ms of which 5 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 138 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 0 ms to minimize.
[2023-03-14 11:44:15] [INFO ] Deduced a trap composed of 145 places in 206 ms of which 1 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 0 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 150 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 0 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:44:16] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 1 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 148 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:44:17] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 0 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 1 ms to minimize.
[2023-03-14 11:44:18] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-14 11:44:19] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 0 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:44:20] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 0 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 137 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:44:21] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 3 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 3 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 0 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 0 ms to minimize.
[2023-03-14 11:44:22] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 149 places in 129 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:44:23] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 141 places in 268 ms of which 1 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 0 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 1 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:44:24] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:44:25] [INFO ] Deduced a trap composed of 150 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 140 places in 153 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 0 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 142 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:44:26] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 149 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 0 ms to minimize.
[2023-03-14 11:44:27] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 1 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 151 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 1 ms to minimize.
[2023-03-14 11:44:28] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 1 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 150 places in 178 ms of which 2 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2023-03-14 11:44:29] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2023-03-14 11:44:30] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-14 11:44:31] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2023-03-14 11:44:32] [INFO ] Deduced a trap composed of 32 places in 103 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:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:44:32] [INFO ] After 25052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 43 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 326 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 618 transition count 440
Reduce places removed 121 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 128 rules applied. Total rules applied 251 place count 497 transition count 433
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 258 place count 490 transition count 433
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 258 place count 490 transition count 347
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 443 place count 391 transition count 347
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 520 place count 314 transition count 270
Iterating global reduction 3 with 77 rules applied. Total rules applied 597 place count 314 transition count 270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 597 place count 314 transition count 263
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 612 place count 306 transition count 263
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 774 place count 224 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 776 place count 223 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 778 place count 223 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 780 place count 221 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 781 place count 221 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 782 place count 220 transition count 184
Applied a total of 782 rules in 188 ms. Remains 220 /630 variables (removed 410) and now considering 184/570 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 220/630 places, 184/570 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 338 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 26988 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 16
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.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: 32059.194
Took : 20 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P117)) <= ( 1 ) ) | ( (tk(P508)) <= ( 0 ) ) ) | ( ( (tk(P573)) <= ( 0 ) ) & ( ( ( (tk(P124)) <= ( 1 ) ) & (! ( ( (! ( (tk(P420)) <= ( 0 ) )) | ( ( (tk(P143)) <= ( 1 ) ) & ( (tk(P324)) <= (tk(P134)) ) ) ) & ( (tk(P46)) <= (tk(P206)) ) )) ) & ( (tk(P301)) <= ( 0 ) ) ) ) ) | ( ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P78)) ) & ( (tk(P28)) <= (tk(P159)) ) ) | ( ( (tk(P449)) <= (tk(P430)) ) | ( ( 1 ) <= (tk(P524)) ) ) ) | ( ( 1 ) <= (tk(P65)) ) ) & ( ( ( ( (tk(P616)) <= (tk(P233)) ) & ( (tk(P628)) <= ( 1 ) ) ) | ( ( (tk(P503)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P581)) ) ) ) & (! ( (tk(P547)) <= (tk(P473)) )) ) ) & ( ( ( 1 ) <= (tk(P256)) ) & ( ( ( 1 ) <= (tk(P317)) ) | ( ( 1 ) <= (tk(P433)) ) ) ) ) | (! ( (! ( ( (tk(P323)) <= (tk(P49)) ) | ( ( (tk(P377)) <= ( 1 ) ) | ( (tk(P446)) <= ( 1 ) ) ) )) & (! ( ( (tk(P422)) <= (tk(P474)) ) & ( ( (tk(P286)) <= ( 1 ) ) & ( (tk(P237)) <= (tk(P168)) ) ) )) )) ) | ( ( (! ( ( 1 ) <= (tk(P446)) )) | ( ( (! ( ( 1 ) <= (tk(P143)) )) & (! ( ( ( 1 ) <= (tk(P560)) ) | ( (tk(P463)) <= (tk(P367)) ) )) ) & ( ( ( 1 ) <= (tk(P621)) ) & ( (! ( (tk(P352)) <= (tk(P454)) )) | ( ( (tk(P197)) <= (tk(P159)) ) | ( ( 1 ) <= (tk(P452)) ) ) ) ) ) ) | ( (! ( ( ( 1 ) <= (tk(P159)) ) | (! ( (tk(P163)) <= ( 1 ) )) )) & ( (! ( ( (tk(P603)) <= (tk(P381)) ) & ( ( 1 ) <= (tk(P130)) ) )) & ( (tk(P197)) <= ( 0 ) ) ) ) ) ) & (! ( ( (tk(P200)) <= ( 0 ) ) & ( (tk(P460)) <= ( 0 ) ) )) ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-01 (reachable &!potential( (! ( (! ( (tk(P69)) <= ( 1 ) )) & ( (! ( ( ( 1 ) <= (tk(P632)) ) | ( ( ( ( ( 1 ) <= (tk(P567)) ) & ( ( 1 ) <= (tk(P547)) ) ) & ( ( ( 1 ) <= (tk(P256)) ) | ( (tk(P218)) <= (tk(P368)) ) ) ) | (! ( (tk(P553)) <= (tk(P294)) )) ) )) & ( ( ( 1 ) <= (tk(P327)) ) | (! ( ( 1 ) <= (tk(P177)) )) ) ) ))))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-02 (reachable &!potential( ( (! ( ( ( 1 ) <= (tk(P458)) ) & ( ( ( (tk(P364)) <= (tk(P176)) ) | ( (! ( ( 1 ) <= (tk(P125)) )) | ( ( (tk(P191)) <= ( 1 ) ) | ( (tk(P6)) <= (tk(P16)) ) ) ) ) & ( ( ( (! ( ( ( 1 ) <= (tk(P258)) ) | ( ( 1 ) <= (tk(P259)) ) )) & ( (tk(P200)) <= ( 0 ) ) ) & (! ( (tk(P283)) <= ( 0 ) )) ) & ( (tk(P70)) <= ( 0 ) ) ) ) )) & (! ( ( 1 ) <= (tk(P74)) )) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-03 (reachable & potential(( ( (! ( (tk(P317)) <= ( 1 ) )) | ( ( ( ( ( 1 ) <= (tk(P224)) ) | ( (! ( (tk(P157)) <= ( 1 ) )) | ( (! ( (tk(P320)) <= ( 1 ) )) | (! ( (tk(P268)) <= (tk(P138)) )) ) ) ) | ( ( (! ( (tk(P416)) <= ( 1 ) )) & ( (! ( (tk(P120)) <= (tk(P212)) )) | ( ( ( (tk(P571)) <= ( 1 ) ) | ( (tk(P26)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P408)) ) & ( (tk(P361)) <= (tk(P8)) ) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P424)) )) | ( ( ( ( ( 1 ) <= (tk(P162)) ) | ( (tk(P152)) <= ( 1 ) ) ) | ( (tk(P164)) <= (tk(P368)) ) ) | (! ( ( (tk(P414)) <= (tk(P47)) ) & ( (tk(P389)) <= ( 0 ) ) )) ) ) ) ) & (! ( ( (tk(P382)) <= (tk(P518)) ) | ( (tk(P360)) <= ( 1 ) ) )) ) ) | (! ( (! ( (tk(P225)) <= ( 1 ) )) | ( (tk(P536)) <= ( 0 ) ) )) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-04 (reachable & potential(( (! ( (tk(P231)) <= ( 1 ) )) | (! ( (tk(P593)) <= (tk(P106)) )) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-05 (reachable & potential((! ( ( ( ( (! ( ( ( 1 ) <= (tk(P430)) ) | ( (tk(P447)) <= ( 0 ) ) )) | ( (tk(P363)) <= (tk(P43)) ) ) | ( ( ( ( 1 ) <= (tk(P217)) ) | (! ( (tk(P70)) <= ( 1 ) )) ) & (! ( ( (tk(P118)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P537)) ) )) ) ) | ( (tk(P287)) <= ( 0 ) ) ) | (! ( ( (tk(P366)) <= (tk(P554)) ) & (! ( (! ( (tk(P322)) <= ( 1 ) )) & ( ( (tk(P551)) <= (tk(P376)) ) & ( (tk(P538)) <= (tk(P585)) ) ) )) )) ))))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-06 (reachable &!potential( (! ( ( 1 ) <= (tk(P624)) ))))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-07 (reachable & potential(( ( (tk(P498)) <= ( 0 ) ) & ( (! ( (! ( (tk(P121)) <= ( 0 ) )) & ( (tk(P9)) <= ( 1 ) ) )) & ( ( 1 ) <= (tk(P373)) ) ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-08 (reachable & potential(( (! ( ( 1 ) <= (tk(P426)) )) & ( ( (! ( ( ( 1 ) <= (tk(P298)) ) | ( ( ( ( ( ( 1 ) <= (tk(P46)) ) | ( (tk(P348)) <= ( 1 ) ) ) & (! ( (tk(P300)) <= (tk(P278)) )) ) | ( ( ( (tk(P200)) <= (tk(P392)) ) | ( (tk(P12)) <= (tk(P122)) ) ) & ( ( ( 1 ) <= (tk(P516)) ) & ( (tk(P527)) <= (tk(P169)) ) ) ) ) & (! ( ( ( 1 ) <= (tk(P424)) ) & ( ( 1 ) <= (tk(P86)) ) )) ) )) & (! ( ( ( (! ( ( (tk(P187)) <= ( 0 ) ) | ( (tk(P292)) <= ( 0 ) ) )) & ( ( (tk(P448)) <= ( 1 ) ) & (! ( ( 1 ) <= (tk(P36)) )) ) ) | ( ( ( ( ( 1 ) <= (tk(P356)) ) & ( (tk(P510)) <= (tk(P26)) ) ) | (! ( ( 1 ) <= (tk(P508)) )) ) & ( (tk(P66)) <= ( 1 ) ) ) ) & (! ( (! ( ( 1 ) <= (tk(P518)) )) & (! ( (tk(P372)) <= (tk(P627)) )) )) )) ) | ( ( ( (! ( ( ( ( ( 1 ) <= (tk(P165)) ) & ( (tk(P283)) <= ( 1 ) ) ) & (! ( (tk(P605)) <= (tk(P97)) )) ) & ( ( 1 ) <= (tk(P26)) ) )) & ( ( ( ( (tk(P559)) <= (tk(P202)) ) | ( ( 1 ) <= (tk(P55)) ) ) | ( ( ( 1 ) <= (tk(P274)) ) | (! ( (tk(P387)) <= ( 1 ) )) ) ) & (! ( ( ( (tk(P53)) <= (tk(P230)) ) & ( (tk(P90)) <= ( 1 ) ) ) & (! ( (tk(P499)) <= ( 1 ) )) )) ) ) | ( (! ( (tk(P598)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P58)) ) & ( (tk(P288)) <= (tk(P604)) ) ) ) ) & (! ( (tk(P73)) <= ( 1 ) )) ) ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-09 (reachable &!potential( ( ( (tk(P28)) <= (tk(P630)) ) | ( ( ( ( ( ( ( (! ( (tk(P177)) <= (tk(P19)) )) & ( ( (tk(P619)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P266)) ) ) ) & (! ( (tk(P424)) <= ( 0 ) )) ) & ( (tk(P274)) <= (tk(P280)) ) ) & ( (! ( (! ( (tk(P598)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P562)) ) & ( (tk(P426)) <= (tk(P75)) ) ) )) & ( (tk(P613)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P467)) ) ) & ( ( ( ( ( ( ( ( 1 ) <= (tk(P307)) ) | ( ( 1 ) <= (tk(P404)) ) ) & ( (tk(P398)) <= ( 0 ) ) ) | ( (! ( (tk(P624)) <= (tk(P246)) )) & ( (tk(P335)) <= (tk(P533)) ) ) ) | ( (tk(P583)) <= ( 1 ) ) ) & ( ( ( (tk(P461)) <= (tk(P494)) ) & ( (! ( (tk(P454)) <= (tk(P204)) )) | ( ( (tk(P256)) <= ( 1 ) ) | ( (tk(P446)) <= ( 1 ) ) ) ) ) & ( (tk(P101)) <= ( 0 ) ) ) ) & (! ( (tk(P119)) <= (tk(P601)) )) ) ) | ( ( ( 1 ) <= (tk(P90)) ) & ( ( ( ( (! ( (tk(P341)) <= ( 0 ) )) | ( (tk(P610)) <= ( 0 ) ) ) | ( (tk(P610)) <= (tk(P203)) ) ) | ( ( ( (tk(P383)) <= (tk(P342)) ) & ( ( (tk(P385)) <= (tk(P365)) ) | (! ( (tk(P564)) <= ( 0 ) )) ) ) & ( (tk(P464)) <= (tk(P427)) ) ) ) | (! ( (tk(P175)) <= ( 0 ) )) ) ) ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P489)) <= (tk(P94)) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-11 (reachable &!potential( ( ( (! ( (tk(P253)) <= ( 0 ) )) & (! ( (! ( (tk(P545)) <= (tk(P277)) )) | ( ( ( (! ( (tk(P455)) <= ( 1 ) )) | (! ( ( (tk(P200)) <= ( 0 ) ) & ( (tk(P527)) <= ( 0 ) ) )) ) | ( ( (tk(P377)) <= (tk(P332)) ) | ( ( 1 ) <= (tk(P590)) ) ) ) & ( (! ( ( (tk(P142)) <= (tk(P384)) ) & ( ( 1 ) <= (tk(P550)) ) )) | ( (tk(P407)) <= (tk(P251)) ) ) ) )) ) | (! ( ( ( ( ( (! ( ( 1 ) <= (tk(P553)) )) | ( ( (tk(P579)) <= (tk(P387)) ) | ( (tk(P300)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P169)) ) ) & ( (! ( ( 1 ) <= (tk(P555)) )) | ( (! ( ( 1 ) <= (tk(P252)) )) | ( (tk(P530)) <= ( 0 ) ) ) ) ) & ( ( ( (tk(P560)) <= ( 0 ) ) | ( ( ( (tk(P388)) <= ( 0 ) ) | ( (tk(P97)) <= ( 1 ) ) ) & ( ( (tk(P337)) <= ( 1 ) ) & ( (tk(P285)) <= ( 1 ) ) ) ) ) & (! ( ( 1 ) <= (tk(P524)) )) ) ) & ( (tk(P523)) <= (tk(P412)) ) )) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P234)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P195)) <= (tk(P18)) ) & ( (! ( (! ( (! ( (tk(P549)) <= (tk(P212)) )) | ( ( 1 ) <= (tk(P593)) ) )) | (! ( (! ( ( ( 1 ) <= (tk(P510)) ) | ( (tk(P426)) <= (tk(P529)) ) )) | ( ( ( 1 ) <= (tk(P411)) ) & ( ( 1 ) <= (tk(P125)) ) ) )) )) & ( ( 1 ) <= (tk(P337)) ) ) ) & ( ( 1 ) <= (tk(P306)) ) )))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-14 (reachable &!potential( (! ( ( ( (! ( ( ( ( (tk(P251)) <= (tk(P253)) ) & (! ( ( 1 ) <= (tk(P138)) )) ) | ( ( (tk(P566)) <= ( 0 ) ) & (! ( ( 1 ) <= (tk(P205)) )) ) ) | ( ( 1 ) <= (tk(P428)) ) )) & ( (tk(P439)) <= ( 1 ) ) ) | (! ( (tk(P393)) <= ( 1 ) )) ) | (! ( (! ( ( 1 ) <= (tk(P153)) )) | ( ( ( ( ( (tk(P136)) <= ( 1 ) ) | ( (tk(P2)) <= (tk(P40)) ) ) & ( ( 1 ) <= (tk(P478)) ) ) | ( ( ( (tk(P75)) <= ( 1 ) ) & ( (tk(P378)) <= (tk(P278)) ) ) | ( ( (tk(P156)) <= ( 0 ) ) & ( (tk(P402)) <= (tk(P479)) ) ) ) ) & (! ( ( ( ( 1 ) <= (tk(P531)) ) & ( (tk(P515)) <= ( 1 ) ) ) & (! ( (tk(P138)) <= (tk(P77)) )) )) ) )) ))))
PROPERTY: BusinessProcesses-PT-16-ReachabilityCardinality-15 (reachable & potential((! ( ( (tk(P486)) <= ( 0 ) ) | ( ( ( ( ( 1 ) <= (tk(P562)) ) | ( (! ( (tk(P18)) <= ( 1 ) )) | (! ( ( (tk(P468)) <= (tk(P63)) ) | (! ( (tk(P634)) <= ( 0 ) )) )) ) ) & (! ( ( (! ( (tk(P90)) <= (tk(P528)) )) & ( ( 1 ) <= (tk(P337)) ) ) | ( (! ( ( (tk(P611)) <= ( 1 ) ) | ( (tk(P70)) <= ( 1 ) ) )) | (! ( (tk(P435)) <= ( 1 ) )) ) )) ) | (! ( (! ( ( 1 ) <= (tk(P556)) )) & ( ( ( 1 ) <= (tk(P387)) ) & ( ( ( ( (tk(P209)) <= (tk(P379)) ) | ( (tk(P154)) <= ( 1 ) ) ) & ( ( (tk(P358)) <= (tk(P388)) ) & ( ( 1 ) <= (tk(P400)) ) ) ) & ( ( ( (tk(P527)) <= ( 1 ) ) | ( (tk(P278)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P110)) ) | ( (tk(P33)) <= ( 0 ) ) ) ) ) ) )) ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 13356168 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16108304 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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697000574"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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