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-167813694900575.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-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678647237083

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:53:59] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-12 18:53:59] [INFO ] Transformed 638 places.
[2023-03-12 18:53:59] [INFO ] Transformed 578 transitions.
[2023-03-12 18:53:59] [INFO ] Found NUPN structural information;
[2023-03-12 18:53:59] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-12 18:54:00] [INFO ] Computed 100 place invariants in 37 ms
[2023-03-12 18:54:01] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-12 18:54:01] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-12 18:54:01] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 18:54:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 17 ms returned sat
[2023-03-12 18:54:01] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2023-03-12 18:54:02] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-12 18:54:02] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 7 ms to minimize.
[2023-03-12 18:54:02] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 2 ms to minimize.
[2023-03-12 18:54:02] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 2 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:54:03] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:54:04] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:54:05] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:54:06] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 5 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:54:07] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-12 18:54:08] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 0 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 0 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:54:09] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 11 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 0 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:54:10] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 16 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:54:11] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 0 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 0 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2023-03-12 18:54:12] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:54:13] [INFO ] Trap strengthening (SAT) tested/added 86/85 trap constraints in 11287 ms
[2023-03-12 18:54:13] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:54:14] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2023-03-12 18:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-12 18:54:14] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:54:14] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2023-03-12 18:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-03-12 18:54:14] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 2 ms to minimize.
[2023-03-12 18:54:15] [INFO ] Deduced a trap composed of 142 places in 179 ms of which 0 ms to minimize.
[2023-03-12 18:54:15] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:54:15] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:54:15] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:54:16] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2023-03-12 18:54:16] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 0 ms to minimize.
[2023-03-12 18:54:16] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 1 ms to minimize.
[2023-03-12 18:54:16] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2023-03-12 18:54:17] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 0 ms to minimize.
[2023-03-12 18:54:17] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 0 ms to minimize.
[2023-03-12 18:54:17] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:54:17] [INFO ] Deduced a trap composed of 159 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:54:18] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 1 ms to minimize.
[2023-03-12 18:54:18] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 0 ms to minimize.
[2023-03-12 18:54:18] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:54:18] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:54:19] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 1 ms to minimize.
[2023-03-12 18:54:19] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:54:19] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:54:19] [INFO ] Deduced a trap composed of 158 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:54:20] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:54:20] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 0 ms to minimize.
[2023-03-12 18:54:20] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 0 ms to minimize.
[2023-03-12 18:54:20] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 1 ms to minimize.
[2023-03-12 18:54:21] [INFO ] Deduced a trap composed of 155 places in 210 ms of which 1 ms to minimize.
[2023-03-12 18:54:21] [INFO ] Deduced a trap composed of 147 places in 187 ms of which 0 ms to minimize.
[2023-03-12 18:54:21] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 1 ms to minimize.
[2023-03-12 18:54:22] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 0 ms to minimize.
[2023-03-12 18:54:22] [INFO ] Deduced a trap composed of 146 places in 168 ms of which 1 ms to minimize.
[2023-03-12 18:54:22] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 1 ms to minimize.
[2023-03-12 18:54:23] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 0 ms to minimize.
[2023-03-12 18:54:23] [INFO ] Deduced a trap composed of 151 places in 210 ms of which 0 ms to minimize.
[2023-03-12 18:54:24] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 1 ms to minimize.
[2023-03-12 18:54:24] [INFO ] Deduced a trap composed of 153 places in 176 ms of which 1 ms to minimize.
[2023-03-12 18:54:24] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 1 ms to minimize.
[2023-03-12 18:54:25] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 0 ms to minimize.
[2023-03-12 18:54:25] [INFO ] Deduced a trap composed of 149 places in 190 ms of which 1 ms to minimize.
[2023-03-12 18:54:25] [INFO ] Deduced a trap composed of 147 places in 186 ms of which 1 ms to minimize.
[2023-03-12 18:54:26] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 18:54:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:54:26] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 160 ms.
Support contains 47 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 624 transition count 489
Reduce places removed 80 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 87 rules applied. Total rules applied 168 place count 544 transition count 482
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 175 place count 537 transition count 482
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 175 place count 537 transition count 357
Deduced a syphon composed of 125 places in 12 ms
Ensure Unique test removed 12 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 437 place count 400 transition count 357
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 520 place count 317 transition count 274
Iterating global reduction 3 with 83 rules applied. Total rules applied 603 place count 317 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 603 place count 317 transition count 268
Deduced a syphon composed of 6 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 617 place count 309 transition count 268
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 767 place count 234 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 768 place count 234 transition count 192
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 769 place count 234 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 770 place count 233 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 771 place count 233 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 772 place count 232 transition count 190
Applied a total of 772 rules in 188 ms. Remains 232 /630 variables (removed 398) and now considering 190/570 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 232/630 places, 190/570 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1149661 steps, run timeout after 3001 ms. (steps per millisecond=383 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 1149661 steps, saw 204099 distinct states, run finished after 3002 ms. (steps per millisecond=382 ) properties seen :4
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 232 cols
[2023-03-12 18:54:30] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-12 18:54:30] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-12 18:54:30] [INFO ] [Real]Absence check using 57 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-12 18:54:30] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 18:54:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 18:54:30] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 18:54:30] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 18:54:30] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 190/190 transitions.
Graph (trivial) has 41 edges and 232 vertex of which 2 / 232 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 231 transition count 178
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 221 transition count 178
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 21 place count 221 transition count 165
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 52 place count 203 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 200 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 200 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 200 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 199 transition count 161
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 59 rules applied. Total rules applied 119 place count 168 transition count 133
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 168 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 165 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 163 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 161 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 161 transition count 127
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 597 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 158 transition count 127
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 158 transition count 125
Applied a total of 134 rules in 59 ms. Remains 158 /232 variables (removed 74) and now considering 125/190 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 158/232 places, 125/190 transitions.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31693 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/862/inv_0_ --invariant=/tmp/862/inv_1_ --invariant=/tmp/862/inv_2_ --invariant=/tmp/862/inv_3_ --invariant=/tmp/862/inv_4_ --invariant=/tmp/862/inv_5_ --invariant=/tmp/862/inv_6_ --invariant=/tmp/862/inv_7_ --invariant=/tmp/862/inv_8_ --invariant=/tmp/862/inv_9_ --invariant=/tmp/862/inv_10_ --invariant=/tmp/862/inv_11_ --invariant=/tmp/862/inv_12_ --invariant=/tmp/862/inv_13_ --invariant=/tmp/862/inv_14_ --invariant=/tmp/862/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 5023428 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16102236 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="ReachabilityFireability"
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-16, 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 r041-tajo-167813694900575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "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 ;