fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482700455
Last Updated
May 14, 2023

About the Execution of Marcie+red for DES-PT-30b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10072.827 3600000.00 3646130.00 8855.50 T?TTT??T????F?TT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482700455.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K 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 DES-PT-30b-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678396937649

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 21:22:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 21:22:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:22:19] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-09 21:22:19] [INFO ] Transformed 399 places.
[2023-03-09 21:22:19] [INFO ] Transformed 350 transitions.
[2023-03-09 21:22:19] [INFO ] Found NUPN structural information;
[2023-03-09 21:22:19] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 16) seen :6
FORMULA DES-PT-30b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-00 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :1
FORMULA DES-PT-30b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 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 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 350 rows 399 cols
[2023-03-09 21:22:20] [INFO ] Computed 65 place invariants in 36 ms
[2023-03-09 21:22:20] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 21:22:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-09 21:22:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-09 21:22:23] [INFO ] After 1370ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-09 21:22:23] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 4 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-09 21:22:24] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2023-03-09 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1449 ms
[2023-03-09 21:22:25] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 489 ms
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-09 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 436 ms
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-09 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 503 ms
[2023-03-09 21:22:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2023-03-09 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1118 ms
[2023-03-09 21:22:28] [INFO ] After 6873ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 1241 ms.
[2023-03-09 21:22:30] [INFO ] After 9287ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA DES-PT-30b-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 809 ms.
Support contains 82 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 390 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 390 transition count 339
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 383 transition count 337
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 381 transition count 337
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 20 place count 381 transition count 324
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 46 place count 368 transition count 324
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 61 place count 353 transition count 309
Iterating global reduction 3 with 15 rules applied. Total rules applied 76 place count 353 transition count 309
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 86 place count 343 transition count 299
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 343 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 104 place count 343 transition count 291
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 186 place count 302 transition count 250
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 302 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 190 place count 300 transition count 248
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 300 transition count 248
Applied a total of 192 rules in 118 ms. Remains 300 /399 variables (removed 99) and now considering 248/350 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 300/399 places, 248/350 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 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 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 556436 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 556436 steps, saw 99695 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 248 rows 300 cols
[2023-03-09 21:22:34] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:22:34] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 21:22:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2023-03-09 21:22:34] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 101 ms returned sat
[2023-03-09 21:22:35] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 21:22:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:22:36] [INFO ] After 432ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-03-09 21:22:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-09 21:22:37] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-09 21:22:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2023-03-09 21:22:37] [INFO ] After 1533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-09 21:22:37] [INFO ] After 2964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 382 ms.
Support contains 82 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 248/248 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 300/300 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 248/248 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 21:22:38] [INFO ] Invariant cache hit.
[2023-03-09 21:22:38] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-09 21:22:38] [INFO ] Invariant cache hit.
[2023-03-09 21:22:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:22:38] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-09 21:22:38] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-09 21:22:38] [INFO ] Invariant cache hit.
[2023-03-09 21:22:38] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 300/300 places, 248/248 transitions.
Graph (complete) has 770 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 299 /300 variables (removed 1) and now considering 248/248 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 248 rows 299 cols
[2023-03-09 21:22:38] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-09 21:22:38] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 21:22:38] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-09 21:22:38] [INFO ] [Nat]Absence check using 32 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-09 21:22:39] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 21:22:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 21:22:40] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 21:22:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-09 21:22:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 254 ms
[2023-03-09 21:22:40] [INFO ] After 1661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-09 21:22:41] [INFO ] After 2397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-09 21:22:41] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-09 21:22:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 300 places, 248 transitions and 959 arcs took 3 ms.
[2023-03-09 21:22:41] [INFO ] Flatten gal took : 48 ms
Total runtime 22141 ms.
There are residual formulas that ITS could not solve within timeout
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DES_PT_30b
(NrP: 300 NrTr: 248 NrArc: 959)

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

net check time: 0m 0.000sec

init dd package: 0m 2.726sec


before gc: list nodes free: 461458

after gc: idd nodes used:770520, unused:63229480; list nodes free:277633096

before gc: list nodes free: 3302375

after gc: idd nodes used:962838, unused:63037162; list nodes free:276810304

RS generation: 56m12.020sec


-> reachability set: #nodes 949427 (9.5e+05) #states 648,970,556,519,079,131 (17)



starting MCC model checker
--------------------------

checking: EF [[[p13<=1 & 1<=p13] & [p182<=1 & 1<=p182]]]
normalized: E [true U [[p182<=1 & 1<=p182] & [p13<=1 & 1<=p13]]]

abstracting: (1<=p13)
states: 23,374,327,421,833,904 (16)
abstracting: (p13<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p182)
states: 133,012,567,891,779,088 (17)
abstracting: (p182<=1)
states: 648,970,556,519,079,131 (17)
MC time: 0m29.003sec

checking: AG [[[p52<=0 & 0<=p52] | [p294<=0 & 0<=p294]]]
normalized: ~ [E [true U ~ [[[p294<=0 & 0<=p294] | [p52<=0 & 0<=p52]]]]]

abstracting: (0<=p52)
states: 648,970,556,519,079,131 (17)
abstracting: (p52<=0)
states: 625,596,229,097,245,227 (17)
abstracting: (0<=p294)
states: 648,970,556,519,079,131 (17)
abstracting: (p294<=0)
states: 561,787,531,723,373,567 (17)
MC time: 0m25.014sec

checking: EF [[[p9<=1 & 1<=p9] & [p182<=1 & 1<=p182]]]
normalized: E [true U [[p182<=1 & 1<=p182] & [p9<=1 & 1<=p9]]]

abstracting: (1<=p9)
states: 23,374,327,421,833,904 (16)
abstracting: (p9<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p182)
states: 133,012,567,891,779,088 (17)
abstracting: (p182<=1)
states: 648,970,556,519,079,131 (17)
MC time: 0m22.087sec

checking: AG [[[p19<=0 & 0<=p19] | [p182<=0 & 0<=p182]]]
normalized: ~ [E [true U ~ [[[p19<=0 & 0<=p19] | [p182<=0 & 0<=p182]]]]]

abstracting: (0<=p182)
states: 648,970,556,519,079,131 (17)
abstracting: (p182<=0)
states: 515,957,988,627,300,043 (17)
abstracting: (0<=p19)
states: 648,970,556,519,079,131 (17)
abstracting: (p19<=0)
states: 625,596,229,097,245,227 (17)
MC time: 0m19.012sec

checking: AG [[[[[1<=p128 & p128<=1] & [p194<=1 & 1<=p194]] | [[p150<=0 & 0<=p150] & [[[p145<=0 & 0<=p145] | [p284<=0 & 0<=p284]] | [[p98<=0 & 0<=p98] | [p131<=0 & 0<=p131]]]]] | [[p76<=0 & 0<=p76] | [p178<=0 & 0<=p178]]]]
normalized: ~ [E [true U ~ [[[[[p150<=0 & 0<=p150] & [[[p131<=0 & 0<=p131] | [p98<=0 & 0<=p98]] | [[p284<=0 & 0<=p284] | [p145<=0 & 0<=p145]]]] | [[p194<=1 & 1<=p194] & [1<=p128 & p128<=1]]] | [[p178<=0 & 0<=p178] | [p76<=0 & 0<=p76]]]]]]

abstracting: (0<=p76)
states: 648,970,556,519,079,131 (17)
abstracting: (p76<=0)
states: 626,657,104,814,557,019 (17)
abstracting: (0<=p178)
states: 648,970,556,519,079,131 (17)
abstracting: (p178<=0)
states: 430,167,764,513,793,017 (17)
abstracting: (p128<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p128)
states: 100,853,022,791,303,234 (17)
abstracting: (1<=p194)
states: 571,906,555 (8)
abstracting: (p194<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p145)
states: 648,970,556,519,079,131 (17)
abstracting: (p145<=0)
states: 556,803,790,465,110,553 (17)
abstracting: (0<=p284)
states: 648,970,556,519,079,131 (17)
abstracting: (p284<=0)
states: 582,027,154,607,773,016 (17)
abstracting: (0<=p98)
states: 648,970,556,519,079,131 (17)
abstracting: (p98<=0)
states: 625,596,229,097,245,227 (17)
abstracting: (0<=p131)
states: 648,970,556,519,079,131 (17)
abstracting: (p131<=0)
states: 567,887,213,204,784,643 (17)
abstracting: (0<=p150)
states: 648,970,556,519,079,131 (17)
abstracting: (p150<=0)
states: 648,970,556,519,073,920 (17)
MC time: 0m17.003sec

checking: EF [[[[[1<=p149 & p149<=1] | [p173<=1 & 1<=p173]] & [[[p102<=1 & 1<=p102] & [p131<=1 & 1<=p131]] | [[p65<=1 & 1<=p65] & [p178<=1 & 1<=p178]]]] & [[[[p196<=0 & 0<=p196] | [p278<=0 & 0<=p278]] | [[p289<=0 & 0<=p289] | [[[p141<=0 & 0<=p141] & [[p162<=0 & 0<=p162] & [[p20<=0 & 0<=p20] | [[p182<=0 & 0<=p182] | [p159<=0 & 0<=p159]]]]] | [[p143<=0 & 0<=p143] & [[p67<=0 & 0<=p67] | [p178<=0 & 0<=p178]]]]]] & [[[p142<=0 & 0<=p142] | [[p266<=0 & 0<=p266] | [p274<=0 & 0<=p274]]] | [[p197<=1 & 1<=p197] | [[[p208<=1 & 1<=p208] & [p230<=1 & 1<=p230]] | [[p263<=1 & 1<=p263] & [p280<=1 & 1<=p280]]]]]]]]
normalized: E [true U [[[[[[[p263<=1 & 1<=p263] & [p280<=1 & 1<=p280]] | [[p230<=1 & 1<=p230] & [p208<=1 & 1<=p208]]] | [p197<=1 & 1<=p197]] | [[[p274<=0 & 0<=p274] | [p266<=0 & 0<=p266]] | [p142<=0 & 0<=p142]]] & [[[[[[p178<=0 & 0<=p178] | [p67<=0 & 0<=p67]] & [p143<=0 & 0<=p143]] | [[[[[p159<=0 & 0<=p159] | [p182<=0 & 0<=p182]] | [p20<=0 & 0<=p20]] & [p162<=0 & 0<=p162]] & [p141<=0 & 0<=p141]]] | [p289<=0 & 0<=p289]] | [[p278<=0 & 0<=p278] | [p196<=0 & 0<=p196]]]] & [[[[p178<=1 & 1<=p178] & [p65<=1 & 1<=p65]] | [[p131<=1 & 1<=p131] & [p102<=1 & 1<=p102]]] & [[p173<=1 & 1<=p173] | [1<=p149 & p149<=1]]]]]

abstracting: (p149<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p149)
states: 92,166,766,053,968,578 (16)
abstracting: (1<=p173)
states: 95,760,095,478,757,326 (16)
abstracting: (p173<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p102)
states: 23,374,327,421,833,904 (16)
abstracting: (p102<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p131)
states: 81,083,343,314,294,488 (16)
abstracting: (p131<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p65)
states: 22,313,451,704,522,112 (16)
abstracting: (p65<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p178)
states: 218,802,792,005,286,114 (17)
abstracting: (p178<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p196)
states: 648,970,556,519,079,131 (17)
abstracting: (p196<=0)
states: 622,723,877,812,201,901 (17)
abstracting: (0<=p278)
states: 648,970,556,519,079,131 (17)
abstracting: (p278<=0)
states: 542,979,432,747,092,771 (17)
abstracting: (0<=p289)
states: 648,970,556,519,079,131 (17)
abstracting: (p289<=0)
states: 608,469,214,766,429,055 (17)
abstracting: (0<=p141)
states: 648,970,556,519,079,131 (17)
abstracting: (p141<=0)
states: 577,132,476,215,962,295 (17)
abstracting: (0<=p162)
states: 648,970,556,519,079,131 (17)
abstracting: (p162<=0)
states: 590,309,336,713,386,679 (17)
abstracting: (0<=p20)
states: 648,970,556,519,079,131 (17)
abstracting: (p20<=0)
states: 625,596,229,097,245,227 (17)
abstracting: (0<=p182)
states: 648,970,556,519,079,131 (17)
abstracting: (p182<=0)
states: 515,957,988,627,300,043 (17)
abstracting: (0<=p159)
states: 648,970,556,519,079,131 (17)
abstracting: (p159<=0)
states: 521,350,655,928,136,517 (17)

before gc: list nodes free: 2492184

after gc: idd nodes used:10519238, unused:53480762; list nodes free:234953472
abstracting: (0<=p143)
states: 648,970,556,519,079,131 (17)
abstracting: (p143<=0)
states: 480,539,091,214,801,365 (17)
abstracting: (0<=p67)
states: 648,970,556,519,079,131 (17)
abstracting: (p67<=0)
states: 626,657,104,814,557,019 (17)
abstracting: (0<=p178)
states: 648,970,556,519,079,131 (17)
abstracting: (p178<=0)
states: 430,167,764,513,793,017 (17)
abstracting: (0<=p142)
states: 648,970,556,519,079,131 (17)
abstracting: (p142<=0)
states: 480,539,091,214,801,365 (17)
abstracting: (0<=p266)
states: 648,970,556,519,079,131 (17)
abstracting: (p266<=0)
states: 619,113,142,970,283,485 (17)
abstracting: (0<=p274)
states: 648,970,556,519,079,131 (17)
abstracting: (p274<=0)
states: 586,537,779,951,531,563 (17)
abstracting: (1<=p197)
states: 43,015,678,230,559,582 (16)
abstracting: (p197<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p208)
states: 370,477,347,114,169,554 (17)
abstracting: (p208<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p230)
states: 233,953,150,283,849,656 (17)
abstracting: (p230<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p280)
states: 10,693,750,840,626,480 (16)
abstracting: (p280<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p263)
states: 317,927,728,155,035,549 (17)
abstracting: (p263<=1)
states: 648,970,556,519,079,131 (17)
MC time: 0m43.039sec

checking: EF [[[[p212<=1 & 1<=p212] & [p236<=1 & 1<=p236]] & [[p161<=1 & 1<=p161] & [[p130<=1 & 1<=p130] | [[[p237<=1 & 1<=p237] & [[p257<=1 & 1<=p257] & [[[p173<=1 & 1<=p173] & [[p147<=0 & 0<=p147] & [[p66<=0 & 0<=p66] | [[p178<=0 & 0<=p178] | [p219<=1 & 1<=p219]]]]] | [[[p199<=0 & 0<=p199] | [[p264<=1 & 1<=p264] & [p138<=1 & 1<=p138]]] & [[[p222<=0 & 0<=p222] | [[p245<=0 & 0<=p245] | [p88<=0 & 0<=p88]]] | [[p178<=0 & 0<=p178] | [[[p129<=1 & 1<=p129] & [p169<=1 & 1<=p169]] | [[p232<=0 & 0<=p232] & [[p33<=0 & 0<=p33] | [p294<=0 & 0<=p294]]]]]]]]]] | [[p293<=1 & 1<=p293] & [p143<=1 & 1<=p143]]]]]]]
normalized: E [true U [[[[[[p143<=1 & 1<=p143] & [p293<=1 & 1<=p293]] | [[[[[[[[[[p294<=0 & 0<=p294] | [p33<=0 & 0<=p33]] & [p232<=0 & 0<=p232]] | [[p169<=1 & 1<=p169] & [p129<=1 & 1<=p129]]] | [p178<=0 & 0<=p178]] | [[[p88<=0 & 0<=p88] | [p245<=0 & 0<=p245]] | [p222<=0 & 0<=p222]]] & [[[p138<=1 & 1<=p138] & [p264<=1 & 1<=p264]] | [p199<=0 & 0<=p199]]] | [[[[[p219<=1 & 1<=p219] | [p178<=0 & 0<=p178]] | [p66<=0 & 0<=p66]] & [p147<=0 & 0<=p147]] & [p173<=1 & 1<=p173]]] & [p257<=1 & 1<=p257]] & [p237<=1 & 1<=p237]]] | [p130<=1 & 1<=p130]] & [p161<=1 & 1<=p161]] & [[p236<=1 & 1<=p236] & [p212<=1 & 1<=p212]]]]

abstracting: (1<=p212)
states: 373,028,344,400,981,758 (17)
abstracting: (p212<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p236)
states: 135,681,967,914,705,672 (17)
abstracting: (p236<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p161)
states: 56,986,320,364,294,028 (16)
abstracting: (p161<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p130)
states: 109,612,173,283,787,274 (17)
abstracting: (p130<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p237)
states: 257,491,073,381,015,104 (17)
abstracting: (p237<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p257)
states: 248,921,366,767,273,600 (17)
abstracting: (p257<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p173)
states: 95,760,095,478,757,326 (16)
abstracting: (p173<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p147)
states: 648,970,556,519,079,131 (17)
abstracting: (p147<=0)
states: 508,818,810,367,482,802 (17)
abstracting: (0<=p66)
states: 648,970,556,519,079,131 (17)
abstracting: (p66<=0)
states: 626,657,104,814,557,019 (17)
abstracting: (0<=p178)
states: 648,970,556,519,079,131 (17)
abstracting: (p178<=0)
states: 430,167,764,513,793,017 (17)
abstracting: (1<=p219)
states: 6,972,296,165,340 (12)
abstracting: (p219<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p199)
states: 648,970,556,519,079,131 (17)
abstracting: (p199<=0)
states: 504,562,527,667,778,821 (17)
abstracting: (1<=p264)
states: 317,927,721,546,654,924 (17)
abstracting: (p264<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p138)
states: 81,083,343,314,291,014 (16)
abstracting: (p138<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p222)
states: 648,970,556,519,079,131 (17)
abstracting: (p222<=0)
states: 397,637,900,586,493,943 (17)
abstracting: (0<=p245)
states: 648,970,556,519,079,131 (17)
abstracting: (p245<=0)
states: 385,239,842,683,758,987 (17)
abstracting: (0<=p88)
states: 648,970,556,519,079,131 (17)
abstracting: (p88<=0)
states: 631,575,930,725,221,257 (17)
abstracting: (0<=p178)
states: 648,970,556,519,079,131 (17)
abstracting: (p178<=0)
states: 430,167,764,513,793,017 (17)
abstracting: (1<=p129)
states: 109,612,173,283,787,274 (17)
abstracting: (p129<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p169)
states: 111,509,807,549,130,170 (17)
abstracting: (p169<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (0<=p232)
states: 648,970,556,519,079,131 (17)
abstracting: (p232<=0)
states: 394,023,332,956,139,235 (17)
abstracting: (0<=p33)
states: 648,970,556,519,079,131 (17)
abstracting: (p33<=0)
states: 625,596,229,097,245,227 (17)
abstracting: (0<=p294)
states: 648,970,556,519,079,131 (17)
abstracting: (p294<=0)
states: 561,787,531,723,373,567 (17)
abstracting: (1<=p293)
states: 40,501,341,752,650,076 (16)
abstracting: (p293<=1)
states: 648,970,556,519,079,131 (17)
abstracting: (1<=p143)
states: 168,431,465,304,277,766 (17)
abstracting: (p143<=1)
states: 648,970,556,519,079,131 (17)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6074164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100436 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
check for maximal unmarked siphon
ok
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.000sec

97898 94277 118270 368507 544977 633136 680701 698069 758435 770010 784393 753768 809383 841564 870059 914420 957546 964716
iterations count:1808305 (7291), effective:171126 (690)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 28 sec


sat_reach.icc:155: Timeout: after 24 sec


sat_reach.icc:155: Timeout: after 21 sec


sat_reach.icc:155: Timeout: after 18 sec


sat_reach.icc:155: Timeout: after 16 sec


sat_reach.icc:155: Timeout: after 14 sec


sat_reach.icc:155: Timeout: after 8 sec

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="DES-PT-30b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-30b, 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 r106-tall-167814482700455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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