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.r042-tajo-167813695900519.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 marciexred
Input is BusinessProcesses-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900519
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678730778268

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:06:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:06:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:06:20] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-13 18:06:20] [INFO ] Transformed 403 places.
[2023-03-13 18:06:20] [INFO ] Transformed 374 transitions.
[2023-03-13 18:06:20] [INFO ] Found NUPN structural information;
[2023-03-13 18:06:20] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 103 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 374 rows 403 cols
[2023-03-13 18:06:21] [INFO ] Computed 65 place invariants in 57 ms
[2023-03-13 18:06:21] [INFO ] [Real]Absence check using 36 positive place invariants in 75 ms returned sat
[2023-03-13 18:06:21] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-13 18:06:21] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 18:06:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2023-03-13 18:06:22] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-13 18:06:22] [INFO ] After 797ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 8 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-13 18:06:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 803 ms
[2023-03-13 18:06:23] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 0 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:06:24] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 94 places in 225 ms of which 1 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 0 ms to minimize.
[2023-03-13 18:06:25] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 0 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 0 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 0 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 1 ms to minimize.
[2023-03-13 18:06:26] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 1 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 0 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:06:27] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 1 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 5 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 1 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 0 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:06:28] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:06:29] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 0 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 2 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 0 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:06:30] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 5 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 102 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:06:31] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 0 ms to minimize.
[2023-03-13 18:06:32] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:06:32] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:06:32] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2023-03-13 18:06:32] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:06:32] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:06:33] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 0 ms to minimize.
[2023-03-13 18:06:33] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 1 ms to minimize.
[2023-03-13 18:06:33] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2023-03-13 18:06:33] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:06:33] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 0 ms to minimize.
[2023-03-13 18:06:34] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 1 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 1 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 0 ms to minimize.
[2023-03-13 18:06:35] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 0 ms to minimize.
[2023-03-13 18:06:36] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:06:37] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-13 18:06:37] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 0 ms to minimize.
[2023-03-13 18:06:37] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 0 ms to minimize.
[2023-03-13 18:06:37] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 1 ms to minimize.
[2023-03-13 18:06:38] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 0 ms to minimize.
[2023-03-13 18:06:38] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 14481 ms
[2023-03-13 18:06:39] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-13 18:06:39] [INFO ] After 16924ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :5
Attempting to minimize the solution found.
Minimization took 506 ms.
[2023-03-13 18:06:39] [INFO ] After 17630ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :5
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 33 ms.
Support contains 75 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 374/374 transitions.
Graph (complete) has 845 edges and 403 vertex of which 401 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 401 transition count 338
Reduce places removed 35 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 40 rules applied. Total rules applied 76 place count 366 transition count 333
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 81 place count 361 transition count 333
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 81 place count 361 transition count 263
Deduced a syphon composed of 70 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 224 place count 288 transition count 263
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 263 place count 249 transition count 224
Iterating global reduction 3 with 39 rules applied. Total rules applied 302 place count 249 transition count 224
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 374 place count 213 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 376 place count 212 transition count 191
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 381 place count 212 transition count 191
Applied a total of 381 rules in 139 ms. Remains 212 /403 variables (removed 191) and now considering 191/374 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 212/403 places, 191/374 transitions.
Incomplete random walk after 10000 steps, including 254 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1328943 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1328943 steps, saw 213105 distinct states, run finished after 3014 ms. (steps per millisecond=440 ) properties seen :2
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 212 cols
[2023-03-13 18:06:43] [INFO ] Computed 61 place invariants in 11 ms
[2023-03-13 18:06:43] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:06:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-13 18:06:43] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 5 ms returned sat
[2023-03-13 18:06:43] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:06:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:06:43] [INFO ] After 94ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:06:43] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:06:43] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:06:43] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2023-03-13 18:06:44] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2023-03-13 18:06:45] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2023-03-13 18:06:46] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:06:46] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:06:46] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:06:46] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2023-03-13 18:06:46] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2921 ms
[2023-03-13 18:06:46] [INFO ] After 3071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-13 18:06:46] [INFO ] After 3288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 26 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 191/191 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 212 transition count 185
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 206 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 205 transition count 184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 14 place count 205 transition count 171
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 45 place count 187 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 185 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 185 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 49 place count 185 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 183 transition count 167
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 163 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 162 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 161 transition count 146
Applied a total of 95 rules in 84 ms. Remains 161 /212 variables (removed 51) and now considering 146/191 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 161/212 places, 146/191 transitions.
Incomplete random walk after 10000 steps, including 481 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 145662 steps, run visited all 1 properties in 271 ms. (steps per millisecond=537 )
Probabilistic random walk after 145662 steps, saw 36936 distinct states, run finished after 271 ms. (steps per millisecond=537 ) properties seen :1
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 26829 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_09
(NrP: 403 NrTr: 374 NrArc: 1148)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.014sec

net check time: 0m 0.000sec

init dd package: 0m 3.141sec


before gc: list nodes free: 1975914

after gc: idd nodes used:53974057, unused:10025943; list nodes free:43721725

before gc: list nodes free: 646161

after gc: idd nodes used:54236201, unused:9763799; list nodes free:41493501

before gc: list nodes free: 1058675

after gc: idd nodes used:56726569, unused:7273431; list nodes free:31794173

RS generation: 46m19.150sec


-> last computed set: #nodes 56726168 (5.7e+07) #states 82,318,191,885 (10)


CANNOT_COMPUTE


BK_STOP 1678733624096

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.013sec

idd.cc:820: DD Exception: No free nodes

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="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695900519"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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