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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 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 156K 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678645570447

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-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:26:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:26:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:26:12] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-12 18:26:12] [INFO ] Transformed 624 places.
[2023-03-12 18:26:12] [INFO ] Transformed 564 transitions.
[2023-03-12 18:26:12] [INFO ] Found NUPN structural information;
[2023-03-12 18:26:12] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-12 18:26:14] [INFO ] Computed 99 place invariants in 44 ms
[2023-03-12 18:26:14] [INFO ] [Real]Absence check using 60 positive place invariants in 59 ms returned sat
[2023-03-12 18:26:14] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2023-03-12 18:26:15] [INFO ] After 725ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 25 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 15 places in 1181 ms of which 3 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 2 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 0 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 13 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 154 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 13 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 130 places in 135 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 11 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 132 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 133 places in 98 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 151 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 146 places in 115 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 2 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 1 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 1 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 141 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 141 places in 114 ms of which 2 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 142 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 2 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 151 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 143 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 0 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 148 places in 97 ms of which 0 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 154 places in 122 ms of which 0 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 143 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 0 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 143 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 156 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 156 places in 121 ms of which 0 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 149 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 148 places in 107 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 155 places in 120 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 144 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 150 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 147 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 156 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 157 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 155 places in 112 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 152 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 151 places in 123 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 150 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 153 places in 110 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 153 places in 105 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 152 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 142 places in 106 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 150 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 149 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 158 places in 114 ms of which 1 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 142 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 158 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:26:35] [INFO ] Deduced a trap composed of 158 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 158 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 0 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 136 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 0 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 149 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:26:36] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 152 places in 113 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 141 places in 103 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 151 places in 102 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 144 places in 134 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 151 places in 110 ms of which 0 ms to minimize.
[2023-03-12 18:26:37] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 0 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 0 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 156 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 0 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 1 ms to minimize.
[2023-03-12 18:26:38] [INFO ] Deduced a trap composed of 153 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:26:39] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:26:39] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 0 ms to minimize.
[2023-03-12 18:26:39] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 1 ms to minimize.
[2023-03-12 18:26:39] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 2 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:339)
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:26:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:26:39] [INFO ] After 25343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 117 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 610 transition count 508
Reduce places removed 47 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 59 rules applied. Total rules applied 107 place count 563 transition count 496
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 119 place count 551 transition count 496
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 119 place count 551 transition count 389
Deduced a syphon composed of 107 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 340 place count 437 transition count 389
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 402 place count 375 transition count 327
Iterating global reduction 3 with 62 rules applied. Total rules applied 464 place count 375 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 464 place count 375 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 469 place count 372 transition count 325
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 587 place count 313 transition count 266
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 592 place count 313 transition count 266
Applied a total of 592 rules in 221 ms. Remains 313 /616 variables (removed 303) and now considering 266/556 (removed 290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 313/616 places, 266/556 transitions.
Incomplete random walk after 10000 steps, including 186 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 266 rows 313 cols
[2023-03-12 18:26:40] [INFO ] Computed 86 place invariants in 9 ms
[2023-03-12 18:26:40] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 18:26:40] [INFO ] [Nat]Absence check using 54 positive place invariants in 21 ms returned sat
[2023-03-12 18:26:40] [INFO ] [Nat]Absence check using 54 positive and 32 generalized place invariants in 16 ms returned sat
[2023-03-12 18:26:41] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 18:26:41] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-12 18:26:41] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-12 18:26:41] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:26:41] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2023-03-12 18:26:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 594 ms
[2023-03-12 18:26:41] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-03-12 18:26:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 823 ms
[2023-03-12 18:26:42] [INFO ] After 2263ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-12 18:26:43] [INFO ] After 2526ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 69 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 266/266 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 313 transition count 261
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 308 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 307 transition count 260
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 12 place count 307 transition count 246
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 42 place count 291 transition count 246
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 47 place count 286 transition count 241
Iterating global reduction 3 with 5 rules applied. Total rules applied 52 place count 286 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 286 transition count 240
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 285 transition count 240
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 104 place count 259 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 106 place count 258 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 258 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 257 transition count 218
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 257 transition count 218
Applied a total of 109 rules in 109 ms. Remains 257 /313 variables (removed 56) and now considering 218/266 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 257/313 places, 218/266 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1165122 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{0=1}
Probabilistic random walk after 1165122 steps, saw 190919 distinct states, run finished after 3002 ms. (steps per millisecond=388 ) properties seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 218 rows 257 cols
[2023-03-12 18:26:46] [INFO ] Computed 82 place invariants in 7 ms
[2023-03-12 18:26:46] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:26:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 11 ms returned sat
[2023-03-12 18:26:46] [INFO ] [Nat]Absence check using 57 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-12 18:26:46] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 18:26:46] [INFO ] After 57ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:47] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-12 18:26:47] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-12 18:26:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-12 18:26:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2023-03-12 18:26:47] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 18:26:47] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 40 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 218/218 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 257 transition count 213
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 252 transition count 213
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 10 place count 252 transition count 200
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 41 place count 234 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 228 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 228 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 78 place count 215 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 214 transition count 181
Applied a total of 79 rules in 81 ms. Remains 214 /257 variables (removed 43) and now considering 181/218 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 214/257 places, 181/218 transitions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1132412 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1132412 steps, saw 201324 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 214 cols
[2023-03-12 18:26:50] [INFO ] Computed 76 place invariants in 8 ms
[2023-03-12 18:26:50] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:26:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2023-03-12 18:26:50] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-12 18:26:50] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:26:50] [INFO ] After 60ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:51] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 18:26:51] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 181/181 transitions.
Applied a total of 0 rules in 14 ms. Remains 214 /214 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 214/214 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 181/181 transitions.
Applied a total of 0 rules in 12 ms. Remains 214 /214 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-12 18:26:51] [INFO ] Invariant cache hit.
[2023-03-12 18:26:51] [INFO ] Implicit Places using invariants in 193 ms returned [27, 28, 50, 52, 54, 56, 58, 60, 62, 64, 186]
Discarding 11 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 196 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/214 places, 179/181 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 199 transition count 166
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 199 transition count 166
Applied a total of 8 rules in 15 ms. Remains 199 /203 variables (removed 4) and now considering 166/179 (removed 13) transitions.
// Phase 1: matrix 166 rows 199 cols
[2023-03-12 18:26:51] [INFO ] Computed 67 place invariants in 2 ms
[2023-03-12 18:26:51] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-12 18:26:51] [INFO ] Invariant cache hit.
[2023-03-12 18:26:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:26:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned [104, 106, 113, 115, 119, 120, 132, 133, 135, 137, 140]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 567 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/214 places, 166/181 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 188 transition count 163
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 185 transition count 163
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 179 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 178 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 178 transition count 157
Applied a total of 19 rules in 16 ms. Remains 178 /188 variables (removed 10) and now considering 157/166 (removed 9) transitions.
// Phase 1: matrix 157 rows 178 cols
[2023-03-12 18:26:51] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-12 18:26:52] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 18:26:52] [INFO ] Invariant cache hit.
[2023-03-12 18:26:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 18:26:52] [INFO ] Implicit Places using invariants and state equation in 162 ms returned [15, 18, 24, 25, 26, 27, 30, 31, 35]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 356 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 169/214 places, 155/181 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 151
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 168 transition count 151
Applied a total of 7 rules in 20 ms. Remains 168 /169 variables (removed 1) and now considering 151/155 (removed 4) transitions.
// Phase 1: matrix 151 rows 168 cols
[2023-03-12 18:26:52] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-12 18:26:52] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-12 18:26:52] [INFO ] Invariant cache hit.
[2023-03-12 18:26:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 18:26:52] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 168/214 places, 151/181 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1541 ms. Remains : 168/214 places, 151/181 transitions.
Incomplete random walk after 10000 steps, including 308 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1396801 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1396801 steps, saw 249200 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:26:55] [INFO ] Invariant cache hit.
[2023-03-12 18:26:55] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:26:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-12 18:26:55] [INFO ] [Nat]Absence check using 36 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-12 18:26:55] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 18:26:55] [INFO ] After 37ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:56] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-12 18:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-12 18:26:56] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 18:26:56] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 151/151 transitions.
Applied a total of 0 rules in 5 ms. Remains 168 /168 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 168/168 places, 151/151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 151/151 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2023-03-12 18:26:56] [INFO ] Invariant cache hit.
[2023-03-12 18:26:56] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 18:26:56] [INFO ] Invariant cache hit.
[2023-03-12 18:26:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 18:26:56] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-12 18:26:56] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 18:26:56] [INFO ] Invariant cache hit.
[2023-03-12 18:26:56] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 168/168 places, 151/151 transitions.
Graph (complete) has 494 edges and 168 vertex of which 166 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 151
Applied a total of 2 rules in 13 ms. Remains 166 /168 variables (removed 2) and now considering 151/151 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 151 rows 166 cols
[2023-03-12 18:26:56] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-12 18:26:56] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:26:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-12 18:26:56] [INFO ] [Nat]Absence check using 34 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-12 18:26:57] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:57] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-12 18:26:57] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-12 18:26:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 168 places, 151 transitions and 631 arcs took 1 ms.
[2023-03-12 18:26:57] [INFO ] Flatten gal took : 85 ms
Total runtime 45238 ms.
There are residual formulas that ITS could not solve within timeout
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/1054/inv_0_ --inv-par
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678645649588

--------------------
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
rfs formula name BusinessProcesses-PT-14-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1054/inv_0_
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 168 places, 151 transitions and 631 arcs
pnml2lts-sym: Petri net BusinessProcesses_PT_14 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 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: 151->140 groups
pnml2lts-sym: Regrouping took 0.020 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 168; there are 140 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:
pnml2lts-sym: Invariant violation (/tmp/1054/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 3.320 real 12.570 user 0.650 sys
pnml2lts-sym: max token count: 1

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-14"
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-14, 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-167813694900559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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