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.r041-tajo-167813694900566.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 ltsminxred
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 r041-tajo-167813694900566
=====================================================================

--------------------
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 1678646258445

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:37:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:37:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-12 18:37:40] [INFO ] Transformed 630 places.
[2023-03-12 18:37:40] [INFO ] Transformed 566 transitions.
[2023-03-12 18:37:40] [INFO ] Found NUPN structural information;
[2023-03-12 18:37:40] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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 66 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 12) seen :2
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 10000 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-12 18:37:41] [INFO ] Computed 102 place invariants in 25 ms
[2023-03-12 18:37:41] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2023-03-12 18:37:41] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-12 18:37:41] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 18:37:42] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2023-03-12 18:37:42] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-12 18:37:42] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-12 18:37:42] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 6 ms to minimize.
[2023-03-12 18:37:43] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 2 ms to minimize.
[2023-03-12 18:37:43] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2023-03-12 18:37:43] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 1 ms to minimize.
[2023-03-12 18:37:43] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 0 ms to minimize.
[2023-03-12 18:37:44] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2023-03-12 18:37:44] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 1 ms to minimize.
[2023-03-12 18:37:44] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 1 ms to minimize.
[2023-03-12 18:37:44] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2023-03-12 18:37:44] [INFO ] Deduced a trap composed of 148 places in 177 ms of which 0 ms to minimize.
[2023-03-12 18:37:45] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2023-03-12 18:37:45] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2023-03-12 18:37:45] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:37:45] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 1 ms to minimize.
[2023-03-12 18:37:45] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:37:46] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2023-03-12 18:37:46] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2023-03-12 18:37:46] [INFO ] Deduced a trap composed of 140 places in 183 ms of which 1 ms to minimize.
[2023-03-12 18:37:46] [INFO ] Deduced a trap composed of 136 places in 171 ms of which 0 ms to minimize.
[2023-03-12 18:37:46] [INFO ] Deduced a trap composed of 142 places in 182 ms of which 2 ms to minimize.
[2023-03-12 18:37:47] [INFO ] Deduced a trap composed of 121 places in 183 ms of which 1 ms to minimize.
[2023-03-12 18:37:47] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:37:47] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:37:47] [INFO ] Deduced a trap composed of 139 places in 200 ms of which 1 ms to minimize.
[2023-03-12 18:37:47] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 0 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 141 places in 153 ms of which 0 ms to minimize.
[2023-03-12 18:37:48] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2023-03-12 18:37:49] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:37:50] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 0 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:37:51] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2023-03-12 18:37:52] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 5 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 0 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:37:53] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 3 ms to minimize.
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2023-03-12 18:37:54] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 2 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 0 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:37:55] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-12 18:37:56] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:37:56] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2023-03-12 18:37:56] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 13428 ms
[2023-03-12 18:37:56] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 0 ms to minimize.
[2023-03-12 18:37:56] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 0 ms to minimize.
[2023-03-12 18:37:56] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:37:57] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:37:57] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:37:57] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:37:57] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 1 ms to minimize.
[2023-03-12 18:37:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1325 ms
[2023-03-12 18:37:57] [INFO ] After 15616ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-12 18:37:58] [INFO ] After 16260ms 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 110 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 1 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 1 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 176 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 176 ms. Remains : 232/626 places, 192/562 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 83 ms. (steps per millisecond=120 ) 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 422 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=211 )
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 18473 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/721/inv_0_ --invariant=/tmp/721/inv_1_ --invariant=/tmp/721/inv_2_ --invariant=/tmp/721/inv_3_ --invariant=/tmp/721/inv_4_ --invariant=/tmp/721/inv_5_ --invariant=/tmp/721/inv_6_ --invariant=/tmp/721/inv_7_ --invariant=/tmp/721/inv_8_ --invariant=/tmp/721/inv_9_ --invariant=/tmp/721/inv_10_ --invariant=/tmp/721/inv_11_ --invariant=/tmp/721/inv_12_ --invariant=/tmp/721/inv_13_ --invariant=/tmp/721/inv_14_ --invariant=/tmp/721/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 5175728 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16103496 kB
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-09
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-13
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-14
Could not compute solution for formula : BusinessProcesses-PT-15-ReachabilityCardinality-15

BK_STOP 1678649850272

--------------------
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
mcc2023
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_0_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_1_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_2_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_3_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_4_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_5_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_6_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_7_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_8_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_9_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_10_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_11_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_12_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_13_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/721/inv_14_
rfs formula name BusinessProcesses-PT-15-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/721/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 630 places, 566 transitions and 1666 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-15 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 566->566 groups
pnml2lts-sym: Regrouping took 0.170 real 0.160 user 0.000 sys
pnml2lts-sym: state vector length is 630; there are 566 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 727
Killing (9) : 727

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="ltsminxred"
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 ltsminxred"
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 r041-tajo-167813694900566"
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 ;