Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247000210.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 CryptoMiner-PT-D20N100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K Mar 31 16:48 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 CryptoMiner-PT-D20N100-CTLFireability-00
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-01
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-02
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-03
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-04
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-05
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-06
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-07
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-08
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-09
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-10
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-11
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-12
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-13
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-14
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680887395752

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:09:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 17:09:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:09:57] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-04-07 17:09:57] [INFO ] Transformed 63 places.
[2023-04-07 17:09:57] [INFO ] Transformed 63 transitions.
[2023-04-07 17:09:57] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 62 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 9 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 17:09:57] [INFO ] Computed 0 invariants in 9 ms
[2023-04-07 17:09:57] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-04-07 17:09:57] [INFO ] Invariant cache hit.
[2023-04-07 17:09:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:09:57] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-04-07 17:09:57] [INFO ] Invariant cache hit.
[2023-04-07 17:09:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 62 out of 62 places after structural reductions.
[2023-04-07 17:09:57] [INFO ] Flatten gal took : 23 ms
[2023-04-07 17:09:57] [INFO ] Flatten gal took : 11 ms
[2023-04-07 17:09:57] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10088 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=190 ) properties (out of 52) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-04-07 17:09:58] [INFO ] Invariant cache hit.
[2023-04-07 17:09:58] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :1 sat :6 real:4
[2023-04-07 17:09:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:09:58] [INFO ] After 29ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :1 sat :0 real:10
[2023-04-07 17:09:58] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-04-07 17:09:58] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-04-07 17:09:58] [INFO ] After 41ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :10
[2023-04-07 17:09:58] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 17:09:58] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 211 ms.
Support contains 25 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 55
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 54 transition count 55
Applied a total of 16 rules in 10 ms. Remains 54 /62 variables (removed 8) and now considering 55/63 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 54/62 places, 55/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1258 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 55 rows 54 cols
[2023-04-07 17:09:59] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 17:09:59] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:1
[2023-04-07 17:09:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:09:59] [INFO ] After 21ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :4 real:4
[2023-04-07 17:09:59] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 17:09:59] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:7
[2023-04-07 17:09:59] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 17:09:59] [INFO ] After 22ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 17:09:59] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 17:09:59] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 65 ms.
Support contains 24 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 54/54 places, 55/55 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2012 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-04-07 17:09:59] [INFO ] Invariant cache hit.
[2023-04-07 17:09:59] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-04-07 17:09:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:09:59] [INFO ] After 21ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :3 real:4
[2023-04-07 17:09:59] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 17:09:59] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-04-07 17:09:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 17:09:59] [INFO ] After 23ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 17:09:59] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-07 17:09:59] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 100 ms.
Support contains 21 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 55/55 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 53
Applied a total of 4 rules in 5 ms. Remains 52 /54 variables (removed 2) and now considering 53/55 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/54 places, 53/55 transitions.
Incomplete random walk after 10086 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1008 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 406362 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406362 steps, saw 199003 distinct states, run finished after 3006 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 53 rows 52 cols
[2023-04-07 17:10:03] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:10:03] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:1
[2023-04-07 17:10:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:10:03] [INFO ] After 19ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :3 real:4
[2023-04-07 17:10:03] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 17:10:03] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-04-07 17:10:03] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 17:10:03] [INFO ] After 24ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 17:10:03] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 17:10:03] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 34 ms.
Support contains 21 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 52/52 places, 53/53 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2023-04-07 17:10:03] [INFO ] Invariant cache hit.
[2023-04-07 17:10:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 17:10:03] [INFO ] Invariant cache hit.
[2023-04-07 17:10:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 17:10:03] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-07 17:10:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 17:10:03] [INFO ] Invariant cache hit.
[2023-04-07 17:10:03] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 52/52 places, 53/53 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 52 transition count 46
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 16 place count 45 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 43 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 42 transition count 43
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 27 place count 42 transition count 36
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 34 place count 35 transition count 36
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 35 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 32 transition count 33
Applied a total of 40 rules in 7 ms. Remains 32 /52 variables (removed 20) and now considering 33/53 (removed 20) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 33 rows 32 cols
[2023-04-07 17:10:03] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 17:10:03] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 17:10:03] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 17:10:03] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 17:10:03] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 7 ms
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 15 ms
[2023-04-07 17:10:03] [INFO ] Input system was already deterministic with 63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 4 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 42/62 places, 43/63 transitions.
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:03] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:03] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:03] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 37 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 3 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 42/62 places, 43/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:10:04] [INFO ] Input system was already deterministic with 63 transitions.
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 6 ms
[2023-04-07 17:10:04] [INFO ] Flatten gal took : 6 ms
[2023-04-07 17:10:04] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-04-07 17:10:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 63 transitions and 186 arcs took 1 ms.
Total runtime 7097 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 62 NrTr: 63 NrArc: 186)

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

net check time: 0m 0.000sec

init dd package: 0m 2.757sec


RS generation: 0m 7.882sec


-> reachability set: #nodes 9500 (9.5e+03) #states 146,259,114,410,413,078,467,626,050 (26)



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

checking: EG [~ [E [1<=p42 U 1<=p50]]]
normalized: EG [~ [E [1<=p42 U 1<=p50]]]

abstracting: (1<=p50)
states: 9,608,286,128,054,012,028,620,611 (24)
abstracting: (1<=p42)
states: 517,149,983,312,749,648,496,616 (23)
..................
EG iterations: 18
-> the formula is TRUE

FORMULA CryptoMiner-PT-D20N100-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.779sec

checking: EF [[EG [1<=p58] & [p5<=0 | EX [[p19<=0 | [p39<=0 | p60<=0]]]]]]
normalized: E [true U [[EX [[[p39<=0 | p60<=0] | p19<=0]] | p5<=0] & EG [1<=p58]]]

abstracting: (1<=p58)
states: 4,971,830,011,943,067,418,306,166 (24)
..
EG iterations: 2
abstracting: (p5<=0)
states: 30,408,357,497,057,063,882,313,615 (25)
abstracting: (p19<=0)
states: 30,408,357,497,057,063,882,313,615 (25)
abstracting: (p60<=0)
states: 139,572,703,967,557,405,661,245,095 (26)
abstracting: (p39<=0)
states: 127,361,656,812,251,591,956,075,023 (26)
.-> the formula is TRUE

FORMULA CryptoMiner-PT-D20N100-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.192sec

checking: AG [AF [[AF [[p8<=0 & p48<=0]] | [p11<=0 & [1<=p58 | [1<=p11 & [1<=p31 & 1<=p52]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[1<=p31 & 1<=p52] & 1<=p11] | 1<=p58] & p11<=0] | ~ [EG [~ [[p8<=0 & p48<=0]]]]]]]]]

abstracting: (p48<=0)
states: 136,878,572,960,624,262,423,610,886 (26)
abstracting: (p8<=0)
states: 30,408,357,497,057,063,882,313,615 (25)
.......
EG iterations: 7
abstracting: (p11<=0)
states: 30,408,357,497,057,063,882,313,615 (25)
abstracting: (1<=p58)
states: 4,971,830,011,943,067,418,306,166 (24)
abstracting: (1<=p11)
states: 115,850,756,913,356,014,585,312,435 (26)
abstracting: (1<=p52)
states: 9,740,480,750,253,846,479,523,900 (24)
abstracting: (1<=p31)
states: 301,383,857,336,712,355,539,239 (23)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA CryptoMiner-PT-D20N100-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.553sec

checking: E [EG [A [AF [AX [[1<=p9 & [1<=p29 & 1<=p50]]]] U EX [[1<=p55 | [1<=p2 & [1<=p22 & 1<=p43]]]]]] U AF [1<=p1]]
normalized: E [EG [[~ [EG [~ [EX [[1<=p55 | [1<=p2 & [1<=p22 & 1<=p43]]]]]]] & ~ [E [~ [EX [[1<=p55 | [1<=p2 & [1<=p22 & 1<=p43]]]]] U [EG [EX [~ [[1<=p9 & [1<=p29 & 1<=p50]]]]] & ~ [EX [[1<=p55 | [1<=p2 & [1<=p22 & 1<=p43]]]]]]]]]] U ~ [EG [~ [1<=p1]]]]

abstracting: (1<=p1)
states: 115,850,756,913,356,014,585,312,435 (26)
.........................................................MC time: 4m38.935sec

checking: [E [[AX [1<=p54] | ~ [[AF [[1<=p11 & [1<=p31 & 1<=p52]]] | [1<=p8 & [1<=p28 & 1<=p49]]]]] U 1<=p5] & EF [1<=p5]]
normalized: [E [true U 1<=p5] & E [[~ [[[1<=p8 & [1<=p28 & 1<=p49]] | ~ [EG [~ [[1<=p11 & [1<=p31 & 1<=p52]]]]]]] | ~ [EX [~ [1<=p54]]]] U 1<=p5]]

abstracting: (1<=p5)
states: 115,850,756,913,356,014,585,312,435 (26)
abstracting: (1<=p54)
states: 9,783,605,245,086,567,914,309,745 (24)
.abstracting: (1<=p52)
states: 9,740,480,750,253,846,479,523,900 (24)
abstracting: (1<=p31)
states: 301,383,857,336,712,355,539,239 (23)
abstracting: (1<=p11)
states: 115,850,756,913,356,014,585,312,435 (26)
.
EG iterations: 1
abstracting: (1<=p49)
states: 9,509,590,776,862,313,894,886,362 (24)
abstracting: (1<=p28)
states: 1,191,283,884,257,542,042,960,023 (24)
abstracting: (1<=p8)
states: 115,850,756,913,356,014,585,312,435 (26)
abstracting: (1<=p5)
states: 115,850,756,913,356,014,585,312,435 (26)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D20N100-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.096sec

checking: E [~ [[EG [[AX [1<=p7] | [[1<=p5 & [1<=p25 & 1<=p46]] | 1<=p18]]] & EX [~ [AX [[1<=p3 & [1<=p23 & 1<=p44]]]]]]] U EF [[E [EG [1<=p60] U E [1<=p43 U [1<=p7 & [1<=p27 & 1<=p48]]]] & p53<=0]]]
normalized: E [~ [[EX [EX [~ [[1<=p3 & [1<=p23 & 1<=p44]]]]] & EG [[[1<=p18 | [1<=p5 & [1<=p25 & 1<=p46]]] | ~ [EX [~ [1<=p7]]]]]]] U E [true U [p53<=0 & E [EG [1<=p60] U E [1<=p43 U [1<=p7 & [1<=p27 & 1<=p48]]]]]]]

abstracting: (1<=p48)
states: 9,380,541,449,788,816,044,015,164 (24)
abstracting: (1<=p27)
states: 1,775,057,853,507,352,185,951,612 (24)
abstracting: (1<=p7)
states: 115,850,756,913,356,014,585,312,435 (26)
abstracting: (1<=p43)
states: 7,914,409,349,762,849,965,125,203 (24)
abstracting: (1<=p60)
states: 6,686,410,442,855,672,806,380,955 (24)
..
EG iterations: 2

BK_STOP 1680887758168

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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


iterations count:13700 (217), effective:2379 (37)

initing FirstDep: 0m 0.000sec


iterations count:63 (1), effective:0 (0)

iterations count:80 (1), effective:6 (0)

iterations count:199 (3), effective:47 (0)

net_ddint.h:600: Timeout: after 275 sec


iterations count:128 (2), effective:22 (0)

iterations count:121 (1), effective:20 (0)

iterations count:63 (1), effective:0 (0)

iterations count:63 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 514 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="CryptoMiner-PT-D20N100"
export BK_EXAMINATION="CTLFireability"
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 CryptoMiner-PT-D20N100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247000210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;