fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414900334
Last Updated
July 7, 2024

About the Execution of 2023-gold for BusinessProcesses-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
377.848 34647.00 54611.00 95.50 TTFTTTFFFFTFTTFF 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/mcc2024-input.r065-tajo-171620414900334.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716651050375

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:30:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:30:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:30:53] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-25 15:30:53] [INFO ] Transformed 567 places.
[2024-05-25 15:30:53] [INFO ] Transformed 508 transitions.
[2024-05-25 15:30:53] [INFO ] Found NUPN structural information;
[2024-05-25 15:30:53] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 16) seen :4
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 501 rows 560 cols
[2024-05-25 15:30:54] [INFO ] Computed 95 invariants in 28 ms
[2024-05-25 15:30:55] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 15:30:55] [INFO ] [Nat]Absence check using 53 positive place invariants in 49 ms returned sat
[2024-05-25 15:30:55] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-25 15:30:56] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2024-05-25 15:30:57] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 7 ms to minimize.
[2024-05-25 15:30:57] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:30:57] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:30:57] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2024-05-25 15:30:57] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:30:58] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:30:58] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 13 ms to minimize.
[2024-05-25 15:30:58] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:30:58] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 0 ms to minimize.
[2024-05-25 15:30:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1857 ms
[2024-05-25 15:30:58] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:30:59] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:30:59] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:30:59] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 0 ms to minimize.
[2024-05-25 15:30:59] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:30:59] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 2 ms to minimize.
[2024-05-25 15:31:00] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:31:01] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 1 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3344 ms
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 3 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:31:02] [INFO ] Deduced a trap composed of 126 places in 167 ms of which 2 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 0 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 1 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:31:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1823 ms
[2024-05-25 15:31:04] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:31:04] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:31:04] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:31:04] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:31:04] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:31:05] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:31:05] [INFO ] Deduced a trap composed of 80 places in 208 ms of which 1 ms to minimize.
[2024-05-25 15:31:05] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 0 ms to minimize.
[2024-05-25 15:31:05] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:31:05] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 1 ms to minimize.
[2024-05-25 15:31:06] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 1 ms to minimize.
[2024-05-25 15:31:06] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 0 ms to minimize.
[2024-05-25 15:31:06] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:31:06] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:31:06] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 12 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:31:07] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 1 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 124 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 1 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 3 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:31:08] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4847 ms
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 2 ms to minimize.
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2024-05-25 15:31:09] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 1 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:31:10] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 0 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:31:11] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:31:12] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 127 places in 113 ms of which 0 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 0 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 0 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 138 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:31:13] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 0 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:31:14] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 0 ms to minimize.
[2024-05-25 15:31:15] [INFO ] Deduced a trap composed of 115 places in 163 ms of which 0 ms to minimize.
[2024-05-25 15:31:15] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:31:15] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:31:15] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 1 ms to minimize.
[2024-05-25 15:31:16] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 1 ms to minimize.
[2024-05-25 15:31:16] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 0 ms to minimize.
[2024-05-25 15:31:16] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 1 ms to minimize.
[2024-05-25 15:31:16] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 0 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2024-05-25 15:31:17] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 8797 ms
[2024-05-25 15:31:17] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-25 15:31:18] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:31:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-25 15:31:18] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:31:19] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 2 ms to minimize.
[2024-05-25 15:31:19] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:31:19] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:31:19] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:31:20] [INFO ] Deduced a trap composed of 130 places in 221 ms of which 1 ms to minimize.
[2024-05-25 15:31:20] [INFO ] Deduced a trap composed of 17 places in 189 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:31:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:31:20] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (false)on formula BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 149 ms.
Support contains 52 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 263 edges and 560 vertex of which 4 / 560 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1136 edges and 557 vertex of which 552 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 552 transition count 399
Reduce places removed 97 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 455 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 202 place count 452 transition count 396
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 202 place count 452 transition count 316
Deduced a syphon composed of 80 places in 20 ms
Ensure Unique test removed 12 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 374 place count 360 transition count 316
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 428 place count 306 transition count 262
Iterating global reduction 3 with 54 rules applied. Total rules applied 482 place count 306 transition count 262
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 482 place count 306 transition count 260
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 486 place count 304 transition count 260
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 634 place count 230 transition count 186
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 636 place count 229 transition count 190
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 229 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 228 transition count 189
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 642 place count 228 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 643 place count 227 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 644 place count 226 transition count 188
Applied a total of 644 rules in 246 ms. Remains 226 /560 variables (removed 334) and now considering 188/501 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 226/560 places, 188/501 transitions.
Incomplete random walk after 10000 steps, including 321 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 6) seen :3
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 188 rows 226 cols
[2024-05-25 15:31:21] [INFO ] Computed 78 invariants in 12 ms
[2024-05-25 15:31:21] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 15:31:21] [INFO ] [Nat]Absence check using 49 positive place invariants in 10 ms returned sat
[2024-05-25 15:31:21] [INFO ] [Nat]Absence check using 49 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-25 15:31:21] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 15:31:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:31:21] [INFO ] After 49ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 15:31:21] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 11 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2024-05-25 15:31:22] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:31:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2024-05-25 15:31:22] [INFO ] After 697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-25 15:31:22] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 86 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=43 )
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 29463 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-11
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1716651085022

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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/ReachabilityCardinality.xml
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: 7 transitions removed,7 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: 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: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: 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: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: LAUNCH task # 58 (type EXCL) for 9 BusinessProcesses-PT-11-ReachabilityCardinality-2024-03
lola: time limit : 156 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 68 (type FNDP) for 3 BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type EQUN) for 3 BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 71 (type SRCH) for 3 BusinessProcesses-PT-11-ReachabilityCardinality-2024-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
lola: FINISHED task # 58 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 15
lola: fired transitions : 14
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 65 (type EXCL) for 6 BusinessProcesses-PT-11-ReachabilityCardinality-2024-02
lola: time limit : 171 sec
lola: memory limit: 32 pages
lola: FINISHED task # 71 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
lola: result : false
lola: markings : 4157
lola: fired transitions : 7548
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 68 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 69 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-01 (obsolete)
lola: LAUNCH task # 48 (type FNDP) for 0 BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 0 BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 51 (type SRCH) for 0 BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 69 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-01
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 65 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 11
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 52 (type EXCL) for 0 BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: time limit : 199 sec
lola: memory limit: 32 pages
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: FINISHED task # 51 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 48 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 49 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 52 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-00 (obsolete)
lola: LAUNCH task # 79 (type EXCL) for 24 BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
lola: time limit : 199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 75 (type FNDP) for 24 BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type EQUN) for 24 BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 78 (type SRCH) for 24 BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
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/ReachabilityCardinality-49.sara.
lola: FINISHED task # 48 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-00
lola: result : true
lola: fired transitions : 4
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 75 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 173
lola: tried executions : 37
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 76 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 78 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 79 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-08 (obsolete)
lola: Created skeleton in 0.000000 secs.
sara: place or transition ordering is non-deterministic
lola: Created skeleton in 0.000000 secs.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-76.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 76 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-08
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: LAUNCH task # 86 (type EXCL) for 33 BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 82 (type FNDP) for 33 BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 83 (type EQUN) for 33 BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 85 (type SRCH) for 33 BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
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: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: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: Created skeleton in 0.000000 secs.
lola: FINISHED task # 85 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 1458
lola: fired transitions : 3804
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 82 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 83 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 86 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 94 (type EXCL) for 21 BusinessProcesses-PT-11-ReachabilityCardinality-2024-07
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 98 (type FNDP) for 27 BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 99 (type EQUN) for 27 BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 101 (type SRCH) for 27 BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 94 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-07
lola: result : true
lola: markings : 147
lola: fired transitions : 148
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 101 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
lola: result : true
lola: markings : 239
lola: fired transitions : 479
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 98 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 (obsolete)
lola: CANCELED task # 99 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-09 (obsolete)
lola: FINISHED task # 86 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 32
lola: fired transitions : 31
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 82 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 306
lola: tried executions : 17
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-99.sara.
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: FINISHED task # 98 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-09
lola: result : unknown
lola: fired transitions : 3813
lola: tried executions : 318
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 106 (type EXCL) for 12 BusinessProcesses-PT-11-ReachabilityCardinality-2024-04
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 108 (type FNDP) for 30 BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 109 (type EQUN) for 30 BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 111 (type SRCH) for 30 BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
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: 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: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: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: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:711
lola: FINISHED task # 106 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-04
lola: result : true
lola: markings : 33
lola: fired transitions : 32
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 143 (type EXCL) for 45 BusinessProcesses-PT-11-ReachabilityCardinality-2024-15
lola: time limit : 514 sec
lola: memory limit: 32 pages
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: FINISHED task # 111 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 180
lola: fired transitions : 203
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 108 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 109 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-10 (obsolete)
lola: LAUNCH task # 123 (type FNDP) for 42 BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 126 (type EQUN) for 42 BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 128 (type SRCH) for 42 BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-109.sara.
lola: FINISHED task # 128 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
sara: lola: place or transition ordering is non-deterministic
result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 123 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 126 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-14 (obsolete)
lola: LAUNCH task # 114 (type FNDP) for 36 BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-83.sara.lola:
LAUNCH task # 115 (type EQUN) for 36 BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
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 36 BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 123 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 143 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-15
lola: result : true
lola: markings : 92
lola: fired transitions : 92
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 151 (type EXCL) for 18 BusinessProcesses-PT-11-ReachabilityCardinality-2024-06
lola: time limit : 899 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-126.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-115.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 114 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 144
lola: tried executions : 14
lola: time used : 1.000000
lola: memory pages used : 0

lola: CANCELED task # 115 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 117 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-12 (obsolete)
lola: LAUNCH task # 131 (type FNDP) for 15 BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 132 (type EQUN) for 15 BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 134 (type SRCH) for 15 BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 151 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-06
lola: result : true
lola: markings : 42
lola: fired transitions : 41
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 139 (type EXCL) for 39 BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 126 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-14
lola: result : true
lola: FINISHED task # 115 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-12
lola: result : true
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-132.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 134 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 1971
lola: fired transitions : 2855
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 131 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 132 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-05 (obsolete)
sara: warning, failure of lp_solve (at job 23)
lola: LAUNCH task # 120 (type FNDP) for 39 BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 124 (type EQUN) for 39 BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 138 (type SRCH) for 39 BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 139 (type EXCL) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-13
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 120 (type FNDP) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 124 (type EQUN) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 138 (type SRCH) for BusinessProcesses-PT-11-ReachabilityCardinality-2024-13 (obsolete)
lola: Portfolio finished: no open formulas

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


Time elapsed: 3 secs. Pages in use: 3

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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414900334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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