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.r042-tajo-167813696000598.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 marciexred
Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 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 189K 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678735277184

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:21:18] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-13 19:21:18] [INFO ] Transformed 772 places.
[2023-03-13 19:21:18] [INFO ] Transformed 685 transitions.
[2023-03-13 19:21:18] [INFO ] Found NUPN structural information;
[2023-03-13 19:21:18] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-13 19:21:20] [INFO ] Computed 125 place invariants in 26 ms
[2023-03-13 19:21:20] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 19:21:20] [INFO ] [Nat]Absence check using 78 positive place invariants in 27 ms returned sat
[2023-03-13 19:21:20] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-13 19:21:21] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-13 19:21:21] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 7 ms to minimize.
[2023-03-13 19:21:22] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 1 ms to minimize.
[2023-03-13 19:21:22] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:21:22] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 2 ms to minimize.
[2023-03-13 19:21:22] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:21:22] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2023-03-13 19:21:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2021 ms
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:21:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 833 ms
[2023-03-13 19:21:25] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:21:25] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 1 ms to minimize.
[2023-03-13 19:21:25] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:21:25] [INFO ] Deduced a trap composed of 187 places in 220 ms of which 1 ms to minimize.
[2023-03-13 19:21:26] [INFO ] Deduced a trap composed of 194 places in 208 ms of which 1 ms to minimize.
[2023-03-13 19:21:26] [INFO ] Deduced a trap composed of 181 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:21:26] [INFO ] Deduced a trap composed of 180 places in 198 ms of which 1 ms to minimize.
[2023-03-13 19:21:26] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 0 ms to minimize.
[2023-03-13 19:21:27] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 0 ms to minimize.
[2023-03-13 19:21:27] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 1 ms to minimize.
[2023-03-13 19:21:27] [INFO ] Deduced a trap composed of 183 places in 204 ms of which 0 ms to minimize.
[2023-03-13 19:21:27] [INFO ] Deduced a trap composed of 200 places in 200 ms of which 0 ms to minimize.
[2023-03-13 19:21:27] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 0 ms to minimize.
[2023-03-13 19:21:28] [INFO ] Deduced a trap composed of 209 places in 216 ms of which 0 ms to minimize.
[2023-03-13 19:21:28] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-13 19:21:28] [INFO ] Deduced a trap composed of 180 places in 218 ms of which 1 ms to minimize.
[2023-03-13 19:21:28] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:21:29] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 3 ms to minimize.
[2023-03-13 19:21:29] [INFO ] Deduced a trap composed of 178 places in 194 ms of which 1 ms to minimize.
[2023-03-13 19:21:29] [INFO ] Deduced a trap composed of 187 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:21:29] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:21:30] [INFO ] Deduced a trap composed of 186 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:21:30] [INFO ] Deduced a trap composed of 191 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:21:30] [INFO ] Deduced a trap composed of 188 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:21:31] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-13 19:21:31] [INFO ] Deduced a trap composed of 149 places in 235 ms of which 1 ms to minimize.
[2023-03-13 19:21:31] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2023-03-13 19:21:31] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 0 ms to minimize.
[2023-03-13 19:21:32] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2023-03-13 19:21:32] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 0 ms to minimize.
[2023-03-13 19:21:32] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-13 19:21:32] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 0 ms to minimize.
[2023-03-13 19:21:33] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2023-03-13 19:21:33] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 1 ms to minimize.
[2023-03-13 19:21:33] [INFO ] Deduced a trap composed of 161 places in 202 ms of which 1 ms to minimize.
[2023-03-13 19:21:33] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:21:34] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:21:34] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 1 ms to minimize.
[2023-03-13 19:21:34] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2023-03-13 19:21:34] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 5 ms to minimize.
[2023-03-13 19:21:34] [INFO ] Deduced a trap composed of 177 places in 178 ms of which 1 ms to minimize.
[2023-03-13 19:21:35] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:21:35] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:21:35] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 0 ms to minimize.
[2023-03-13 19:21:35] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:21:35] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:21:36] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 2 ms to minimize.
[2023-03-13 19:21:36] [INFO ] Deduced a trap composed of 148 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:21:36] [INFO ] Deduced a trap composed of 140 places in 185 ms of which 3 ms to minimize.
[2023-03-13 19:21:36] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 0 ms to minimize.
[2023-03-13 19:21:36] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:21:37] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 4 ms to minimize.
[2023-03-13 19:21:37] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:21:37] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 0 ms to minimize.
[2023-03-13 19:21:37] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 0 ms to minimize.
[2023-03-13 19:21:37] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:21:38] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2023-03-13 19:21:38] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:21:38] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 1 ms to minimize.
[2023-03-13 19:21:38] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-13 19:21:38] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:21:39] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-13 19:21:39] [INFO ] Deduced a trap composed of 174 places in 208 ms of which 1 ms to minimize.
[2023-03-13 19:21:39] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 1 ms to minimize.
[2023-03-13 19:21:39] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2023-03-13 19:21:40] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:21:40] [INFO ] Deduced a trap composed of 163 places in 200 ms of which 1 ms to minimize.
[2023-03-13 19:21:40] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-13 19:21:40] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 0 ms to minimize.
[2023-03-13 19:21:41] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:21:41] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 1 ms to minimize.
[2023-03-13 19:21:41] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-13 19:21:41] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 0 ms to minimize.
[2023-03-13 19:21:41] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:21:42] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:21:42] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-13 19:21:42] [INFO ] Deduced a trap composed of 155 places in 184 ms of which 0 ms to minimize.
[2023-03-13 19:21:42] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 0 ms to minimize.
[2023-03-13 19:21:43] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:21:43] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:21:43] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:21:43] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:21:43] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:21:44] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:21:44] [INFO ] Deduced a trap composed of 180 places in 196 ms of which 1 ms to minimize.
[2023-03-13 19:21:44] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:21:44] [INFO ] Deduced a trap composed of 163 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:21:45] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 0 ms to minimize.
[2023-03-13 19:21:45] [INFO ] Deduced a trap composed of 167 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:21:45] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-13 19:21:45] [INFO ] Trap strengthening (SAT) tested/added 90/90 trap constraints in 20623 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-13 19:21:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:21:45] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 64 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 369 edges and 757 vertex of which 4 / 757 are part of one of the 1 SCC in 12 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1516 edges and 754 vertex of which 747 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 140 place count 747 transition count 527
Reduce places removed 138 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 153 rules applied. Total rules applied 293 place count 609 transition count 512
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 308 place count 594 transition count 512
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 308 place count 594 transition count 416
Deduced a syphon composed of 96 places in 3 ms
Ensure Unique test removed 15 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 515 place count 483 transition count 416
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 594 place count 404 transition count 337
Iterating global reduction 3 with 79 rules applied. Total rules applied 673 place count 404 transition count 337
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 673 place count 404 transition count 330
Deduced a syphon composed of 7 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 689 place count 395 transition count 330
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 901 place count 288 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 903 place count 287 transition count 227
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 905 place count 287 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 907 place count 285 transition count 225
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 912 place count 285 transition count 225
Applied a total of 912 rules in 209 ms. Remains 285 /757 variables (removed 472) and now considering 225/670 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 285/757 places, 225/670 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 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 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 225 rows 285 cols
[2023-03-13 19:21:46] [INFO ] Computed 100 place invariants in 21 ms
[2023-03-13 19:21:46] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:21:46] [INFO ] [Nat]Absence check using 72 positive place invariants in 15 ms returned sat
[2023-03-13 19:21:46] [INFO ] [Nat]Absence check using 72 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-13 19:21:47] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:21:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:21:47] [INFO ] After 255ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:21:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-13 19:21:47] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-13 19:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-13 19:21:47] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:21:47] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:21:47] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 0 ms to minimize.
[2023-03-13 19:21:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1325 ms
[2023-03-13 19:21:49] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-13 19:21:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 131 ms
[2023-03-13 19:21:49] [INFO ] After 2063ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-13 19:21:49] [INFO ] After 2552ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 38 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 225/225 transitions.
Graph (complete) has 941 edges and 285 vertex of which 284 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 284 transition count 217
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 276 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 275 transition count 216
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 19 place count 275 transition count 209
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 34 place count 267 transition count 209
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 265 transition count 207
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 265 transition count 207
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 74 place count 247 transition count 189
Applied a total of 74 rules in 57 ms. Remains 247 /285 variables (removed 38) and now considering 189/225 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 247/285 places, 189/225 transitions.
Incomplete random walk after 10000 steps, including 529 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 834208 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 834208 steps, saw 203805 distinct states, run finished after 3003 ms. (steps per millisecond=277 ) properties seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 189 rows 247 cols
[2023-03-13 19:21:52] [INFO ] Computed 98 place invariants in 8 ms
[2023-03-13 19:21:52] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:21:52] [INFO ] [Nat]Absence check using 71 positive place invariants in 12 ms returned sat
[2023-03-13 19:21:52] [INFO ] [Nat]Absence check using 71 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-13 19:21:52] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:21:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:21:52] [INFO ] After 10ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:21:52] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 19:21:52] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 189/189 transitions.
Graph (trivial) has 34 edges and 247 vertex of which 2 / 247 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 888 edges and 246 vertex of which 245 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 245 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 242 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 8 place count 242 transition count 169
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 47 place count 218 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 215 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 215 transition count 166
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 82 place count 200 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 199 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 199 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 86 place count 198 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 198 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 197 transition count 150
Applied a total of 88 rules in 51 ms. Remains 197 /247 variables (removed 50) and now considering 150/189 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 197/247 places, 150/189 transitions.
Incomplete random walk after 10000 steps, including 461 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 66136 steps, run visited all 1 properties in 288 ms. (steps per millisecond=229 )
Probabilistic random walk after 66136 steps, saw 27419 distinct states, run finished after 288 ms. (steps per millisecond=229 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 34638 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_19
(NrP: 772 NrTr: 685 NrArc: 1981)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.042sec

net check time: 0m 0.000sec

init dd package: 0m 3.014sec


before gc: list nodes free: 1595601

after gc: idd nodes used:44491176, unused:19508824; list nodes free:85748234

RS generation: 32m50.441sec


-> last computed set: #nodes 44490471 (4.4e+07) #states 285,825,452,126,109,631 (17)


CANNOT_COMPUTE


BK_STOP 1678737321897

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p111
p298
p431
p112
p296
p297
p300
p301
p302
p304
p305
p306
p356
p421
p436

The net has transition(s) that can never fire:
t271
t475
t476
t550
t551
t552
t275
t283
t334
t341
t342
t344
t345
t347
t348

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

idd.cc:820: DD Exception: No free nodes

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-19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-19, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813696000598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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