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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678503905498

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:05:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:05:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:05:07] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-11 03:05:07] [INFO ] Transformed 782 places.
[2023-03-11 03:05:07] [INFO ] Transformed 697 transitions.
[2023-03-11 03:05:07] [INFO ] Found NUPN structural information;
[2023-03-11 03:05:07] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 20 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 15) seen :8
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-11 03:05:08] [INFO ] Computed 121 place invariants in 33 ms
[2023-03-11 03:05:09] [INFO ] [Real]Absence check using 78 positive place invariants in 27 ms returned sat
[2023-03-11 03:05:09] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-11 03:05:09] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-11 03:05:09] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2023-03-11 03:05:09] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2023-03-11 03:05:10] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-11 03:05:10] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 6 ms to minimize.
[2023-03-11 03:05:10] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2023-03-11 03:05:10] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:05:10] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-11 03:05:10] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2023-03-11 03:05:11] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 0 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 1 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2023-03-11 03:05:12] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 0 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 2 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 0 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-11 03:05:13] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 1 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 1 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 1 ms to minimize.
[2023-03-11 03:05:14] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 0 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4875 ms
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2023-03-11 03:05:15] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 1 ms to minimize.
[2023-03-11 03:05:16] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 1 ms to minimize.
[2023-03-11 03:05:16] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2023-03-11 03:05:16] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 0 ms to minimize.
[2023-03-11 03:05:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1202 ms
[2023-03-11 03:05:16] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 1 ms to minimize.
[2023-03-11 03:05:16] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 1 ms to minimize.
[2023-03-11 03:05:17] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 0 ms to minimize.
[2023-03-11 03:05:17] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 1 ms to minimize.
[2023-03-11 03:05:17] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 1 ms to minimize.
[2023-03-11 03:05:17] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 0 ms to minimize.
[2023-03-11 03:05:17] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 0 ms to minimize.
[2023-03-11 03:05:18] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 0 ms to minimize.
[2023-03-11 03:05:18] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:05:18] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:05:18] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 0 ms to minimize.
[2023-03-11 03:05:18] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 1 ms to minimize.
[2023-03-11 03:05:19] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 1 ms to minimize.
[2023-03-11 03:05:19] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 0 ms to minimize.
[2023-03-11 03:05:19] [INFO ] Deduced a trap composed of 154 places in 159 ms of which 7 ms to minimize.
[2023-03-11 03:05:19] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 0 ms to minimize.
[2023-03-11 03:05:19] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2023-03-11 03:05:20] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-11 03:05:20] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 0 ms to minimize.
[2023-03-11 03:05:20] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 0 ms to minimize.
[2023-03-11 03:05:20] [INFO ] Deduced a trap composed of 150 places in 172 ms of which 0 ms to minimize.
[2023-03-11 03:05:20] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 0 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 1 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 151 places in 130 ms of which 0 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 3 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 150 places in 151 ms of which 0 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 2 ms to minimize.
[2023-03-11 03:05:21] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 8 ms to minimize.
[2023-03-11 03:05:22] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 2 ms to minimize.
[2023-03-11 03:05:22] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 0 ms to minimize.
[2023-03-11 03:05:22] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 0 ms to minimize.
[2023-03-11 03:05:22] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:05:22] [INFO ] Deduced a trap composed of 143 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:05:23] [INFO ] Deduced a trap composed of 150 places in 247 ms of which 0 ms to minimize.
[2023-03-11 03:05:23] [INFO ] Deduced a trap composed of 148 places in 200 ms of which 1 ms to minimize.
[2023-03-11 03:05:23] [INFO ] Deduced a trap composed of 155 places in 201 ms of which 1 ms to minimize.
[2023-03-11 03:05:23] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 1 ms to minimize.
[2023-03-11 03:05:24] [INFO ] Deduced a trap composed of 160 places in 166 ms of which 0 ms to minimize.
[2023-03-11 03:05:24] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 1 ms to minimize.
[2023-03-11 03:05:24] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 0 ms to minimize.
[2023-03-11 03:05:24] [INFO ] Deduced a trap composed of 146 places in 210 ms of which 0 ms to minimize.
[2023-03-11 03:05:24] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 1 ms to minimize.
[2023-03-11 03:05:25] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-11 03:05:25] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 0 ms to minimize.
[2023-03-11 03:05:25] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-11 03:05:25] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 1 ms to minimize.
[2023-03-11 03:05:25] [INFO ] Deduced a trap composed of 153 places in 187 ms of which 1 ms to minimize.
[2023-03-11 03:05:26] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 1 ms to minimize.
[2023-03-11 03:05:26] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 0 ms to minimize.
[2023-03-11 03:05:26] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 0 ms to minimize.
[2023-03-11 03:05:26] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-11 03:05:26] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 1 ms to minimize.
[2023-03-11 03:05:27] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 0 ms to minimize.
[2023-03-11 03:05:27] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 1 ms to minimize.
[2023-03-11 03:05:28] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 1 ms to minimize.
[2023-03-11 03:05:28] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-11 03:05:28] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 1 ms to minimize.
[2023-03-11 03:05:28] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-03-11 03:05:29] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 1 ms to minimize.
[2023-03-11 03:05:29] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 0 ms to minimize.
[2023-03-11 03:05:29] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-11 03:05:30] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2023-03-11 03:05:30] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 0 ms to minimize.
[2023-03-11 03:05:30] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 0 ms to minimize.
[2023-03-11 03:05:30] [INFO ] Deduced a trap composed of 154 places in 289 ms of which 1 ms to minimize.
[2023-03-11 03:05:31] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 0 ms to minimize.
[2023-03-11 03:05:31] [INFO ] Deduced a trap composed of 133 places in 210 ms of which 0 ms to minimize.
[2023-03-11 03:05:31] [INFO ] Deduced a trap composed of 130 places in 193 ms of which 1 ms to minimize.
[2023-03-11 03:05:32] [INFO ] Deduced a trap composed of 139 places in 294 ms of which 1 ms to minimize.
[2023-03-11 03:05:32] [INFO ] Deduced a trap composed of 131 places in 311 ms of which 1 ms to minimize.
[2023-03-11 03:05:32] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 1 ms to minimize.
[2023-03-11 03:05:33] [INFO ] Deduced a trap composed of 162 places in 273 ms of which 1 ms to minimize.
[2023-03-11 03:05:33] [INFO ] Deduced a trap composed of 158 places in 281 ms of which 1 ms to minimize.
[2023-03-11 03:05:33] [INFO ] Deduced a trap composed of 142 places in 311 ms of which 1 ms to minimize.
[2023-03-11 03:05:34] [INFO ] Deduced a trap composed of 145 places in 277 ms of which 1 ms to minimize.
[2023-03-11 03:05:34] [INFO ] Deduced a trap composed of 129 places in 281 ms of which 1 ms to minimize.
[2023-03-11 03:05:34] [INFO ] Deduced a trap composed of 11 places in 333 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 03:05:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:05:34] [INFO ] After 25355ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:6
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 43 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 695 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 107 place count 695 transition count 522
Reduce places removed 106 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 111 rules applied. Total rules applied 218 place count 589 transition count 517
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 223 place count 584 transition count 517
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 223 place count 584 transition count 376
Deduced a syphon composed of 141 places in 7 ms
Ensure Unique test removed 17 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 299 rules applied. Total rules applied 522 place count 426 transition count 376
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 609 place count 339 transition count 289
Iterating global reduction 3 with 87 rules applied. Total rules applied 696 place count 339 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 696 place count 339 transition count 283
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 709 place count 332 transition count 283
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 891 place count 241 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 892 place count 241 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 896 place count 239 transition count 198
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 900 place count 239 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 901 place count 238 transition count 197
Applied a total of 901 rules in 273 ms. Remains 238 /719 variables (removed 481) and now considering 197/638 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 238/719 places, 197/638 transitions.
Incomplete random walk after 10000 steps, including 381 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:05:35] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
// Phase 1: matrix 196 rows 238 cols
[2023-03-11 03:05:35] [INFO ] Computed 89 place invariants in 20 ms
[2023-03-11 03:05:35] [INFO ] [Real]Absence check using 63 positive place invariants in 10 ms returned sat
[2023-03-11 03:05:35] [INFO ] [Real]Absence check using 63 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-11 03:05:35] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:05:36] [INFO ] [Nat]Absence check using 63 positive place invariants in 10 ms returned sat
[2023-03-11 03:05:36] [INFO ] [Nat]Absence check using 63 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-11 03:05:36] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:05:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:36] [INFO ] After 104ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:05:36] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
[2023-03-11 03:05:36] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 26 ms to minimize.
[2023-03-11 03:05:36] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 48 places in 438 ms of which 1 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2023-03-11 03:05:37] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2023-03-11 03:05:38] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2023-03-11 03:05:39] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2023-03-11 03:05:40] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 0 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 0 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 0 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2023-03-11 03:05:41] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 5800 ms
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-11 03:05:42] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-03-11 03:05:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1059 ms
[2023-03-11 03:05:43] [INFO ] After 7120ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-11 03:05:43] [INFO ] After 7526ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 29 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 197/197 transitions.
Graph (complete) has 796 edges and 238 vertex of which 237 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 237 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 236 transition count 195
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 236 transition count 192
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 231 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 230 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 230 transition count 191
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 36 place count 217 transition count 181
Applied a total of 36 rules in 28 ms. Remains 217 /238 variables (removed 21) and now considering 181/197 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 217/238 places, 181/197 transitions.
Incomplete random walk after 10000 steps, including 477 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1095869 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 1095869 steps, saw 238591 distinct states, run finished after 3002 ms. (steps per millisecond=365 ) properties seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-11 03:05:46] [INFO ] Flow matrix only has 180 transitions (discarded 1 similar events)
// Phase 1: matrix 180 rows 217 cols
[2023-03-11 03:05:46] [INFO ] Computed 84 place invariants in 3 ms
[2023-03-11 03:05:47] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:05:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-11 03:05:47] [INFO ] [Nat]Absence check using 65 positive and 19 generalized place invariants in 5 ms returned sat
[2023-03-11 03:05:47] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:47] [INFO ] After 46ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:47] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 03:05:47] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 24 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 181/181 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 217 transition count 180
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 216 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 215 transition count 179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 215 transition count 179
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 0 with 6 rules applied. Total rules applied 10 place count 212 transition count 176
Applied a total of 10 rules in 37 ms. Remains 212 /217 variables (removed 5) and now considering 176/181 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 212/217 places, 176/181 transitions.
Incomplete random walk after 10000 steps, including 508 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 944726 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944726 steps, saw 226080 distinct states, run finished after 3002 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:05:50] [INFO ] Flow matrix only has 175 transitions (discarded 1 similar events)
// Phase 1: matrix 175 rows 212 cols
[2023-03-11 03:05:50] [INFO ] Computed 84 place invariants in 23 ms
[2023-03-11 03:05:50] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:05:50] [INFO ] [Nat]Absence check using 64 positive place invariants in 13 ms returned sat
[2023-03-11 03:05:50] [INFO ] [Nat]Absence check using 64 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-11 03:05:50] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:50] [INFO ] After 59ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:51] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-11 03:05:51] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 212 /212 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 212/212 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-11 03:05:51] [INFO ] Flow matrix only has 175 transitions (discarded 1 similar events)
[2023-03-11 03:05:51] [INFO ] Invariant cache hit.
[2023-03-11 03:05:51] [INFO ] Implicit Places using invariants in 179 ms returned [13, 15, 17, 19, 21, 23, 25, 27, 29, 167, 186]
Discarding 11 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 181 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/212 places, 173/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 153
Applied a total of 10 rules in 10 ms. Remains 196 /201 variables (removed 5) and now considering 153/173 (removed 20) transitions.
[2023-03-11 03:05:51] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
// Phase 1: matrix 152 rows 196 cols
[2023-03-11 03:05:51] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-11 03:05:51] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-11 03:05:51] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
[2023-03-11 03:05:51] [INFO ] Invariant cache hit.
[2023-03-11 03:05:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:51] [INFO ] Implicit Places using invariants and state equation in 252 ms returned [43, 44, 45, 46, 47, 48, 49, 52, 56, 122, 124, 126, 128, 133, 137]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 435 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 181/212 places, 153/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 179 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 177 transition count 149
Applied a total of 8 rules in 13 ms. Remains 177 /181 variables (removed 4) and now considering 149/153 (removed 4) transitions.
[2023-03-11 03:05:51] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 177 cols
[2023-03-11 03:05:51] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 03:05:51] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 03:05:51] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:05:51] [INFO ] Invariant cache hit.
[2023-03-11 03:05:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:52] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 177/212 places, 149/176 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1154 ms. Remains : 177/212 places, 149/176 transitions.
Incomplete random walk after 10000 steps, including 499 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1110399 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 1110399 steps, saw 263958 distinct states, run finished after 3007 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:05:55] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:05:55] [INFO ] Invariant cache hit.
[2023-03-11 03:05:55] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:05:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 12 ms returned sat
[2023-03-11 03:05:55] [INFO ] [Nat]Absence check using 49 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-11 03:05:55] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:55] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:55] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 03:05:55] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 149/149 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 149/149 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-11 03:05:55] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:05:55] [INFO ] Invariant cache hit.
[2023-03-11 03:05:55] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 03:05:55] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:05:55] [INFO ] Invariant cache hit.
[2023-03-11 03:05:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 03:05:56] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-11 03:05:56] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 03:05:56] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
[2023-03-11 03:05:56] [INFO ] Invariant cache hit.
[2023-03-11 03:05:56] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 177/177 places, 149/149 transitions.
Graph (complete) has 556 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 148
Applied a total of 2 rules in 7 ms. Remains 176 /177 variables (removed 1) and now considering 148/149 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 176 cols
[2023-03-11 03:05:56] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-11 03:05:56] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:05:56] [INFO ] [Nat]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-11 03:05:56] [INFO ] [Nat]Absence check using 48 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-11 03:05:56] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:56] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 03:05:56] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:05:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-11 03:05:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 149 transitions and 717 arcs took 3 ms.
[2023-03-11 03:05:56] [INFO ] Flatten gal took : 52 ms
Total runtime 49538 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

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

BK_STOP 1678503957300

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 BusinessProcesses-PT-20-ReachabilityFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 BusinessProcesses-PT-20-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 BusinessProcesses-PT-20-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 BusinessProcesses-PT-20-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for BusinessProcesses-PT-20-ReachabilityFireability-03
lola: result : true
lola: markings : 121
lola: fired transitions : 120
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for BusinessProcesses-PT-20-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 4 (type EQUN) for BusinessProcesses-PT-20-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 7 (type EXCL) for BusinessProcesses-PT-20-ReachabilityFireability-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-20-ReachabilityFireability-03: EF true 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-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692800607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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