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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678503549659

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-17
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:59:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:59:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:59:11] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-11 02:59:11] [INFO ] Transformed 650 places.
[2023-03-11 02:59:11] [INFO ] Transformed 580 transitions.
[2023-03-11 02:59:11] [INFO ] Found NUPN structural information;
[2023-03-11 02:59:11] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-11 02:59:12] [INFO ] Computed 108 place invariants in 33 ms
[2023-03-11 02:59:13] [INFO ] [Real]Absence check using 62 positive place invariants in 74 ms returned sat
[2023-03-11 02:59:13] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 36 ms returned sat
[2023-03-11 02:59:13] [INFO ] After 353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 25 places in 3561 ms of which 11 ms to minimize.
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 1 ms to minimize.
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 0 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8124 ms
[2023-03-11 02:59:21] [INFO ] After 8538ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:59:21] [INFO ] After 9189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:59:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2023-03-11 02:59:22] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2023-03-11 02:59:23] [INFO ] After 1277ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 02:59:27] [INFO ] Deduced a trap composed of 11 places in 4294 ms of which 1 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2023-03-11 02:59:30] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 14 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2023-03-11 02:59:31] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8259 ms
[2023-03-11 02:59:32] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2023-03-11 02:59:32] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 0 ms to minimize.
[2023-03-11 02:59:32] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:59:33] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2023-03-11 02:59:33] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:59:33] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 1 ms to minimize.
[2023-03-11 02:59:34] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 0 ms to minimize.
[2023-03-11 02:59:34] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:59:34] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:59:34] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 7 ms to minimize.
[2023-03-11 02:59:34] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:59:35] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:59:35] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:59:35] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 4 ms to minimize.
[2023-03-11 02:59:35] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:59:35] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:59:36] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:59:36] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:59:36] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:59:36] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:59:37] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:59:37] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 0 ms to minimize.
[2023-03-11 02:59:37] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:59:37] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:59:37] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5692 ms
[2023-03-11 02:59:38] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:59:38] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2023-03-11 02:59:38] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:59:38] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:59:38] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2023-03-11 02:59:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 706 ms
[2023-03-11 02:59:39] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:59:39] [INFO ] Deduced a trap composed of 119 places in 190 ms of which 1 ms to minimize.
[2023-03-11 02:59:39] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 0 ms to minimize.
[2023-03-11 02:59:39] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 0 ms to minimize.
[2023-03-11 02:59:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 920 ms
[2023-03-11 02:59:40] [INFO ] Deduced a trap composed of 135 places in 281 ms of which 1 ms to minimize.
[2023-03-11 02:59:40] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 0 ms to minimize.
[2023-03-11 02:59:40] [INFO ] Deduced a trap composed of 151 places in 268 ms of which 2 ms to minimize.
[2023-03-11 02:59:41] [INFO ] Deduced a trap composed of 145 places in 322 ms of which 1 ms to minimize.
[2023-03-11 02:59:41] [INFO ] Deduced a trap composed of 146 places in 249 ms of which 0 ms to minimize.
[2023-03-11 02:59:41] [INFO ] Deduced a trap composed of 150 places in 259 ms of which 1 ms to minimize.
[2023-03-11 02:59:42] [INFO ] Deduced a trap composed of 161 places in 287 ms of which 1 ms to minimize.
[2023-03-11 02:59:42] [INFO ] Deduced a trap composed of 46 places in 295 ms of which 1 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 143 places in 362 ms of which 2 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 148 places in 329 ms of which 1 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 155 places in 306 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 161 places in 247 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:59:45] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 0 ms to minimize.
[2023-03-11 02:59:45] [INFO ] Deduced a trap composed of 155 places in 214 ms of which 0 ms to minimize.
[2023-03-11 02:59:45] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2023-03-11 02:59:45] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 1 ms to minimize.
[2023-03-11 02:59:46] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 1 ms to minimize.
[2023-03-11 02:59:46] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2023-03-11 02:59:46] [INFO ] Deduced a trap composed of 148 places in 252 ms of which 0 ms to minimize.
[2023-03-11 02:59:46] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 6943 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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:59:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:59:46] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 216 ms.
Support contains 123 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 642 transition count 518
Reduce places removed 57 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 71 rules applied. Total rules applied 129 place count 585 transition count 504
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 143 place count 571 transition count 504
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 143 place count 571 transition count 403
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 356 place count 459 transition count 403
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 411 place count 404 transition count 348
Iterating global reduction 3 with 55 rules applied. Total rules applied 466 place count 404 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 466 place count 404 transition count 347
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 468 place count 403 transition count 347
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 602 place count 336 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 336 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 336 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 605 place count 335 transition count 278
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 609 place count 335 transition count 278
Applied a total of 609 rules in 304 ms. Remains 335 /646 variables (removed 311) and now considering 278/576 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 335/646 places, 278/576 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 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 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 278 rows 335 cols
[2023-03-11 02:59:48] [INFO ] Computed 94 place invariants in 27 ms
[2023-03-11 02:59:49] [INFO ] [Real]Absence check using 62 positive place invariants in 422 ms returned sat
[2023-03-11 02:59:49] [INFO ] [Real]Absence check using 62 positive and 32 generalized place invariants in 21 ms returned sat
[2023-03-11 02:59:49] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-11 02:59:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:59:49] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1 real:6
[2023-03-11 02:59:49] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 14 ms to minimize.
[2023-03-11 02:59:49] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:59:50] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-03-11 02:59:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2023-03-11 02:59:50] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:59:50] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:59:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 713 ms
[2023-03-11 02:59:50] [INFO ] After 764ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:59:50] [INFO ] After 1912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:59:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-11 02:59:50] [INFO ] [Nat]Absence check using 62 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-11 02:59:51] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 02:59:51] [INFO ] After 479ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 02:59:51] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-11 02:59:51] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-11 02:59:51] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:59:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1119 ms
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 594 ms
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2023-03-11 02:59:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 347 ms
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:59:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2023-03-11 02:59:54] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 0 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 0 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:59:55] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 0 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:59:56] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:59:57] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:59:57] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:59:57] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-11 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 18 trap constraints in 2509 ms
[2023-03-11 02:59:57] [INFO ] After 6272ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-11 02:59:57] [INFO ] After 7450ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 77 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 278/278 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 335 transition count 272
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 329 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 328 transition count 271
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 14 place count 328 transition count 261
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 316 transition count 261
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 42 place count 310 transition count 255
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 310 transition count 255
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 109 place count 279 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 279 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 278 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 277 transition count 224
Applied a total of 112 rules in 101 ms. Remains 277 /335 variables (removed 58) and now considering 224/278 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 277/335 places, 224/278 transitions.
Incomplete random walk after 10000 steps, including 243 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 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 51 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 898673 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 898673 steps, saw 142898 distinct states, run finished after 3004 ms. (steps per millisecond=299 ) properties seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 224 rows 277 cols
[2023-03-11 03:00:01] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-11 03:00:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:00:01] [INFO ] [Nat]Absence check using 58 positive place invariants in 7 ms returned sat
[2023-03-11 03:00:01] [INFO ] [Nat]Absence check using 58 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-11 03:00:01] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:01] [INFO ] After 221ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 1 ms to minimize.
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2023-03-11 03:00:02] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 1 ms to minimize.
[2023-03-11 03:00:03] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 1 ms to minimize.
[2023-03-11 03:00:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1123 ms
[2023-03-11 03:00:03] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 0 ms to minimize.
[2023-03-11 03:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-11 03:00:03] [INFO ] After 1575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-11 03:00:03] [INFO ] After 2039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 64 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 224/224 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 275 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 275 transition count 220
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 273 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 271 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 271 transition count 218
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 33 place count 260 transition count 208
Applied a total of 33 rules in 83 ms. Remains 260 /277 variables (removed 17) and now considering 208/224 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 260/277 places, 208/224 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 973163 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 973163 steps, saw 151402 distinct states, run finished after 3002 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 208 rows 260 cols
[2023-03-11 03:00:06] [INFO ] Computed 89 place invariants in 13 ms
[2023-03-11 03:00:06] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:00:06] [INFO ] [Nat]Absence check using 58 positive place invariants in 6 ms returned sat
[2023-03-11 03:00:07] [INFO ] [Nat]Absence check using 58 positive and 31 generalized place invariants in 4 ms returned sat
[2023-03-11 03:00:07] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:07] [INFO ] After 121ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:07] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-11 03:00:07] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-11 03:00:07] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:00:07] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2023-03-11 03:00:07] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2023-03-11 03:00:08] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2023-03-11 03:00:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 710 ms
[2023-03-11 03:00:08] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-11 03:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-11 03:00:08] [INFO ] After 1094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-11 03:00:08] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 64 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 15 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 260/260 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-11 03:00:08] [INFO ] Invariant cache hit.
[2023-03-11 03:00:08] [INFO ] Implicit Places using invariants in 239 ms returned [34, 39, 41, 43, 45, 47, 49, 51, 76, 78, 80, 82, 85, 89, 90, 91, 92, 93, 198, 210, 214]
Discarding 21 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 246 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/260 places, 206/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 237 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 237 transition count 201
Applied a total of 4 rules in 39 ms. Remains 237 /239 variables (removed 2) and now considering 201/206 (removed 5) transitions.
// Phase 1: matrix 201 rows 237 cols
[2023-03-11 03:00:08] [INFO ] Computed 70 place invariants in 6 ms
[2023-03-11 03:00:08] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-11 03:00:09] [INFO ] Invariant cache hit.
[2023-03-11 03:00:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [157, 159, 161, 163]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 564 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/260 places, 201/208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 232 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 231 transition count 199
Applied a total of 4 rules in 28 ms. Remains 231 /233 variables (removed 2) and now considering 199/201 (removed 2) transitions.
// Phase 1: matrix 199 rows 231 cols
[2023-03-11 03:00:09] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 03:00:09] [INFO ] Invariant cache hit.
[2023-03-11 03:00:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 231/260 places, 199/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1312 ms. Remains : 231/260 places, 199/208 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 505764 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505764 steps, saw 90249 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:00:13] [INFO ] Invariant cache hit.
[2023-03-11 03:00:13] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:00:13] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-11 03:00:13] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-11 03:00:13] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:13] [INFO ] After 85ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:13] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2023-03-11 03:00:13] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 0 ms to minimize.
[2023-03-11 03:00:13] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2023-03-11 03:00:13] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-11 03:00:13] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 779 ms
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2023-03-11 03:00:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-11 03:00:14] [INFO ] After 1058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-11 03:00:14] [INFO ] After 1455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 64 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 231/231 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-11 03:00:14] [INFO ] Invariant cache hit.
[2023-03-11 03:00:14] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-11 03:00:14] [INFO ] Invariant cache hit.
[2023-03-11 03:00:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:00:14] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-11 03:00:14] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 03:00:14] [INFO ] Invariant cache hit.
[2023-03-11 03:00:15] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 231/231 places, 199/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 230 transition count 198
Applied a total of 2 rules in 14 ms. Remains 230 /231 variables (removed 1) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 230 cols
[2023-03-11 03:00:15] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-11 03:00:15] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:00:15] [INFO ] [Nat]Absence check using 48 positive place invariants in 12 ms returned sat
[2023-03-11 03:00:15] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-11 03:00:15] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:15] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-11 03:00:15] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2023-03-11 03:00:15] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 0 ms to minimize.
[2023-03-11 03:00:15] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 0 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 932 ms
[2023-03-11 03:00:16] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2023-03-11 03:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-11 03:00:16] [INFO ] After 1234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-11 03:00:16] [INFO ] After 1442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:00:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-11 03:00:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 199 transitions and 815 arcs took 2 ms.
[2023-03-11 03:00:16] [INFO ] Flatten gal took : 59 ms
Total runtime 65596 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-17
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

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

FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503618125

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 BusinessProcesses-PT-17-ReachabilityFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 BusinessProcesses-PT-17-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 BusinessProcesses-PT-17-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 3 BusinessProcesses-PT-17-ReachabilityFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type EXCL) for BusinessProcesses-PT-17-ReachabilityFireability-02
lola: result : true
lola: markings : 222
lola: fired transitions : 222
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for BusinessProcesses-PT-17-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 7 (type EQUN) for BusinessProcesses-PT-17-ReachabilityFireability-02 (obsolete)
lola: CANCELED task # 9 (type SRCH) for BusinessProcesses-PT-17-ReachabilityFireability-02 (obsolete)
lola: FINISHED task # 6 (type FNDP) for BusinessProcesses-PT-17-ReachabilityFireability-02
lola: result : unknown
lola: fired transitions : 2169
lola: tried executions : 302
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 0 BusinessProcesses-PT-17-ReachabilityFireability-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 BusinessProcesses-PT-17-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 BusinessProcesses-PT-17-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 15 (type SRCH) for 0 BusinessProcesses-PT-17-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/374/ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 7 (type EQUN) for BusinessProcesses-PT-17-ReachabilityFireability-02
lola: result : true
lola: FINISHED task # 16 (type EXCL) for BusinessProcesses-PT-17-ReachabilityFireability-01
lola: result : false
lola: markings : 102563
lola: fired transitions : 128894
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for BusinessProcesses-PT-17-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 13 (type EQUN) for BusinessProcesses-PT-17-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 15 (type SRCH) for BusinessProcesses-PT-17-ReachabilityFireability-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-17-ReachabilityFireability-01: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityFireability-02: EF true tandem / relaxed


Time elapsed: 1 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-17"
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-17, 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-167813692700583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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