fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r039-tajo-167813692700551
Last Updated
May 14, 2023

About the Execution of LoLa+red for BusinessProcesses-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.147 31365.00 47330.00 68.20 TTFFTTFFTTTTTTTT normal

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.r039-tajo-167813692700551.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 lolaxred
Input is BusinessProcesses-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700551
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678503218658

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:53:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:53:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:53:40] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-11 02:53:40] [INFO ] Transformed 593 places.
[2023-03-11 02:53:40] [INFO ] Transformed 536 transitions.
[2023-03-11 02:53:40] [INFO ] Found NUPN structural information;
[2023-03-11 02:53:40] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-11 02:53:41] [INFO ] Computed 95 place invariants in 31 ms
[2023-03-11 02:53:42] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:53:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 34 ms returned sat
[2023-03-11 02:53:42] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-11 02:53:43] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 7 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:53:43] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:53:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1690 ms
[2023-03-11 02:53:45] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 0 ms to minimize.
[2023-03-11 02:53:45] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:53:45] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:53:45] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 1 ms to minimize.
[2023-03-11 02:53:45] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 0 ms to minimize.
[2023-03-11 02:53:46] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:53:46] [INFO ] Deduced a trap composed of 137 places in 249 ms of which 1 ms to minimize.
[2023-03-11 02:53:46] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:53:46] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2023-03-11 02:53:46] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:53:47] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 1 ms to minimize.
[2023-03-11 02:53:47] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-11 02:53:47] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 1 ms to minimize.
[2023-03-11 02:53:47] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:53:47] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 0 ms to minimize.
[2023-03-11 02:53:48] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:53:48] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 1 ms to minimize.
[2023-03-11 02:53:48] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:53:48] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:53:48] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:53:49] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 1 ms to minimize.
[2023-03-11 02:53:49] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:53:49] [INFO ] Deduced a trap composed of 135 places in 187 ms of which 2 ms to minimize.
[2023-03-11 02:53:49] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 2 ms to minimize.
[2023-03-11 02:53:49] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 1 ms to minimize.
[2023-03-11 02:53:50] [INFO ] Deduced a trap composed of 128 places in 180 ms of which 1 ms to minimize.
[2023-03-11 02:53:50] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:53:50] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 2 ms to minimize.
[2023-03-11 02:53:50] [INFO ] Deduced a trap composed of 122 places in 298 ms of which 1 ms to minimize.
[2023-03-11 02:53:51] [INFO ] Deduced a trap composed of 134 places in 238 ms of which 1 ms to minimize.
[2023-03-11 02:53:51] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 0 ms to minimize.
[2023-03-11 02:53:51] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:53:51] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:53:51] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 1 ms to minimize.
[2023-03-11 02:53:52] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:53:52] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:53:52] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:53:52] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 1 ms to minimize.
[2023-03-11 02:53:52] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
[2023-03-11 02:53:53] [INFO ] Deduced a trap composed of 156 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:53:54] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:53:54] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:53:54] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 0 ms to minimize.
[2023-03-11 02:53:54] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:53:54] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:53:55] [INFO ] Deduced a trap composed of 131 places in 170 ms of which 1 ms to minimize.
[2023-03-11 02:53:55] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:53:55] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:53:55] [INFO ] Deduced a trap composed of 132 places in 156 ms of which 1 ms to minimize.
[2023-03-11 02:53:55] [INFO ] Deduced a trap composed of 133 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:53:56] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 5 ms to minimize.
[2023-03-11 02:53:56] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:53:56] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:53:56] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 1 ms to minimize.
[2023-03-11 02:53:56] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 1 ms to minimize.
[2023-03-11 02:53:57] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:53:57] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 0 ms to minimize.
[2023-03-11 02:53:57] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:53:57] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:53:57] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:53:58] [INFO ] Deduced a trap composed of 132 places in 175 ms of which 0 ms to minimize.
[2023-03-11 02:53:58] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 0 ms to minimize.
[2023-03-11 02:53:58] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 0 ms to minimize.
[2023-03-11 02:53:58] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 55 places in 161 ms of which 0 ms to minimize.
[2023-03-11 02:53:59] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2023-03-11 02:54:00] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 0 ms to minimize.
[2023-03-11 02:54:00] [INFO ] Deduced a trap composed of 129 places in 194 ms of which 0 ms to minimize.
[2023-03-11 02:54:00] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 0 ms to minimize.
[2023-03-11 02:54:00] [INFO ] Deduced a trap composed of 129 places in 167 ms of which 0 ms to minimize.
[2023-03-11 02:54:01] [INFO ] Deduced a trap composed of 127 places in 175 ms of which 1 ms to minimize.
[2023-03-11 02:54:01] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 0 ms to minimize.
[2023-03-11 02:54:01] [INFO ] Deduced a trap composed of 141 places in 185 ms of which 1 ms to minimize.
[2023-03-11 02:54:01] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:54:01] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:54:02] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:54:03] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:54:03] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2023-03-11 02:54:03] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:54:03] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 0 ms to minimize.
[2023-03-11 02:54:04] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 0 ms to minimize.
[2023-03-11 02:54:04] [INFO ] Deduced a trap composed of 142 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:54:04] [INFO ] Deduced a trap composed of 128 places in 190 ms of which 1 ms to minimize.
[2023-03-11 02:54:04] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2023-03-11 02:54:04] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:54:05] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 0 ms to minimize.
[2023-03-11 02:54:06] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 0 ms to minimize.
[2023-03-11 02:54:06] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2023-03-11 02:54:06] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:54:06] [INFO ] Deduced a trap composed of 128 places in 191 ms of which 1 ms to minimize.
[2023-03-11 02:54:06] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 1 ms to minimize.
[2023-03-11 02:54:07] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 2 ms to minimize.
[2023-03-11 02:54:07] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:54:07] [INFO ] Deduced a trap composed of 126 places in 160 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-11 02:54:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:54:07] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 6 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 329 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 573 transition count 391
Reduce places removed 128 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 445 transition count 389
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 262 place count 443 transition count 304
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 449 place count 341 transition count 304
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 523 place count 267 transition count 230
Iterating global reduction 3 with 74 rules applied. Total rules applied 597 place count 267 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 597 place count 267 transition count 222
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 615 place count 257 transition count 222
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 795 place count 166 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 797 place count 165 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 799 place count 165 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 801 place count 163 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 802 place count 163 transition count 135
Applied a total of 802 rules in 156 ms. Remains 163 /585 variables (removed 422) and now considering 135/528 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 163/585 places, 135/528 transitions.
Finished random walk after 446 steps, including 17 resets, run visited all 4 properties in 9 ms. (steps per millisecond=49 )
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27522 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-13
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityFireability

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503250023

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:147
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:150
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:150
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 8 transitions removed,8 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH INITIAL
lola: LAUNCH task # 10 (type CNST) for 9 BusinessProcesses-PT-13-ReachabilityFireability-03
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 10 (type CNST) for BusinessProcesses-PT-13-ReachabilityFireability-03
lola: result : false
lola: LAUNCH INITIAL
lola: LAUNCH task # 13 (type CNST) for 12 BusinessProcesses-PT-13-ReachabilityFireability-04
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 13 (type CNST) for BusinessProcesses-PT-13-ReachabilityFireability-04
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 67 (type EXCL) for 3 BusinessProcesses-PT-13-ReachabilityFireability-01
lola: time limit : 199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 55 (type FNDP) for 36 BusinessProcesses-PT-13-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type EQUN) for 36 BusinessProcesses-PT-13-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 59 (type SRCH) for 36 BusinessProcesses-PT-13-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH INITIAL
lola: LAUNCH task # 16 (type CNST) for 15 BusinessProcesses-PT-13-ReachabilityFireability-05
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 55 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-12
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 16 (type CNST) for BusinessProcesses-PT-13-ReachabilityFireability-05
lola: result : true
lola: CANCELED task # 56 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 59 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 50 (type FNDP) for 18 BusinessProcesses-PT-13-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 18 BusinessProcesses-PT-13-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type SRCH) for 18 BusinessProcesses-PT-13-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 62 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-06
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 50 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 51 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-06 (obsolete)
lola: LAUNCH task # 48 (type FNDP) for 24 BusinessProcesses-PT-13-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 24 BusinessProcesses-PT-13-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 24 BusinessProcesses-PT-13-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 56 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-12
lola: result : unknown
lola: FINISHED task # 48 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 426
lola: tried executions : 62
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 49 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 69 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 53 (type FNDP) for 3 BusinessProcesses-PT-13-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 3 BusinessProcesses-PT-13-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 66 (type SRCH) for 3 BusinessProcesses-PT-13-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-51.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-49.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 49 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-08
lola: result : true

lola: FINISHED task # 51 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-06
lola: result : unknown
lola: FINISHED task # 67 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-01
lola: result : false
lola: markings : 8908
lola: fired transitions : 11221
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 53 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 54 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 66 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-01 (obsolete)
lola: LAUNCH task # 111 (type EXCL) for 27 BusinessProcesses-PT-13-ReachabilityFireability-09
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 91 (type FNDP) for 6 BusinessProcesses-PT-13-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type EQUN) for 6 BusinessProcesses-PT-13-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 117 (type SRCH) for 6 BusinessProcesses-PT-13-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 53 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-01
lola: result : unknown
lola: fired transitions : 5848
lola: tried executions : 241
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 111 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-09
lola: result : true
lola: markings : 48
lola: fired transitions : 49
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 78 (type EXCL) for 21 BusinessProcesses-PT-13-ReachabilityFireability-07
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: FINISHED task # 91 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-02
lola: result : true
lola: fired transitions : 31
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 100 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 117 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-02 (obsolete)
lola: LAUNCH task # 84 (type FNDP) for 30 BusinessProcesses-PT-13-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 85 (type EQUN) for 30 BusinessProcesses-PT-13-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 87 (type SRCH) for 30 BusinessProcesses-PT-13-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 87 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-10
lola: result : false
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 84 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 85 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 102 (type FNDP) for 45 BusinessProcesses-PT-13-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 107 (type EQUN) for 45 BusinessProcesses-PT-13-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 114 (type SRCH) for 45 BusinessProcesses-PT-13-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-100.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 78 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-07
lola: result : true
lola: markings : 412
lola: fired transitions : 493
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 125 (type EXCL) for 42 BusinessProcesses-PT-13-ReachabilityFireability-14
lola: time limit : 719 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-107.sara.
lola: FINISHED task # 125 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-14
lola: result : true
lola: markings : 298
lola: fired transitions : 360
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 106 (type EXCL) for 33 BusinessProcesses-PT-13-ReachabilityFireability-11
lola: time limit : 899 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityFireability-85.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 106 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-11
lola: result : true
lola: markings : 109
lola: fired transitions : 126
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 128 (type EXCL) for 0 BusinessProcesses-PT-13-ReachabilityFireability-00
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 128 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-00
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 109 (type EXCL) for 39 BusinessProcesses-PT-13-ReachabilityFireability-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 109 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-13
lola: result : true
lola: markings : 41
lola: fired transitions : 41
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 115 (type EXCL) for 45 BusinessProcesses-PT-13-ReachabilityFireability-15
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 114 (type SRCH) for BusinessProcesses-PT-13-ReachabilityFireability-15
lola: result : false
lola: markings : 21243
lola: fired transitions : 38659
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 102 (type FNDP) for BusinessProcesses-PT-13-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 107 (type EQUN) for BusinessProcesses-PT-13-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 115 (type EXCL) for BusinessProcesses-PT-13-ReachabilityFireability-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-13-ReachabilityFireability-00: EF true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-01: AG true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-02: AG false findpath
BusinessProcesses-PT-13-ReachabilityFireability-03: INITIAL false preprocessing
BusinessProcesses-PT-13-ReachabilityFireability-04: INITIAL true preprocessing
BusinessProcesses-PT-13-ReachabilityFireability-05: INITIAL true preprocessing
BusinessProcesses-PT-13-ReachabilityFireability-06: EF false tandem / insertion
BusinessProcesses-PT-13-ReachabilityFireability-07: AG false tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-08: EF true findpath
BusinessProcesses-PT-13-ReachabilityFireability-09: EF true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-10: AG true tandem / insertion
BusinessProcesses-PT-13-ReachabilityFireability-11: EF true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-12: EF true findpath
BusinessProcesses-PT-13-ReachabilityFireability-13: EF true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-14: EF true tandem / relaxed
BusinessProcesses-PT-13-ReachabilityFireability-15: AG true tandem / insertion


Time elapsed: 3 secs. Pages in use: 2

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-13"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-13, 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 r039-tajo-167813692700551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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