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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 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 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678794046064

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-15
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:40:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 11:40:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:40:47] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-14 11:40:47] [INFO ] Transformed 630 places.
[2023-03-14 11:40:47] [INFO ] Transformed 566 transitions.
[2023-03-14 11:40:47] [INFO ] Found NUPN structural information;
[2023-03-14 11:40:47] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-14 11:40:49] [INFO ] Computed 102 place invariants in 33 ms
[2023-03-14 11:40:49] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2023-03-14 11:40:49] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-14 11:40:49] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 11:40:49] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2023-03-14 11:40:49] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-14 11:40:50] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-14 11:40:50] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 9 ms to minimize.
[2023-03-14 11:40:50] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-14 11:40:51] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:40:51] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 2 ms to minimize.
[2023-03-14 11:40:51] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 0 ms to minimize.
[2023-03-14 11:40:51] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:40:51] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 1 ms to minimize.
[2023-03-14 11:40:52] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-03-14 11:40:52] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 1 ms to minimize.
[2023-03-14 11:40:52] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 1 ms to minimize.
[2023-03-14 11:40:52] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 0 ms to minimize.
[2023-03-14 11:40:53] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 1 ms to minimize.
[2023-03-14 11:40:53] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:40:53] [INFO ] Deduced a trap composed of 129 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:40:53] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:40:54] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:40:54] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:40:54] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 0 ms to minimize.
[2023-03-14 11:40:54] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:40:54] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:40:55] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:40:55] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2023-03-14 11:40:55] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 1 ms to minimize.
[2023-03-14 11:40:55] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 1 ms to minimize.
[2023-03-14 11:40:56] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2023-03-14 11:40:56] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:40:56] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2023-03-14 11:40:56] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 141 places in 213 ms of which 1 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:40:57] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:40:58] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:40:59] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 0 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2023-03-14 11:41:00] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 0 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 1 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2023-03-14 11:41:01] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 1 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 1 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 1 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 4 ms to minimize.
[2023-03-14 11:41:02] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 3 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2023-03-14 11:41:03] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 13519 ms
[2023-03-14 11:41:04] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2023-03-14 11:41:04] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:41:04] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 0 ms to minimize.
[2023-03-14 11:41:04] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:41:04] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:41:05] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 0 ms to minimize.
[2023-03-14 11:41:05] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 1 ms to minimize.
[2023-03-14 11:41:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1265 ms
[2023-03-14 11:41:05] [INFO ] After 15485ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-03-14 11:41:05] [INFO ] After 16038ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 46 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 318 edges and 626 vertex of which 7 / 626 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 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 616 transition count 436
Reduce places removed 117 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 124 rules applied. Total rules applied 243 place count 499 transition count 429
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 250 place count 492 transition count 429
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 250 place count 492 transition count 343
Deduced a syphon composed of 86 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 436 place count 392 transition count 343
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 505 place count 323 transition count 274
Iterating global reduction 3 with 69 rules applied. Total rules applied 574 place count 323 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 574 place count 323 transition count 268
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 587 place count 316 transition count 268
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 743 place count 237 transition count 191
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 745 place count 236 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 747 place count 236 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 749 place count 234 transition count 193
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 753 place count 234 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 754 place count 233 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 755 place count 232 transition count 192
Applied a total of 755 rules in 160 ms. Remains 232 /626 variables (removed 394) and now considering 192/562 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 232/626 places, 192/562 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 794 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=264 )
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 18421 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 15
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: 630 places, 566 transitions, 1666 arcs.
Final Score: 31858.666
Took : 20 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-00 (reachable & potential(( ( 1 ) <= (tk(P535)) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-01 (reachable & potential((! ( (tk(P33)) <= ( 0 ) ))))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P132)) <= ( 1 ) ) | (! ( (! ( ( ( ( (tk(P131)) <= (tk(P155)) ) & ( (tk(P122)) <= (tk(P7)) ) ) | (! ( (tk(P211)) <= (tk(P549)) )) ) & (! ( ( 1 ) <= (tk(P255)) )) )) | (! ( ( (tk(P6)) <= (tk(P177)) ) & ( ( ( 1 ) <= (tk(P176)) ) & ( (tk(P536)) <= (tk(P57)) ) ) )) )) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-03 (reachable &!potential( (! ( ( ( 1 ) <= (tk(P341)) ) | ( ( ( ( (tk(P606)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P166)) ) & ( (tk(P268)) <= (tk(P162)) ) ) ) & ( ( (tk(P478)) <= ( 1 ) ) & ( ( ( ( (tk(P312)) <= ( 0 ) ) | ( (tk(P503)) <= (tk(P129)) ) ) | ( (tk(P422)) <= (tk(P2)) ) ) | ( (! ( (tk(P450)) <= (tk(P13)) )) & ( ( 1 ) <= (tk(P224)) ) ) ) ) ) | ( ( 1 ) <= (tk(P292)) ) ) ))))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-04 (reachable & potential((! ( ( (! ( ( ( ( (! ( (tk(P624)) <= (tk(P161)) )) & ( ( (tk(P444)) <= (tk(P457)) ) & ( (tk(P588)) <= ( 1 ) ) ) ) & (! ( ( (tk(P23)) <= (tk(P459)) ) | ( (tk(P6)) <= ( 0 ) ) )) ) & (! ( ( ( (tk(P35)) <= (tk(P430)) ) & ( ( 1 ) <= (tk(P551)) ) ) | ( ( (tk(P498)) <= (tk(P482)) ) | ( (tk(P528)) <= ( 1 ) ) ) )) ) | ( ( (tk(P520)) <= (tk(P361)) ) & ( ( 1 ) <= (tk(P122)) ) ) )) & ( ( (tk(P624)) <= ( 1 ) ) & ( ( ( (tk(P493)) <= ( 1 ) ) | ( ( (tk(P476)) <= ( 1 ) ) | ( (tk(P31)) <= ( 0 ) ) ) ) | (! ( ( 1 ) <= (tk(P163)) )) ) ) ) | ( ( ( 1 ) <= (tk(P401)) ) | ( ( ( ( ( (! ( (tk(P180)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P63)) )) ) & ( (tk(P594)) <= (tk(P437)) ) ) | ( (! ( (tk(P1)) <= (tk(P441)) )) | (! ( (tk(P361)) <= ( 0 ) )) ) ) | ( ( ( 1 ) <= (tk(P20)) ) & (! ( ( (tk(P321)) <= (tk(P488)) ) & ( (tk(P423)) <= (tk(P198)) ) )) ) ) | (! ( ( ( (tk(P629)) <= (tk(P426)) ) & (! ( ( 1 ) <= (tk(P570)) )) ) & ( (! ( ( ( 1 ) <= (tk(P31)) ) | ( (tk(P414)) <= (tk(P369)) ) )) & ( (! ( (tk(P198)) <= (tk(P373)) )) & ( (tk(P594)) <= ( 1 ) ) ) ) )) ) ) ))))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P607)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-06 (reachable &!potential( ( ( (! ( ( (tk(P321)) <= ( 0 ) ) | ( ( ( ( (tk(P194)) <= ( 0 ) ) | (! ( (tk(P479)) <= (tk(P506)) )) ) & ( (! ( ( ( 1 ) <= (tk(P253)) ) | ( ( 1 ) <= (tk(P474)) ) )) & (! ( ( ( 1 ) <= (tk(P588)) ) | ( ( 1 ) <= (tk(P89)) ) )) ) ) & (! ( (tk(P452)) <= ( 1 ) )) ) )) | ( (tk(P619)) <= (tk(P291)) ) ) | ( (tk(P525)) <= (tk(P140)) ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P216)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-08 (reachable & potential(( ( ( 1 ) <= (tk(P59)) ) & ( (tk(P290)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-09 (reachable &!potential( ( (tk(P578)) <= (tk(P238)) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-10 (reachable &!potential( (! ( ( 1 ) <= (tk(P540)) ))))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-11 (reachable &!potential( ( ( (! ( ( (! ( ( ( ( (tk(P209)) <= ( 1 ) ) | ( (tk(P219)) <= (tk(P75)) ) ) | (! ( (tk(P473)) <= ( 1 ) )) ) & (! ( ( 1 ) <= (tk(P223)) )) )) & ( ( ( (tk(P145)) <= ( 1 ) ) | (! ( (tk(P190)) <= (tk(P232)) )) ) & ( ( ( ( (tk(P413)) <= ( 1 ) ) & ( (tk(P558)) <= ( 0 ) ) ) | ( ( (tk(P184)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P601)) ) ) ) & ( (tk(P286)) <= (tk(P240)) ) ) ) ) & ( (tk(P591)) <= (tk(P512)) ) )) | ( ( (! ( (tk(P366)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P226)) ) ) & ( (! ( (tk(P265)) <= (tk(P261)) )) | ( ( 1 ) <= (tk(P129)) ) ) ) ) | ( ( ( ( (tk(P281)) <= ( 1 ) ) & ( (tk(P520)) <= (tk(P115)) ) ) & ( (! ( ( ( (tk(P575)) <= ( 0 ) ) & ( ( ( (tk(P515)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P160)) ) ) & ( ( 1 ) <= (tk(P588)) ) ) ) | ( ( (tk(P446)) <= (tk(P176)) ) & ( (! ( ( 1 ) <= (tk(P604)) )) | (! ( (tk(P296)) <= (tk(P526)) )) ) ) )) | ( ( (tk(P46)) <= ( 0 ) ) & ( (tk(P470)) <= (tk(P220)) ) ) ) ) & ( (! ( ( (tk(P122)) <= ( 1 ) ) | (! ( (tk(P251)) <= ( 1 ) )) )) | ( ( ( (tk(P458)) <= (tk(P132)) ) | (! ( (tk(P619)) <= ( 0 ) )) ) & ( (tk(P572)) <= ( 0 ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P159)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-13 (reachable & potential(( ( ( ( 1 ) <= (tk(P172)) ) & (! ( ( ( ( (tk(P420)) <= ( 1 ) ) & ( ( ( ( (tk(P23)) <= (tk(P183)) ) | ( (tk(P185)) <= ( 1 ) ) ) | (! ( (tk(P227)) <= ( 0 ) )) ) & ( ( ( (tk(P342)) <= (tk(P327)) ) & ( ( 1 ) <= (tk(P64)) ) ) | ( (tk(P263)) <= (tk(P465)) ) ) ) ) | (! ( ( 1 ) <= (tk(P174)) )) ) | (! ( ( ( (! ( (tk(P146)) <= ( 0 ) )) | (! ( (tk(P440)) <= (tk(P346)) )) ) | ( (tk(P145)) <= (tk(P221)) ) ) | (! ( ( ( (tk(P505)) <= (tk(P291)) ) & ( (tk(P358)) <= ( 1 ) ) ) | ( ( (tk(P255)) <= ( 0 ) ) & ( (tk(P57)) <= (tk(P187)) ) ) )) )) )) ) & ( (! ( (! ( ( ( ( ( 1 ) <= (tk(P615)) ) | ( ( (tk(P509)) <= ( 0 ) ) & ( (tk(P365)) <= ( 0 ) ) ) ) & (! ( ( (tk(P559)) <= (tk(P186)) ) | ( ( 1 ) <= (tk(P219)) ) )) ) & ( ( 1 ) <= (tk(P424)) ) )) | ( (tk(P390)) <= ( 0 ) ) )) & (! ( ( 1 ) <= (tk(P273)) )) ) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-14 (reachable &!potential( ( ( (! ( ( ( ( ( ( ( 1 ) <= (tk(P29)) ) & ( (tk(P517)) <= ( 0 ) ) ) | ( ( (tk(P408)) <= ( 0 ) ) | ( (tk(P443)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P191)) ) ) & (! ( ( ( 1 ) <= (tk(P311)) ) & ( ( 1 ) <= (tk(P156)) ) )) ) & ( (! ( ( (tk(P30)) <= ( 1 ) ) | ( ( (tk(P506)) <= (tk(P359)) ) | ( ( 1 ) <= (tk(P189)) ) ) )) & ( ( 1 ) <= (tk(P455)) ) ) )) | ( (! ( ( ( (! ( ( (tk(P142)) <= (tk(P74)) ) | ( ( 1 ) <= (tk(P344)) ) )) | ( ( ( ( 1 ) <= (tk(P286)) ) | ( (tk(P450)) <= (tk(P278)) ) ) | (! ( ( 1 ) <= (tk(P579)) )) ) ) & ( ( 1 ) <= (tk(P604)) ) ) & (! ( (! ( ( ( 1 ) <= (tk(P206)) ) | ( (tk(P281)) <= (tk(P615)) ) )) | ( ( ( ( 1 ) <= (tk(P339)) ) & ( (tk(P237)) <= (tk(P506)) ) ) & ( ( 1 ) <= (tk(P218)) ) ) )) )) & (! ( ( (! ( ( ( ( 1 ) <= (tk(P276)) ) & ( ( 1 ) <= (tk(P618)) ) ) & (! ( (tk(P430)) <= ( 1 ) )) )) & ( ( (! ( (tk(P91)) <= ( 0 ) )) & ( ( (tk(P349)) <= (tk(P265)) ) | ( ( 1 ) <= (tk(P498)) ) ) ) | ( (tk(P455)) <= (tk(P461)) ) ) ) | (! ( ( ( (tk(P362)) <= (tk(P374)) ) & ( (tk(P190)) <= (tk(P309)) ) ) | (! ( (tk(P358)) <= ( 1 ) )) )) )) ) ) | (! ( ( (tk(P147)) <= ( 0 ) ) | ( ( (! ( ( ( (tk(P238)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P371)) ) & ( ( 1 ) <= (tk(P79)) ) ) ) & ( ( ( (tk(P629)) <= ( 1 ) ) & ( (tk(P232)) <= (tk(P81)) ) ) & (! ( ( 1 ) <= (tk(P121)) )) ) )) | (! ( ( ( 1 ) <= (tk(P471)) ) | ( (! ( ( 1 ) <= (tk(P604)) )) & ( ( (tk(P418)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P515)) ) ) ) )) ) | ( (tk(P283)) <= ( 1 ) ) ) )) )))
PROPERTY: BusinessProcesses-PT-15-ReachabilityCardinality-15 (reachable & potential((! ( ( ( ( (tk(P97)) <= (tk(P308)) ) | ( ( ( (! ( (tk(P405)) <= (tk(P222)) )) & (! ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P384)) ) )) ) & ( ( ( 1 ) <= (tk(P185)) ) & ( ( 1 ) <= (tk(P20)) ) ) ) & ( ( ( (! ( (tk(P617)) <= ( 1 ) )) | (! ( (tk(P343)) <= ( 1 ) )) ) | (! ( (tk(P387)) <= (tk(P281)) )) ) & (! ( ( (tk(P82)) <= ( 0 ) ) | ( (tk(P393)) <= ( 0 ) ) )) ) ) ) | ( ( 1 ) <= (tk(P310)) ) ) | ( ( (tk(P285)) <= ( 1 ) ) & ( ( ( ( ( 1 ) <= (tk(P64)) ) & ( ( ( (tk(P204)) <= (tk(P229)) ) | ( (tk(P516)) <= (tk(P483)) ) ) & ( ( (tk(P255)) <= (tk(P192)) ) & (! ( ( 1 ) <= (tk(P271)) )) ) ) ) & ( ( 1 ) <= (tk(P562)) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P13)) ) & ( ( (tk(P279)) <= (tk(P590)) ) | ( (tk(P411)) <= ( 1 ) ) ) ) | ( (tk(P480)) <= ( 1 ) ) )) & ( (tk(P383)) <= (tk(P71)) ) ) ) ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13699800 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16106868 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:
++ 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 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-15"
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-15, 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-167813697000566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 ;