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

About the Execution of LTSMin+red for Murphy-COL-D2N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15784.212 1163006.00 4598533.00 359.30 T?FF?F??????T?F? 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.r521-tall-167987246500290.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 ltsminxred
Input is Murphy-COL-D2N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246500290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K 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 Murphy-COL-D2N050-CTLFireability-00
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-01
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-02
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-03
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-04
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-05
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-06
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-07
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-08
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-09
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-10
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-11
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-12
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-13
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-14
FORMULA_NAME Murphy-COL-D2N050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680894294910

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D2N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 19:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 19:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 19:04:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 19:05:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 19:05:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1105 ms
[2023-04-07 19:05:00] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
[2023-04-07 19:05:01] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-07 19:05:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 155 steps, including 0 resets, run visited all 3 properties in 32 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 1 ms.
[2023-04-07 19:05:01] [INFO ] Flatten gal took : 52 ms
[2023-04-07 19:05:01] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-07 19:05:01] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 19 ms.
[2023-04-07 19:05:01] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D2N050-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 11 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 19:05:01] [INFO ] Computed 4 invariants in 3 ms
[2023-04-07 19:05:01] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
[2023-04-07 19:05:01] [INFO ] Invariant cache hit.
[2023-04-07 19:05:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 19:05:01] [INFO ] Invariant cache hit.
[2023-04-07 19:05:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:01] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-04-07 19:05:01] [INFO ] Invariant cache hit.
[2023-04-07 19:05:02] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 19:05:02] [INFO ] Flatten gal took : 20 ms
[2023-04-07 19:05:02] [INFO ] Flatten gal took : 32 ms
[2023-04-07 19:05:02] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10038 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 35) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-04-07 19:05:03] [INFO ] Invariant cache hit.
[2023-04-07 19:05:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 19:05:03] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-04-07 19:05:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 19:05:03] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-07 19:05:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:03] [INFO ] After 45ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-07 19:05:03] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-04-07 19:05:03] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:04] [INFO ] Invariant cache hit.
[2023-04-07 19:05:04] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 366143 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366143 steps, saw 235597 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 19:05:07] [INFO ] Invariant cache hit.
[2023-04-07 19:05:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 19:05:07] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 19:05:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 19:05:07] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 19:05:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:07] [INFO ] After 68ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:05:07] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-04-07 19:05:07] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 88 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:08] [INFO ] Invariant cache hit.
[2023-04-07 19:05:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-04-07 19:05:08] [INFO ] Invariant cache hit.
[2023-04-07 19:05:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:08] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-04-07 19:05:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 19:05:08] [INFO ] Invariant cache hit.
[2023-04-07 19:05:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 19:05:08] [INFO ] Invariant cache hit.
[2023-04-07 19:05:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 19:05:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 19:05:08] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 19:05:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 19:05:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 19:05:08] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 19:05:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:08] [INFO ] After 46ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 19:05:08] [INFO ] Deduced a trap composed of 2 places in 79 ms of which 1 ms to minimize.
[2023-04-07 19:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 19:05:08] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 19:05:08] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-04-07 19:05:08] [INFO ] Flatten gal took : 8 ms
[2023-04-07 19:05:08] [INFO ] Flatten gal took : 5 ms
[2023-04-07 19:05:08] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:08] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:09] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:09] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:09] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:09] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 6 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:09] [INFO ] Invariant cache hit.
[2023-04-07 19:05:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:09] [INFO ] Flatten gal took : 5 ms
[2023-04-07 19:05:09] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2093737 steps, run timeout after 3001 ms. (steps per millisecond=697 ) properties seen :{}
Probabilistic random walk after 2093737 steps, saw 1319665 distinct states, run finished after 3001 ms. (steps per millisecond=697 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 19:05:12] [INFO ] Invariant cache hit.
[2023-04-07 19:05:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 19:05:12] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 19:05:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 19:05:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 19:05:12] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 19:05:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 19:05:12] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 19:05:12] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 19:05:13] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Graph (complete) has 69 edges and 18 vertex of which 9 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 12
Applied a total of 4 rules in 2 ms. Remains 9 /18 variables (removed 9) and now considering 12/21 (removed 9) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-04-07 19:05:13] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 19:05:13] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 9/18 places, 12/21 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 1) seen :0
Probably explored full state space saw : 216 states, properties seen :0
Probabilistic random walk after 1080 steps, saw 216 distinct states, run finished after 17 ms. (steps per millisecond=63 ) properties seen :0
Explored full state space saw : 216 states, properties seen :0
Exhaustive walk after 1080 steps, saw 216 distinct states, run finished after 11 ms. (steps per millisecond=98 ) properties seen :0
FORMULA Murphy-COL-D2N050-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 19:05:14] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 19:05:14] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 3 ms
[2023-04-07 19:05:14] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:14] [INFO ] Invariant cache hit.
[2023-04-07 19:05:14] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:14] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:14] [INFO ] Invariant cache hit.
[2023-04-07 19:05:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:14] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:14] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:14] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:15] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:15] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:15] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA Murphy-COL-D2N050-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:15] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 19:05:15] [INFO ] Invariant cache hit.
[2023-04-07 19:05:15] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 19:05:15] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 3 ms
[2023-04-07 19:05:15] [INFO ] Flatten gal took : 4 ms
[2023-04-07 19:05:15] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2023-04-07 19:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 16376 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/587/ctl_0_ --ctl=/tmp/587/ctl_1_ --ctl=/tmp/587/ctl_2_ --ctl=/tmp/587/ctl_3_ --ctl=/tmp/587/ctl_4_ --ctl=/tmp/587/ctl_5_ --ctl=/tmp/587/ctl_6_ --ctl=/tmp/587/ctl_7_ --ctl=/tmp/587/ctl_8_ --ctl=/tmp/587/ctl_9_ --ctl=/tmp/587/ctl_10_ --ctl=/tmp/587/ctl_11_ --ctl=/tmp/587/ctl_12_ --mu-par --mu-opt
FORMULA Murphy-COL-D2N050-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-01
FORMULA Murphy-COL-D2N050-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Murphy-COL-D2N050-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-04
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-06
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-07
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-08
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-09
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-10
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-11
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-13
Could not compute solution for formula : Murphy-COL-D2N050-CTLFireability-15

BK_STOP 1680895457916

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
ctl formula name Murphy-COL-D2N050-CTLFireability-00
ctl formula formula --ctl=/tmp/587/ctl_0_
ctl formula name Murphy-COL-D2N050-CTLFireability-01
ctl formula formula --ctl=/tmp/587/ctl_1_
ctl formula name Murphy-COL-D2N050-CTLFireability-02
ctl formula formula --ctl=/tmp/587/ctl_2_
ctl formula name Murphy-COL-D2N050-CTLFireability-03
ctl formula formula --ctl=/tmp/587/ctl_3_
ctl formula name Murphy-COL-D2N050-CTLFireability-04
ctl formula formula --ctl=/tmp/587/ctl_4_
ctl formula name Murphy-COL-D2N050-CTLFireability-06
ctl formula formula --ctl=/tmp/587/ctl_5_
ctl formula name Murphy-COL-D2N050-CTLFireability-07
ctl formula formula --ctl=/tmp/587/ctl_6_
ctl formula name Murphy-COL-D2N050-CTLFireability-08
ctl formula formula --ctl=/tmp/587/ctl_7_
ctl formula name Murphy-COL-D2N050-CTLFireability-09
ctl formula formula --ctl=/tmp/587/ctl_8_
ctl formula name Murphy-COL-D2N050-CTLFireability-10
ctl formula formula --ctl=/tmp/587/ctl_9_
ctl formula name Murphy-COL-D2N050-CTLFireability-11
ctl formula formula --ctl=/tmp/587/ctl_10_
ctl formula name Murphy-COL-D2N050-CTLFireability-13
ctl formula formula --ctl=/tmp/587/ctl_11_
ctl formula name Murphy-COL-D2N050-CTLFireability-15
ctl formula formula --ctl=/tmp/587/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 18 places, 21 transitions and 81 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 21->9 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 18; there are 9 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 37587 group checks and 0 next state calls
pnml2lts-sym: reachability took 1125.410 real 4209.610 user 281.400 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.050 real 0.180 user 0.010 sys
pnml2lts-sym: state space has 41538421296 states, 199733 nodes
pnml2lts-sym: Formula /tmp/587/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/587/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/587/ctl_0_ holds for the initial state
double free or corruption (fasttop)

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="Murphy-COL-D2N050"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Murphy-COL-D2N050, 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 r521-tall-167987246500290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N050.tgz
mv Murphy-COL-D2N050 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 ;