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-167813692600526.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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-10-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678502701636

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:45:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:45:03] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-11 02:45:03] [INFO ] Transformed 518 places.
[2023-03-11 02:45:03] [INFO ] Transformed 471 transitions.
[2023-03-11 02:45:03] [INFO ] Found NUPN structural information;
[2023-03-11 02:45:03] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 11) seen :4
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-11 02:45:04] [INFO ] Computed 85 place invariants in 18 ms
[2023-03-11 02:45:04] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:45:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 17 ms returned sat
[2023-03-11 02:45:05] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2023-03-11 02:45:05] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 02:45:05] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 12 ms to minimize.
[2023-03-11 02:45:05] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2023-03-11 02:45:06] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-11 02:45:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2136 ms
[2023-03-11 02:45:07] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:45:08] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:45:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2023-03-11 02:45:08] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2023-03-11 02:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-11 02:45:08] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:45:08] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:45:08] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:45:09] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-11 02:45:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 656 ms
[2023-03-11 02:45:09] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:45:09] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:45:09] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 0 ms to minimize.
[2023-03-11 02:45:09] [INFO ] Deduced a trap composed of 114 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 2 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 0 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:45:10] [INFO ] Deduced a trap composed of 115 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 1 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 4 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:45:11] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 0 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 1 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:45:12] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 121 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:45:13] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 4 ms to minimize.
[2023-03-11 02:45:14] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 6 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:45:15] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 0 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 115 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 3 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:45:16] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 0 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 113 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 0 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 123 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:45:17] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 0 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:45:18] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:45:19] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 123 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:45:20] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:45:21] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 1 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:45:22] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 1 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:45:23] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 0 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 116 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:45:24] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 1 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 121 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:45:25] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:45:26] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 0 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 0 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 0 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:45:27] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 2 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 117 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:45:28] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:45:29] [INFO ] Deduced a trap composed of 117 places in 108 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:45:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:45:29] [INFO ] After 25113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 60 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 518 transition count 416
Reduce places removed 55 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 67 rules applied. Total rules applied 122 place count 463 transition count 404
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 134 place count 451 transition count 404
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 134 place count 451 transition count 318
Deduced a syphon composed of 86 places in 3 ms
Ensure Unique test removed 8 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 314 place count 357 transition count 318
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 370 place count 301 transition count 262
Iterating global reduction 3 with 56 rules applied. Total rules applied 426 place count 301 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 426 place count 301 transition count 259
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 297 transition count 259
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 565 place count 231 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 566 place count 231 transition count 192
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 568 place count 230 transition count 195
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 570 place count 230 transition count 195
Applied a total of 570 rules in 124 ms. Remains 230 /518 variables (removed 288) and now considering 195/471 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 230/518 places, 195/471 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 195 rows 230 cols
[2023-03-11 02:45:30] [INFO ] Computed 76 place invariants in 6 ms
[2023-03-11 02:45:30] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:45:30] [INFO ] [Nat]Absence check using 47 positive place invariants in 11 ms returned sat
[2023-03-11 02:45:30] [INFO ] [Nat]Absence check using 47 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-11 02:45:30] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:45:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:45:30] [INFO ] After 104ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 02:45:30] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 309 ms
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:45:31] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2023-03-11 02:45:32] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 3 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2023-03-11 02:45:33] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2208 ms
[2023-03-11 02:45:33] [INFO ] After 3112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-11 02:45:34] [INFO ] After 3491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 74 ms.
Support contains 37 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 195/195 transitions.
Graph (trivial) has 27 edges and 230 vertex of which 2 / 230 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 229 transition count 186
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 222 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 221 transition count 185
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 17 place count 221 transition count 179
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 31 place count 213 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 212 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 212 transition count 178
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 59 place count 199 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 199 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 197 transition count 163
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 197 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 196 transition count 162
Applied a total of 65 rules in 83 ms. Remains 196 /230 variables (removed 34) and now considering 162/195 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 196/230 places, 162/195 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 162 rows 196 cols
[2023-03-11 02:45:34] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-11 02:45:34] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:45:34] [INFO ] [Nat]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-11 02:45:34] [INFO ] [Nat]Absence check using 48 positive and 26 generalized place invariants in 6 ms returned sat
[2023-03-11 02:45:34] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:45:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:45:34] [INFO ] After 54ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-11 02:45:34] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 354 ms
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2023-03-11 02:45:35] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-11 02:45:35] [INFO ] After 1125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 36 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 162/162 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 196 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 195 transition count 161
Applied a total of 2 rules in 22 ms. Remains 195 /196 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 195/196 places, 161/162 transitions.
Incomplete random walk after 10000 steps, including 197 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 161 rows 195 cols
[2023-03-11 02:45:35] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-11 02:45:35] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:45:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2023-03-11 02:45:35] [INFO ] [Nat]Absence check using 46 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-11 02:45:35] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:45:35] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:35] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2023-03-11 02:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-11 02:45:36] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 02:45:36] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 161/161 transitions.
Graph (complete) has 656 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 193 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 188 transition count 155
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 11 place count 188 transition count 147
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 30 place count 177 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 175 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 175 transition count 145
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 71 place count 155 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 154 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 154 transition count 145
Applied a total of 74 rules in 43 ms. Remains 154 /195 variables (removed 41) and now considering 145/161 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 154/195 places, 145/161 transitions.
Incomplete random walk after 10000 steps, including 357 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1274763 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :{}
Probabilistic random walk after 1274763 steps, saw 318454 distinct states, run finished after 3002 ms. (steps per millisecond=424 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 154 cols
[2023-03-11 02:45:39] [INFO ] Computed 67 place invariants in 4 ms
[2023-03-11 02:45:39] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:45:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-11 02:45:39] [INFO ] [Nat]Absence check using 45 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-11 02:45:39] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:45:39] [INFO ] After 20ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-11 02:45:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-11 02:45:39] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 02:45:39] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 145/145 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 154/154 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 145/145 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-11 02:45:39] [INFO ] Invariant cache hit.
[2023-03-11 02:45:39] [INFO ] Implicit Places using invariants in 192 ms returned [12, 20, 21, 22, 37, 39, 41, 47, 49, 51, 53]
Discarding 11 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT only with invariants took 194 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/154 places, 131/145 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 115
Applied a total of 8 rules in 10 ms. Remains 139 /143 variables (removed 4) and now considering 115/131 (removed 16) transitions.
// Phase 1: matrix 115 rows 139 cols
[2023-03-11 02:45:39] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-11 02:45:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 02:45:39] [INFO ] Invariant cache hit.
[2023-03-11 02:45:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:45:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [79, 85, 92, 93]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 262 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 135/154 places, 115/145 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 133 transition count 113
Applied a total of 4 rules in 10 ms. Remains 133 /135 variables (removed 2) and now considering 113/115 (removed 2) transitions.
// Phase 1: matrix 113 rows 133 cols
[2023-03-11 02:45:40] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-11 02:45:40] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 02:45:40] [INFO ] Invariant cache hit.
[2023-03-11 02:45:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:45:40] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 133/154 places, 113/145 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 760 ms. Remains : 133/154 places, 113/145 transitions.
Incomplete random walk after 10000 steps, including 348 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1394546 steps, run timeout after 3001 ms. (steps per millisecond=464 ) properties seen :{}
Probabilistic random walk after 1394546 steps, saw 329454 distinct states, run finished after 3001 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:45:43] [INFO ] Invariant cache hit.
[2023-03-11 02:45:43] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:45:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2023-03-11 02:45:43] [INFO ] [Nat]Absence check using 40 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-11 02:45:43] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:45:43] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2023-03-11 02:45:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2023-03-11 02:45:43] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-11 02:45:43] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 113/113 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 133/133 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 113/113 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-11 02:45:43] [INFO ] Invariant cache hit.
[2023-03-11 02:45:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 02:45:43] [INFO ] Invariant cache hit.
[2023-03-11 02:45:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 02:45:43] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-11 02:45:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 02:45:43] [INFO ] Invariant cache hit.
[2023-03-11 02:45:44] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 133/133 places, 113/113 transitions.
Graph (complete) has 470 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 130 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 129 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 126 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 126 transition count 108
Applied a total of 11 rules in 14 ms. Remains 126 /133 variables (removed 7) and now considering 108/113 (removed 5) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 126 cols
[2023-03-11 02:45:44] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-11 02:45:44] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:45:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-11 02:45:44] [INFO ] [Nat]Absence check using 37 positive and 14 generalized place invariants in 2 ms returned sat
[2023-03-11 02:45:44] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-11 02:45:44] [INFO ] After 13ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:44] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 02:45:44] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:45:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-11 02:45:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 113 transitions and 621 arcs took 1 ms.
[2023-03-11 02:45:44] [INFO ] Flatten gal took : 58 ms
Total runtime 40912 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-10
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678502744685

--------------------
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 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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
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 # 8 (type EXCL) for 0 BusinessProcesses-PT-10-ReachabilityCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 BusinessProcesses-PT-10-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 BusinessProcesses-PT-10-ReachabilityCardinality-00
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 # 7 (type SRCH) for 0 BusinessProcesses-PT-10-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for BusinessProcesses-PT-10-ReachabilityCardinality-00
lola: result : true
lola: markings : 158
lola: fired transitions : 157
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for BusinessProcesses-PT-10-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 5 (type EQUN) for BusinessProcesses-PT-10-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 8 (type EXCL) for BusinessProcesses-PT-10-ReachabilityCardinality-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-10-ReachabilityCardinality-00: AG false tandem / insertion


Time elapsed: 0 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-10"
export BK_EXAMINATION="ReachabilityCardinality"
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-10, 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 r039-tajo-167813692600526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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