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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 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 104K 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-09-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678791099778

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-09
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:51:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:51:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:51:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-14 10:51:42] [INFO ] Transformed 403 places.
[2023-03-14 10:51:42] [INFO ] Transformed 374 transitions.
[2023-03-14 10:51:42] [INFO ] Found NUPN structural information;
[2023-03-14 10:51:42] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 107 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 13) seen :7
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 374 rows 403 cols
[2023-03-14 10:51:43] [INFO ] Computed 65 place invariants in 33 ms
[2023-03-14 10:51:43] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-14 10:51:43] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-14 10:51:43] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 10:51:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 24 ms returned sat
[2023-03-14 10:51:44] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-14 10:51:44] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-14 10:51:44] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 18 ms to minimize.
[2023-03-14 10:51:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-14 10:51:44] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 2 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 0 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:51:45] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-03-14 10:51:46] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 0 ms to minimize.
[2023-03-14 10:51:47] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 1 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 0 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 0 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 3 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 0 ms to minimize.
[2023-03-14 10:51:48] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 0 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 0 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 2 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 0 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 5007 ms
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:51:49] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2023-03-14 10:51:50] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 0 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1476 ms
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 4 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-14 10:51:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-14 10:51:51] [INFO ] After 7608ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-14 10:51:51] [INFO ] After 8242ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 58 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 403 transition count 343
Reduce places removed 31 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 37 rules applied. Total rules applied 68 place count 372 transition count 337
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 place count 366 transition count 337
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 74 place count 366 transition count 258
Deduced a syphon composed of 79 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 234 place count 285 transition count 258
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 274 place count 245 transition count 218
Iterating global reduction 3 with 40 rules applied. Total rules applied 314 place count 245 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 314 place count 245 transition count 217
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 316 place count 244 transition count 217
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 400 place count 202 transition count 175
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 202 transition count 175
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 406 place count 202 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 201 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 408 place count 200 transition count 174
Applied a total of 408 rules in 164 ms. Remains 200 /403 variables (removed 203) and now considering 174/374 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 200/403 places, 174/374 transitions.
Incomplete random walk after 10000 steps, including 277 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :3
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 200 cols
[2023-03-14 10:51:52] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-14 10:51:52] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:51:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2023-03-14 10:51:52] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2023-03-14 10:51:52] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-14 10:51:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 665 ms
[2023-03-14 10:51:53] [INFO ] After 873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-14 10:51:53] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 174/174 transitions.
Graph (trivial) has 22 edges and 200 vertex of which 2 / 200 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 626 edges and 199 vertex of which 197 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 197 transition count 168
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 194 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 193 transition count 167
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 193 transition count 162
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 21 place count 187 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 184 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 184 transition count 159
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 51 place count 171 transition count 148
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 171 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 170 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 169 transition count 146
Applied a total of 54 rules in 67 ms. Remains 169 /200 variables (removed 31) and now considering 146/174 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 169/200 places, 146/174 transitions.
Incomplete random walk after 10000 steps, including 364 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 201 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=201 )
FORMULA BusinessProcesses-PT-09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 11861 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 09
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: 403 places, 374 transitions, 1148 arcs.
Final Score: 13378.704
Took : 13 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-00 (reachable & potential((! ( (tk(P384)) <= (tk(P272)) ))))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-01 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P340)) )) | (! ( ( (! ( (! ( (tk(P102)) <= ( 0 ) )) | (! ( (tk(P389)) <= (tk(P306)) )) )) & (! ( ( 1 ) <= (tk(P364)) )) ) & ( ( (! ( ( (tk(P95)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P354)) ) | ( ( 1 ) <= (tk(P388)) ) ) )) | (! ( ( (tk(P248)) <= ( 0 ) ) & ( ( (tk(P330)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P302)) ) ) )) ) | ( (! ( (! ( ( 1 ) <= (tk(P332)) )) & ( ( (tk(P382)) <= (tk(P359)) ) | ( (tk(P34)) <= (tk(P393)) ) ) )) | ( (! ( (tk(P362)) <= ( 0 ) )) & ( (tk(P197)) <= ( 0 ) ) ) ) ) )) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P139)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (! ( (tk(P332)) <= ( 1 ) )) | ( (tk(P229)) <= (tk(P99)) ) ) & ( ( ( (! ( (! ( ( 1 ) <= (tk(P43)) )) | ( (tk(P244)) <= (tk(P368)) ) )) | ( ( (tk(P331)) <= ( 0 ) ) & ( ( ( (tk(P379)) <= (tk(P94)) ) & ( (tk(P403)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P321)) )) ) ) ) | ( ( 1 ) <= (tk(P300)) ) ) | ( (! ( (! ( (tk(P309)) <= (tk(P280)) )) & ( ( ( (tk(P11)) <= ( 1 ) ) & ( (tk(P300)) <= (tk(P125)) ) ) & ( ( (tk(P119)) <= (tk(P14)) ) | ( (tk(P292)) <= ( 1 ) ) ) ) )) & (! ( (tk(P63)) <= (tk(P335)) )) ) ) ) | ( ( 1 ) <= (tk(P89)) ) ) & (! ( ( ( ( ( ( 1 ) <= (tk(P93)) ) | ( ( 1 ) <= (tk(P12)) ) ) | ( ( ( (tk(P211)) <= ( 0 ) ) & (! ( (tk(P280)) <= ( 1 ) )) ) & (! ( ( (tk(P308)) <= ( 0 ) ) & ( (tk(P375)) <= (tk(P248)) ) )) ) ) | ( ( 1 ) <= (tk(P146)) ) ) | ( (! ( (! ( ( ( (tk(P394)) <= ( 0 ) ) | ( (tk(P203)) <= ( 1 ) ) ) & ( ( (tk(P102)) <= (tk(P319)) ) | ( (tk(P46)) <= ( 0 ) ) ) )) & ( (! ( ( (tk(P31)) <= (tk(P342)) ) | ( (tk(P281)) <= (tk(P295)) ) )) & ( ( 1 ) <= (tk(P377)) ) ) )) | ( (tk(P47)) <= (tk(P391)) ) ) )) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-04 (reachable & potential((! ( (tk(P109)) <= ( 1 ) ))))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-05 (reachable & potential(( ( 1 ) <= (tk(P333)) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-06 (reachable &!potential( ( ( ( ( (tk(P246)) <= (tk(P83)) ) | ( (tk(P122)) <= (tk(P30)) ) ) & (! ( ( 1 ) <= (tk(P100)) )) ) & (! ( ( 1 ) <= (tk(P183)) )) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-07 (reachable & potential(( ( ( 1 ) <= (tk(P138)) ) | ( (! ( (tk(P49)) <= ( 1 ) )) | ( ( (! ( (tk(P73)) <= (tk(P168)) )) | (! ( (! ( ( (tk(P86)) <= (tk(P226)) ) & (! ( ( 1 ) <= (tk(P376)) )) )) | ( ( ( ( (tk(P118)) <= ( 1 ) ) | ( (tk(P358)) <= (tk(P34)) ) ) | ( (tk(P277)) <= ( 1 ) ) ) & ( ( ( (tk(P391)) <= (tk(P220)) ) | ( ( 1 ) <= (tk(P265)) ) ) | ( (tk(P120)) <= (tk(P72)) ) ) ) )) ) & (! ( ( ( (! ( (tk(P311)) <= ( 0 ) )) & ( (! ( (tk(P397)) <= (tk(P393)) )) & ( ( 1 ) <= (tk(P71)) ) ) ) & ( ( (tk(P307)) <= (tk(P5)) ) & ( ( ( (tk(P81)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P161)) ) ) & ( ( (tk(P219)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P241)) ) ) ) ) ) | (! ( ( (! ( (tk(P219)) <= ( 1 ) )) & ( ( 1 ) <= (tk(P16)) ) ) & ( ( ( ( 1 ) <= (tk(P356)) ) | ( (tk(P242)) <= (tk(P340)) ) ) & ( ( (tk(P174)) <= ( 1 ) ) & ( (tk(P332)) <= (tk(P160)) ) ) ) )) )) ) ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-08 (reachable &!potential( (! ( ( 1 ) <= (tk(P317)) ))))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-09 (reachable & potential(( ( ( ( (tk(P283)) <= (tk(P285)) ) | ( ( (! ( ( ( ( ( 1 ) <= (tk(P244)) ) | ( ( 1 ) <= (tk(P163)) ) ) | (! ( ( 1 ) <= (tk(P329)) )) ) | ( ( ( (tk(P263)) <= ( 1 ) ) & ( (tk(P169)) <= (tk(P43)) ) ) & ( ( (tk(P177)) <= ( 0 ) ) & ( (tk(P362)) <= (tk(P259)) ) ) ) )) & ( ( (! ( ( ( 1 ) <= (tk(P277)) ) | ( (tk(P154)) <= ( 1 ) ) )) | ( (! ( (tk(P275)) <= ( 0 ) )) & ( ( (tk(P291)) <= (tk(P186)) ) & ( (tk(P357)) <= ( 1 ) ) ) ) ) | ( (! ( (tk(P368)) <= ( 1 ) )) & ( (! ( ( 1 ) <= (tk(P335)) )) | (! ( (tk(P300)) <= (tk(P352)) )) ) ) ) ) & ( ( 1 ) <= (tk(P312)) ) ) ) | (! ( (! ( ( (tk(P249)) <= (tk(P133)) ) & ( (tk(P52)) <= ( 0 ) ) )) & (! ( ( (tk(P111)) <= ( 1 ) ) | ( ( (tk(P129)) <= ( 0 ) ) | ( (tk(P300)) <= ( 1 ) ) ) )) )) ) & (! ( (tk(P21)) <= ( 0 ) )) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-10 (reachable &!potential( ( ( ( 1 ) <= (tk(P182)) ) | ( ( (! ( (tk(P284)) <= ( 0 ) )) | (! ( ( (tk(P362)) <= (tk(P366)) ) & ( ( 1 ) <= (tk(P142)) ) )) ) | ( ( ( ( ( ( (tk(P143)) <= ( 1 ) ) & ( (! ( ( 1 ) <= (tk(P339)) )) & ( ( ( 1 ) <= (tk(P79)) ) & ( (tk(P331)) <= ( 1 ) ) ) ) ) & ( (tk(P189)) <= (tk(P86)) ) ) & ( (! ( (! ( (tk(P273)) <= (tk(P121)) )) | ( ( ( 1 ) <= (tk(P380)) ) & ( (tk(P34)) <= (tk(P225)) ) ) )) | ( ( ( ( (tk(P75)) <= (tk(P357)) ) & ( (tk(P109)) <= ( 0 ) ) ) & ( ( (tk(P271)) <= (tk(P76)) ) & ( ( 1 ) <= (tk(P100)) ) ) ) & (! ( ( 1 ) <= (tk(P401)) )) ) ) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P175)) ) | ( (tk(P301)) <= ( 1 ) ) ) & (! ( (tk(P242)) <= ( 1 ) )) ) | ( ( (tk(P296)) <= (tk(P257)) ) | ( (tk(P119)) <= ( 1 ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P115)) )) | ( (tk(P89)) <= (tk(P225)) ) ) | (! ( (tk(P87)) <= (tk(P308)) )) ) ) & ( (tk(P174)) <= (tk(P26)) ) ) ) & (! ( ( ( ( ( (tk(P80)) <= ( 0 ) ) & ( (tk(P110)) <= (tk(P256)) ) ) | ( ( ( ( 1 ) <= (tk(P281)) ) & ( ( 1 ) <= (tk(P378)) ) ) & ( (tk(P23)) <= (tk(P236)) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P180)) ) | ( (tk(P349)) <= (tk(P37)) ) ) & (! ( (tk(P245)) <= ( 0 ) )) ) | (! ( (tk(P57)) <= ( 0 ) )) ) ) & (! ( ( (tk(P377)) <= (tk(P388)) ) & ( ( ( (tk(P284)) <= (tk(P153)) ) & ( (tk(P50)) <= ( 1 ) ) ) & ( (tk(P157)) <= ( 1 ) ) ) )) )) ) ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-11 (reachable &!potential( ( (tk(P241)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-12 (reachable & potential(( ( ( ( (! ( ( (tk(P12)) <= ( 1 ) ) & ( (! ( ( (tk(P356)) <= ( 0 ) ) & ( (tk(P140)) <= ( 0 ) ) )) & ( ( ( (tk(P71)) <= (tk(P218)) ) & ( (tk(P190)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P148)) ) & ( (tk(P259)) <= ( 1 ) ) ) ) ) )) | (! ( (! ( ( 1 ) <= (tk(P117)) )) | ( ( (tk(P102)) <= (tk(P249)) ) | (! ( (tk(P377)) <= (tk(P33)) )) ) )) ) | (! ( ( ( 1 ) <= (tk(P372)) ) & ( ( (tk(P293)) <= (tk(P399)) ) | ( ( ( (tk(P127)) <= (tk(P307)) ) | ( ( ( 1 ) <= (tk(P191)) ) | ( (tk(P22)) <= (tk(P269)) ) ) ) | ( (tk(P291)) <= (tk(P147)) ) ) ) )) ) & ( ( 1 ) <= (tk(P266)) ) ) & ( (! ( ( ( 1 ) <= (tk(P27)) ) | ( (tk(P220)) <= ( 1 ) ) )) & ( ( (tk(P288)) <= ( 0 ) ) & ( (tk(P82)) <= (tk(P367)) ) ) ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-13 (reachable & potential((! ( ( (! ( ( ( ( ( ( ( 1 ) <= (tk(P322)) ) | ( (tk(P363)) <= ( 1 ) ) ) | (! ( (tk(P176)) <= ( 0 ) )) ) | ( ( ( (tk(P184)) <= (tk(P324)) ) & ( (tk(P312)) <= ( 1 ) ) ) | (! ( (tk(P316)) <= ( 0 ) )) ) ) & ( ( (! ( (tk(P254)) <= (tk(P258)) )) & ( ( 1 ) <= (tk(P335)) ) ) | (! ( ( (tk(P22)) <= ( 1 ) ) & ( (tk(P316)) <= ( 0 ) ) )) ) ) & (! ( ( 1 ) <= (tk(P10)) )) )) | ( ( ( (tk(P311)) <= (tk(P194)) ) | ( ( 1 ) <= (tk(P27)) ) ) | ( ( 1 ) <= (tk(P174)) ) ) ) & ( ( (! ( ( ( 1 ) <= (tk(P307)) ) | ( (tk(P171)) <= (tk(P361)) ) )) & ( ( 1 ) <= (tk(P228)) ) ) | ( (tk(P250)) <= (tk(P298)) ) ) ))))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( (! ( (tk(P91)) <= ( 0 ) )) | ( (tk(P351)) <= ( 1 ) ) ) & ( ( ( ( (tk(P318)) <= (tk(P272)) ) & ( (tk(P234)) <= (tk(P334)) ) ) & ( (tk(P26)) <= ( 0 ) ) ) & (! ( ( ( ( ( 1 ) <= (tk(P244)) ) & ( ( (tk(P51)) <= ( 1 ) ) | ( (tk(P38)) <= (tk(P81)) ) ) ) & ( (! ( ( 1 ) <= (tk(P92)) )) & ( (tk(P54)) <= (tk(P139)) ) ) ) | ( ( 1 ) <= (tk(P369)) ) )) ) ) & ( ( ( ( (tk(P227)) <= ( 0 ) ) & ( ( (! ( ( 1 ) <= (tk(P283)) )) & (! ( ( ( 1 ) <= (tk(P168)) ) | ( (tk(P303)) <= (tk(P329)) ) )) ) & ( ( ( ( (tk(P284)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P138)) ) ) | ( ( ( 1 ) <= (tk(P17)) ) | ( (tk(P7)) <= ( 1 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P332)) )) | ( ( (tk(P224)) <= (tk(P349)) ) | ( (tk(P102)) <= ( 1 ) ) ) ) ) ) ) | ( (! ( (tk(P72)) <= ( 0 ) )) & ( ( (tk(P184)) <= ( 1 ) ) | ( (tk(P270)) <= ( 1 ) ) ) ) ) & ( ( (tk(P258)) <= ( 0 ) ) | (! ( (! ( (tk(P27)) <= ( 0 ) )) | (! ( ( ( (tk(P339)) <= (tk(P218)) ) | ( ( 1 ) <= (tk(P99)) ) ) | ( ( (tk(P196)) <= ( 1 ) ) & ( (tk(P18)) <= ( 1 ) ) ) )) )) ) ) ) | ( (tk(P105)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-09-ReachabilityCardinality-15 (reachable & potential(( (! ( (tk(P129)) <= ( 0 ) )) & (! ( ( 1 ) <= (tk(P330)) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5930920 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16107472 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-09"
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-09, 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-167813696900518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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