About the Execution of Marcie+red for Murphy-COL-D1N010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5447.588 | 10899.00 | 18218.00 | 290.30 | FTFTFFFFTFTTTFTT | 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.r522-tall-167987247100282.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 Murphy-COL-D1N010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K 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 48K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:23 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-D1N010-CTLFireability-00
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-01
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-02
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-03
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-04
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-05
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-06
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-07
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-08
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-09
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-10
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-11
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-12
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-13
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-14
FORMULA_NAME Murphy-COL-D1N010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680887766926
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=Murphy-COL-D1N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 17:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 17:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 17:16:08] [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 17:16:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 17:16:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 532 ms
[2023-04-07 17:16:08] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 12 PT places and 14.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2023-04-07 17:16:08] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 17:16:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D1N010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 24 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-07 17:16:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 17:16:09] [INFO ] Flatten gal took : 12 ms
FORMULA Murphy-COL-D1N010-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 17:16:09] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 2)]] contains successor/predecessor on variables of sort CD
[2023-04-07 17:16:09] [INFO ] Unfolded HLPN to a Petri net with 12 places and 14 transitions 54 arcs in 5 ms.
[2023-04-07 17:16:09] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D1N010-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2023-04-07 17:16:09] [INFO ] Computed 3 invariants in 7 ms
[2023-04-07 17:16:09] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-04-07 17:16:09] [INFO ] Invariant cache hit.
[2023-04-07 17:16:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 17:16:09] [INFO ] Invariant cache hit.
[2023-04-07 17:16:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 17:16:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 17:16:09] [INFO ] Invariant cache hit.
[2023-04-07 17:16:09] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 12/12 places, 14/14 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 17:16:09] [INFO ] Flatten gal took : 5 ms
[2023-04-07 17:16:09] [INFO ] Flatten gal took : 4 ms
[2023-04-07 17:16:09] [INFO ] Input system was already deterministic with 14 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-04-07 17:16:09] [INFO ] Invariant cache hit.
[2023-04-07 17:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 17:16:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 17:16:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 17:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 17:16:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 17:16:09] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 17:16:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-07 17:16:09] [INFO ] After 10ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 17:16:09] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 17:16:09] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:09] [INFO ] Invariant cache hit.
[2023-04-07 17:16:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 12/12 places, 14/14 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 801 ms. (steps per millisecond=384 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 383 ms. (steps per millisecond=803 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 3 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:11] [INFO ] Flatten gal took : 0 ms
[2023-04-07 17:16:11] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:11] [INFO ] Invariant cache hit.
[2023-04-07 17:16:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:12] [INFO ] Invariant cache hit.
[2023-04-07 17:16:12] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-04-07 17:16:12] [INFO ] Invariant cache hit.
[2023-04-07 17:16:12] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 12/12 places, 14/14 transitions.
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Input system was already deterministic with 14 transitions.
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 1 ms
[2023-04-07 17:16:12] [INFO ] Flatten gal took : 2 ms
[2023-04-07 17:16:12] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-04-07 17:16:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 14 transitions and 54 arcs took 1 ms.
Total runtime 3867 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: 12 NrTr: 14 NrArc: 54)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.884sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 237 (2.4e+02) #states 39,780 (4)
starting MCC model checker
--------------------------
checking: EG [AX [[1<=p8 | 1<=p9]]]
normalized: EG [~ [EX [~ [[1<=p8 | 1<=p9]]]]]
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [EX [[1<=p8 | 1<=p9]]]
normalized: EG [EX [[1<=p8 | 1<=p9]]]
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-COL-D1N010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EG [[[p0<=0 | p2<=0] & [p1<=0 | p3<=0]]]]
normalized: E [true U EG [[[p1<=0 | p3<=0] & [p0<=0 | p2<=0]]]]
abstracting: (p2<=0)
states: 4,644 (3)
abstracting: (p0<=0)
states: 3,888 (3)
abstracting: (p3<=0)
states: 4,644 (3)
abstracting: (p1<=0)
states: 3,888 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-COL-D1N010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [[[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]]]
normalized: EG [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]]]
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-COL-D1N010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [EX [AX [AF [~ [[[[1<=p9 & 1<=p5] & 3<=p1] | [3<=p0 & [1<=p4 & 1<=p8]]]]]]] U [1<=p6 | 1<=p7]]
normalized: [~ [EG [~ [[1<=p6 | 1<=p7]]]] & ~ [E [~ [[1<=p6 | 1<=p7]] U [~ [EX [~ [EX [EG [[[[1<=p9 & 1<=p5] & 3<=p1] | [3<=p0 & [1<=p4 & 1<=p8]]]]]]]] & ~ [[1<=p6 | 1<=p7]]]]]]
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
.
EG iterations: 1
..abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
....
EG iterations: 4
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [EG [[[[p1<=2 | [p5<=0 | p9<=0]] & [p0<=2 | [p4<=0 | p8<=0]]] | [3<=p10 | 3<=p11]]] & AF [AG [[[p0<=0 | p2<=0] & [p1<=0 | p3<=0]]]]]
normalized: [~ [EG [E [true U ~ [[[p1<=0 | p3<=0] & [p0<=0 | p2<=0]]]]]] & EG [[[3<=p10 | 3<=p11] | [[[p4<=0 | p8<=0] | p0<=2] & [[p5<=0 | p9<=0] | p1<=2]]]]]
abstracting: (p1<=2)
states: 12,096 (4)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p5<=0)
states: 3,888 (3)
abstracting: (p0<=2)
states: 12,096 (4)
abstracting: (p8<=0)
states: 13,260 (4)
abstracting: (p4<=0)
states: 3,888 (3)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 4,644 (3)
abstracting: (p0<=0)
states: 3,888 (3)
abstracting: (p3<=0)
states: 4,644 (3)
abstracting: (p1<=0)
states: 3,888 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [A [[[~ [[3<=p10 | 3<=p11]] | [3<=p1 & [1<=p5 & 1<=p9]]] | [[3<=p0 & [1<=p4 & 1<=p8]] | [1<=p6 | 1<=p7]]] U EF [~ [[1<=p6 | 1<=p7]]]]] & [1<=p6 | 1<=p7]]]
normalized: E [true U [[1<=p6 | 1<=p7] & ~ [[~ [EG [~ [E [true U ~ [[1<=p6 | 1<=p7]]]]]] & ~ [E [~ [E [true U ~ [[1<=p6 | 1<=p7]]]] U [~ [E [true U ~ [[1<=p6 | 1<=p7]]]] & ~ [[[[1<=p6 | 1<=p7] | [[1<=p4 & 1<=p8] & 3<=p0]] | [[[1<=p5 & 1<=p9] & 3<=p1] | ~ [[3<=p10 | 3<=p11]]]]]]]]]]]]
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]] & AX [[[p8<=0 & p9<=0] | [[p1<=2 | [p5<=0 | p9<=0]] & [p0<=2 | [p4<=0 | p8<=0]]]]]]
normalized: [~ [EX [~ [[[p8<=0 & p9<=0] | [[[p4<=0 | p8<=0] | p0<=2] & [[p5<=0 | p9<=0] | p1<=2]]]]]] & EX [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.abstracting: (p1<=2)
states: 12,096 (4)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p5<=0)
states: 3,888 (3)
abstracting: (p0<=2)
states: 12,096 (4)
abstracting: (p8<=0)
states: 13,260 (4)
abstracting: (p4<=0)
states: 3,888 (3)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p8<=0)
states: 13,260 (4)
.-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [1<=0] & [EG [EX [[[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]] & [AX [[[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]]] | EX [[1<=p6 | 1<=p7]]]]]] | AX [EF [~ [E [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]] U [3<=p10 | 3<=p11]]]]]]]
normalized: [[~ [EX [~ [E [true U ~ [E [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]] U [3<=p10 | 3<=p11]]]]]]] | EG [EX [[[EX [[1<=p6 | 1<=p7]] | ~ [EX [~ [[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]]]]]] & [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]] & ~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
.abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
...
EG iterations: 1
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: [A [AF [EX [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]]] U [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]] & AF [~ [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]]]]] & AG [A [[[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]] U [1<=p8 | 1<=p9]]]]
normalized: [[~ [EG [~ [[~ [EG [[[[1<=p5 & 1<=p9] & 3<=p1] | [[1<=p4 & 1<=p8] & 3<=p0]]]] & [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]] & ~ [E [~ [[~ [EG [[[[1<=p5 & 1<=p9] & 3<=p1] | [[1<=p4 & 1<=p8] & 3<=p0]]]] & [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] U [~ [[~ [EG [[[[1<=p5 & 1<=p9] & 3<=p1] | [[1<=p4 & 1<=p8] & 3<=p0]]]] & [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] & EG [~ [EX [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]]]]] & ~ [E [true U ~ [[~ [EG [~ [[1<=p8 | 1<=p9]]]] & ~ [E [~ [[1<=p8 | 1<=p9]] U [~ [[[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]]] & ~ [[1<=p8 | 1<=p9]]]]]]]]]]
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
....
EG iterations: 4
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
...
EG iterations: 2
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
.
EG iterations: 1
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
.
EG iterations: 1
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EX [[[[EF [[1<=p6 | 1<=p7]] | EG [[3<=p10 | 3<=p11]]] & [[AG [[EX [[1<=p6 | 1<=p7]] | EX [[3<=p10 | 3<=p11]]]] | ~ [E [[[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]] U [[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]]]] | [[p10<=2 & p11<=2] | [[p1<=2 | [p5<=0 | p9<=0]] & [p0<=2 | [p4<=0 | p8<=0]]]]]] & [[1<=p6 | 1<=p7] & [[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]]]]]
normalized: EX [[[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] & [1<=p6 | 1<=p7]] & [[[[[[p4<=0 | p8<=0] | p0<=2] & [[p5<=0 | p9<=0] | p1<=2]] | [p10<=2 & p11<=2]] | [~ [E [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]] U [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] | ~ [E [true U ~ [[EX [[3<=p10 | 3<=p11]] | EX [[1<=p6 | 1<=p7]]]]]]]] & [EG [[3<=p10 | 3<=p11]] | E [true U [1<=p6 | 1<=p7]]]]]]
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
.abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
.abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (p11<=2)
states: 33,150 (4)
abstracting: (p10<=2)
states: 33,150 (4)
abstracting: (p1<=2)
states: 12,096 (4)
abstracting: (p9<=0)
states: 13,260 (4)
abstracting: (p5<=0)
states: 3,888 (3)
abstracting: (p0<=2)
states: 12,096 (4)
abstracting: (p8<=0)
states: 13,260 (4)
abstracting: (p4<=0)
states: 3,888 (3)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
.-> the formula is TRUE
FORMULA Murphy-COL-D1N010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[[[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]] & [EX [[[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]]] | A [[~ [[[[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]] & [1<=p8 | 1<=p9]]] & [[[1<=p8 | 1<=p9] | [[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]]] | [[1<=p6 | 1<=p7] | [[2<=p6 & 1<=p8] | [2<=p7 & 1<=p9]]]]] U A [[[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]] | [1<=p8 | 1<=p9]] U [[3<=p10 | 3<=p11] | [[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]]]]]]]]
normalized: ~ [EX [~ [[[[~ [EG [~ [[~ [EG [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]] & ~ [E [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]] U [~ [[[1<=p8 | 1<=p9] | [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] & ~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]] & ~ [E [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]] U [~ [[[1<=p8 | 1<=p9] | [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] & ~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]]]]] U [~ [[~ [EG [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]] & ~ [E [~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]] U [~ [[[1<=p8 | 1<=p9] | [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]] & ~ [[[[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]] | [3<=p10 | 3<=p11]]]]]]]] & ~ [[[[[[2<=p7 & 1<=p9] | [2<=p6 & 1<=p8]] | [1<=p6 | 1<=p7]] | [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]] | [1<=p8 | 1<=p9]]] & ~ [[[1<=p8 | 1<=p9] & [[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]]]]]]]]]] | EX [[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]]]] & [[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]]]]]]
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
.abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
......
EG iterations: 6
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
......
EG iterations: 6
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
......
EG iterations: 6
......
EG iterations: 6
.-> the formula is TRUE
FORMULA Murphy-COL-D1N010-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [A [[~ [[[[1<=p0 & [1<=p2 & 1<=p4]] | [1<=p1 & [1<=p3 & 1<=p5]]] | [[2<=p6 & 1<=p8] | [2<=p7 & 1<=p9]]]] & [3<=p10 | 3<=p11]] U [1<=p6 | 1<=p7]] U [[~ [[AG [[3<=p10 | 3<=p11]] & [~ [[[[2<=p6 & 1<=p8] | [2<=p7 & 1<=p9]] | [1<=p8 | 1<=p9]]] & EG [[1<=p8 | 1<=p9]]]]] & EF [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]]] & [EX [~ [[1<=p6 | 1<=p7]]] & [[AX [AX [[1<=p8 | 1<=p9]]] | [AX [[[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]] & [[3<=p1 & [1<=p5 & 1<=p9]] | [3<=p0 & [1<=p4 & 1<=p8]]]]] & [[1<=p6 | 1<=p7] | [[1<=p0 & 1<=p2] | [1<=p1 & 1<=p3]]]]]]]
normalized: [~ [EG [~ [[[EX [~ [[1<=p6 | 1<=p7]]] & [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]] | [1<=p6 | 1<=p7]] & [[[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]] & ~ [EX [~ [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]] | ~ [EX [EX [~ [[1<=p8 | 1<=p9]]]]]]]] & [E [true U [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]] & ~ [[[EG [[1<=p8 | 1<=p9]] & ~ [[[1<=p8 | 1<=p9] | [[2<=p7 & 1<=p9] | [2<=p6 & 1<=p8]]]]] & ~ [E [true U ~ [[3<=p10 | 3<=p11]]]]]]]]]]] & ~ [E [~ [[[EX [~ [[1<=p6 | 1<=p7]]] & [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]] | [1<=p6 | 1<=p7]] & [[[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]] & ~ [EX [~ [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]] | ~ [EX [EX [~ [[1<=p8 | 1<=p9]]]]]]]] & [E [true U [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]] & ~ [[[EG [[1<=p8 | 1<=p9]] & ~ [[[1<=p8 | 1<=p9] | [[2<=p7 & 1<=p9] | [2<=p6 & 1<=p8]]]]] & ~ [E [true U ~ [[3<=p10 | 3<=p11]]]]]]]]] U [~ [[[EX [~ [[1<=p6 | 1<=p7]]] & [[[[1<=p1 & 1<=p3] | [1<=p0 & 1<=p2]] | [1<=p6 | 1<=p7]] & [[[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]] & ~ [EX [~ [[[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]]]]] | ~ [EX [EX [~ [[1<=p8 | 1<=p9]]]]]]]] & [E [true U [[[1<=p4 & 1<=p8] & 3<=p0] | [[1<=p5 & 1<=p9] & 3<=p1]]] & ~ [[[EG [[1<=p8 | 1<=p9]] & ~ [[[1<=p8 | 1<=p9] | [[2<=p7 & 1<=p9] | [2<=p6 & 1<=p8]]]]] & ~ [E [true U ~ [[3<=p10 | 3<=p11]]]]]]]]] & ~ [[~ [EG [~ [[1<=p6 | 1<=p7]]]] & ~ [E [~ [[1<=p6 | 1<=p7]] U [~ [[[3<=p10 | 3<=p11] & ~ [[[[2<=p7 & 1<=p9] | [2<=p6 & 1<=p8]] | [[[1<=p3 & 1<=p5] & 1<=p1] | [[1<=p2 & 1<=p4] & 1<=p0]]]]]] & ~ [[1<=p6 | 1<=p7]]]]]]]]]]]
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
....
EG iterations: 4
abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
.
EG iterations: 1
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
..abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
.abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
.
EG iterations: 1
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
..abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
.abstracting: (3<=p11)
states: 6,630 (3)
abstracting: (3<=p10)
states: 6,630 (3)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (2<=p6)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (2<=p7)
states: 0
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
.
EG iterations: 1
abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p8)
states: 26,520 (4)
..abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
.abstracting: (3<=p1)
states: 27,684 (4)
abstracting: (1<=p9)
states: 26,520 (4)
abstracting: (1<=p5)
states: 35,892 (4)
abstracting: (3<=p0)
states: 27,684 (4)
abstracting: (1<=p8)
states: 26,520 (4)
abstracting: (1<=p4)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
abstracting: (1<=p2)
states: 35,136 (4)
abstracting: (1<=p0)
states: 35,892 (4)
abstracting: (1<=p3)
states: 35,136 (4)
abstracting: (1<=p1)
states: 35,892 (4)
abstracting: (1<=p7)
states: 19,890 (4)
abstracting: (1<=p6)
states: 19,890 (4)
...
EG iterations: 2
-> the formula is FALSE
FORMULA Murphy-COL-D1N010-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
totally nodes used: 19904 (2.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 69400 41515 110915
used/not used/entry size/cache size: 56762 67052102 16 1024MB
basic ops cache: hits/miss/sum: 31803 23359 55162
used/not used/entry size/cache size: 43403 16733813 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2151 856 3007
used/not used/entry size/cache size: 856 8387752 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67090696
1 17241
2 596
3 198
4 87
5 9
6 10
7 3
8 7
9 3
>= 10 14
Total processing time: 0m 4.634sec
BK_STOP 1680887777825
--------------------
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.006sec
iterations count:277 (19), effective:98 (7)
initing FirstDep: 0m 0.000sec
iterations count:63 (4), effective:29 (2)
iterations count:20 (1), effective:4 (0)
iterations count:42 (3), effective:6 (0)
iterations count:22 (1), effective:2 (0)
iterations count:22 (1), effective:2 (0)
iterations count:22 (1), effective:2 (0)
iterations count:26 (1), effective:3 (0)
iterations count:314 (22), effective:71 (5)
iterations count:63 (4), effective:29 (2)
iterations count:30 (2), effective:4 (0)
iterations count:521 (37), effective:126 (9)
iterations count:25 (1), effective:3 (0)
iterations count:44 (3), effective:8 (0)
iterations count:43 (3), effective:13 (0)
iterations count:30 (2), effective:4 (0)
iterations count:30 (2), effective:4 (0)
iterations count:30 (2), effective:4 (0)
iterations count:28 (2), effective:2 (0)
iterations count:20 (1), effective:2 (0)
iterations count:50 (3), effective:15 (1)
iterations count:20 (1), effective:2 (0)
iterations count:50 (3), effective:15 (1)
iterations count:243 (17), effective:50 (3)
iterations count:20 (1), effective:2 (0)
iterations count:50 (3), effective:15 (1)
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-D1N010"
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 Murphy-COL-D1N010, 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-167987247100282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D1N010.tgz
mv Murphy-COL-D1N010 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 '
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 ;