About the Execution of Marcie+red for Murphy-PT-D2N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14526.004 | 165493.00 | 180241.00 | 676.80 | FTFFFTFTFFTFFFFT | 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-167987247200346.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-PT-D2N100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 12K 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-PT-D2N100-CTLFireability-00
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-01
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-02
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-03
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-04
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-05
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-06
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-07
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-08
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-09
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-10
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-11
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-12
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-13
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-14
FORMULA_NAME Murphy-PT-D2N100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680892871925
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-PT-D2N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:41:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:41:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:41:13] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-04-07 18:41:13] [INFO ] Transformed 18 places.
[2023-04-07 18:41:13] [INFO ] Transformed 21 transitions.
[2023-04-07 18:41:13] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D2N100-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 10 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 18:41:13] [INFO ] Computed 4 invariants in 9 ms
[2023-04-07 18:41:13] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-04-07 18:41:13] [INFO ] Invariant cache hit.
[2023-04-07 18:41:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 18:41:13] [INFO ] Invariant cache hit.
[2023-04-07 18:41:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-07 18:41:13] [INFO ] Invariant cache hit.
[2023-04-07 18:41:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 18:41:14] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:41:14] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:41:14] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10092 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 43) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:41:14] [INFO ] Invariant cache hit.
[2023-04-07 18:41:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:14] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:41:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:14] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:14] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:14] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:14] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 18:41:14] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 8 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 18:41:14] [INFO ] Invariant cache hit.
[2023-04-07 18:41:14] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10019 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 289303 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289303 steps, saw 189334 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 18:41:17] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:18] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:41:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:41:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 18:41:18] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:18] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:18] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 18:41:18] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 8 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 1 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 1 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 18:41:18] [INFO ] Invariant cache hit.
[2023-04-07 18:41:18] [INFO ] Implicit Places using invariants in 32 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36 ms. Remains : 15/18 places, 21/21 transitions.
Incomplete random walk after 10084 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=315 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 311900 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311900 steps, saw 201212 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 21 rows 15 cols
[2023-04-07 18:41:21] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 18:41:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:21] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:41:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:21] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:21] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:21] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 18:41:21] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-07 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-07 18:41:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-04-07 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:21] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:41:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:41:21] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 18:41:21] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:21] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 18:41:21] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:41:21] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL 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.
// Phase 1: matrix 21 rows 18 cols
[2023-04-07 18:41:21] [INFO ] Computed 4 invariants in 1 ms
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:21] [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 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:41:21] [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 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [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 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [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 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-07 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:21] [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 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:21] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:21] [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 18:41:21] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [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 : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 8 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [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 18:41:22] [INFO ] Invariant cache hit.
[2023-04-07 18:41:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 18/18 places, 21/21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [INFO ] Input system was already deterministic with 21 transitions.
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:41:22] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-07 18:41:22] [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 8891 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: 18 NrTr: 21 NrArc: 81)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.711sec
RS generation: 0m20.331sec
-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)
starting MCC model checker
--------------------------
checking: EX [[2<=p10 & 1<=p13]]
normalized: EX [[2<=p10 & 1<=p13]]
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
.-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [EX [3<=p15] & EX [[2<=p9 & 1<=p12]]]
normalized: [EX [[2<=p9 & 1<=p12]] & EX [3<=p15]]
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
.-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.719sec
checking: AG [[1<=p14 | EG [E [EF [[3<=p0 & [1<=p6 & 1<=p12]]] U EG [[3<=p1 & [1<=p7 & 1<=p13]]]]]]]
normalized: ~ [E [true U ~ [[1<=p14 | EG [E [E [true U [3<=p0 & [1<=p6 & 1<=p12]]] U EG [[3<=p1 & [1<=p7 & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
EG iterations: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
-> the formula is TRUE
FORMULA Murphy-PT-D2N100-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.369sec
checking: AG [AX [[~ [A [~ [[2<=p9 & 1<=p12]] U [[1<=p0 & 1<=p3] & [2<=p10 & 1<=p13]]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]
normalized: ~ [E [true U EX [~ [[[1<=p2 & [1<=p5 & 1<=p8]] | ~ [[~ [EG [~ [[[2<=p10 & 1<=p13] & [1<=p0 & 1<=p3]]]]] & ~ [E [~ [[[2<=p10 & 1<=p13] & [1<=p0 & 1<=p3]]] U [[2<=p9 & 1<=p12] & ~ [[[2<=p10 & 1<=p13] & [1<=p0 & 1<=p3]]]]]]]]]]]]]
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
EG iterations: 0
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
.-> the formula is TRUE
FORMULA Murphy-PT-D2N100-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.343sec
checking: [A [[1<=p2 & 1<=p5] U 1<=p13] | [A [E [AG [p14<=0] U EF [p12<=0]] U AG [1<=p13]] & [EF [[1<=p2 & 1<=p5]] & AX [EX [1<=p11]]]]]
normalized: [[[~ [EX [~ [EX [1<=p11]]]] & E [true U [1<=p2 & 1<=p5]]] & [~ [EG [E [true U ~ [1<=p13]]]] & ~ [E [E [true U ~ [1<=p13]] U [~ [E [~ [E [true U ~ [p14<=0]]] U E [true U p12<=0]]] & E [true U ~ [1<=p13]]]]]]] | [~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [[1<=p2 & 1<=p5]] & ~ [1<=p13]]]]]]
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
.
EG iterations: 1
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (p12<=0)
states: 402,348,061,872 (11)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
EG iterations: 0
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p11)
states: 603,522,092,808 (11)
..-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.423sec
checking: EF [[~ [E [AX [1<=p13] U AF [[1<=p1 & [1<=p4 & 1<=p7]]]]] & AX [[[p0<=0 | p3<=0] | [p6<=0 | [p0<=0 | p3<=0]]]]]]
normalized: E [true U [~ [EX [~ [[[p6<=0 | [p0<=0 | p3<=0]] | [p0<=0 | p3<=0]]]]] & ~ [E [~ [EX [~ [1<=p13]]] U ~ [EG [~ [[1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 804,696,123,744 (11)
.abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
.-> the formula is TRUE
FORMULA Murphy-PT-D2N100-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.692sec
checking: [EX [AX [[1<=p12 & [2<=p11 & 1<=p14]]]] & EF [[[p14<=0 | [p0<=0 | p3<=0]] | [p6<=0 | [AG [p9<=0] | EG [p13<=0]]]]]]
normalized: [E [true U [[p6<=0 | [~ [E [true U ~ [p9<=0]]] | EG [p13<=0]]] | [p14<=0 | [p0<=0 | p3<=0]]]] & EX [~ [EX [~ [[1<=p12 & [2<=p11 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p12)
states: 804,696,123,744 (11)
..abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
.
EG iterations: 1
abstracting: (p9<=0)
states: 603,522,092,808 (11)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.851sec
checking: [E [EF [~ [[[[1<=p11 & 3<=p0] & [1<=p6 & 1<=p12]] | [2<=p11 & 1<=p14]]]] U A [EF [~ [EG [[1<=p1 & 1<=p4]]]] U EX [[2<=p11 & 1<=p14]]]] & AG [EF [1<=p9]]]
normalized: [~ [E [true U ~ [E [true U 1<=p9]]]] & E [E [true U ~ [[[2<=p11 & 1<=p14] | [[1<=p6 & 1<=p12] & [1<=p11 & 3<=p0]]]]] U [~ [EG [~ [EX [[2<=p11 & 1<=p14]]]]] & ~ [E [~ [EX [[2<=p11 & 1<=p14]]] U [~ [E [true U ~ [EG [[1<=p1 & 1<=p4]]]]] & ~ [EX [[2<=p11 & 1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
.abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
.abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
.
EG iterations: 0
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p11)
states: 603,522,092,808 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p9)
states: 603,522,092,808 (11)
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.797sec
checking: AX [AG [[AX [[[p11<=1 | p14<=0] & [p0<=2 | [p6<=0 | p12<=0]]]] | [EF [[p11<=1 | p14<=0]] | [p9<=0 & [[p0<=0 | [p3<=0 | p6<=0]] & [p16<=2 | p17<=2]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[p9<=0 & [[p16<=2 | p17<=2] & [p0<=0 | [p3<=0 | p6<=0]]]] | E [true U [p11<=1 | p14<=0]]] | ~ [EX [~ [[[p0<=2 | [p6<=0 | p12<=0]] & [p11<=1 | p14<=0]]]]]]]]]]
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p11<=1)
states: 1,207,044,185,616 (12)
abstracting: (p12<=0)
states: 402,348,061,872 (11)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
abstracting: (p0<=2)
states: 57,889,909,008 (10)
.abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p11<=1)
states: 1,207,044,185,616 (12)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p17<=2)
states: 1,005,870,154,680 (12)
abstracting: (p16<=2)
states: 1,005,870,154,680 (12)
abstracting: (p9<=0)
states: 603,522,092,808 (11)
.-> the formula is TRUE
FORMULA Murphy-PT-D2N100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.784sec
checking: AX [[~ [E [EF [[[2<=p10 & 1<=p13] | [3<=p2 & [1<=p8 & 1<=p14]]]] U [1<=p0 & [1<=p3 & 1<=p6]]]] | [EX [EF [p13<=0]] & AG [[AX [[p2<=2 | [p8<=0 | p14<=0]]] | EG [[p1<=2 | [p7<=0 | p13<=0]]]]]]]]
normalized: ~ [EX [~ [[[~ [E [true U ~ [[EG [[p1<=2 | [p7<=0 | p13<=0]]] | ~ [EX [~ [[p2<=2 | [p8<=0 | p14<=0]]]]]]]]] & EX [E [true U p13<=0]]] | ~ [E [E [true U [[3<=p2 & [1<=p8 & 1<=p14]] | [2<=p10 & 1<=p13]]] U [1<=p0 & [1<=p3 & 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (p13<=0)
states: 402,348,061,872 (11)
.abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p8<=0)
states: 19,460,988,936 (10)
abstracting: (p2<=2)
states: 57,889,909,008 (10)
.abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p7<=0)
states: 19,460,988,936 (10)
abstracting: (p1<=2)
states: 57,889,909,008 (10)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.583sec
checking: AF [[E [[[1<=p2 & [1<=p5 & 1<=p8]] | ~ [[A [1<=p9 U 1<=p10] & ~ [[2<=p10 & 1<=p13]]]]] U ~ [EF [p10<=0]]] | [[EF [[3<=p0 & [1<=p6 & 1<=p12]]] & [3<=p1 & 1<=p7]] & [1<=p13 & [[p9<=1 | p12<=0] & [AF [p16<=2] | [p0<=0 | p3<=0]]]]]]]
normalized: ~ [EG [~ [[[[[3<=p1 & 1<=p7] & E [true U [3<=p0 & [1<=p6 & 1<=p12]]]] & [1<=p13 & [[~ [EG [~ [p16<=2]]] | [p0<=0 | p3<=0]] & [p9<=1 | p12<=0]]]] | E [[~ [[~ [[2<=p10 & 1<=p13]] & [~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p9] & ~ [1<=p10]]]]]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U ~ [E [true U p10<=0]]]]]]]
abstracting: (p10<=0)
states: 603,522,092,808 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
abstracting: (1<=p9)
states: 603,522,092,808 (11)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
.
EG iterations: 1
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (p12<=0)
states: 402,348,061,872 (11)
abstracting: (p9<=1)
states: 1,207,044,185,616 (12)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
abstracting: (p16<=2)
states: 1,005,870,154,680 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.449sec
checking: EX [[E [~ [[AF [1<=p13] & ~ [[1<=p0 & [1<=p3 & 1<=p6]]]]] U [EF [[[3<=p2 & [1<=p8 & 1<=p14]] | 1<=p9]] & EX [[[1<=p2 & [1<=p5 & 1<=p8]] & [3<=p1 & [1<=p7 & 1<=p13]]]]]] & [EX [p14<=0] | ~ [A [EF [[2<=p10 & 1<=p13]] U ~ [EG [[1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]
normalized: EX [[[~ [[~ [EG [EG [[1<=p1 & [1<=p4 & 1<=p7]]]]] & ~ [E [EG [[1<=p1 & [1<=p4 & 1<=p7]]] U [~ [E [true U [2<=p10 & 1<=p13]]] & EG [[1<=p1 & [1<=p4 & 1<=p7]]]]]]]] | EX [p14<=0]] & E [~ [[~ [[1<=p0 & [1<=p3 & 1<=p6]]] & ~ [EG [~ [1<=p13]]]]] U [EX [[[3<=p1 & [1<=p7 & 1<=p13]] & [1<=p2 & [1<=p5 & 1<=p8]]]] & E [true U [1<=p9 | [3<=p2 & [1<=p8 & 1<=p14]]]]]]]]
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p9)
states: 603,522,092,808 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
.abstracting: (1<=p13)
states: 804,696,123,744 (11)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
.abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Murphy-PT-D2N100-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.132sec
checking: EF [[[1<=p7 & 3<=p1] & [1<=p13 & [~ [E [~ [[[2<=p9 & 1<=p12] | [2<=p10 & 1<=p13]]] U [E [[1<=p1 & [1<=p4 & 1<=p7]] U 3<=p16] | [1<=p0 & 1<=p3]]]] & E [[[3<=p0 & [1<=p6 & 1<=p12]] | [1<=p1 & 1<=p4]] U EG [[1<=p2 & [1<=p5 & 1<=p8]]]]]]]]
normalized: E [true U [[1<=p13 & [E [[[1<=p1 & 1<=p4] | [3<=p0 & [1<=p6 & 1<=p12]]] U EG [[1<=p2 & [1<=p5 & 1<=p8]]]] & ~ [E [~ [[[2<=p10 & 1<=p13] | [2<=p9 & 1<=p12]]] U [[1<=p0 & 1<=p3] | E [[1<=p1 & [1<=p4 & 1<=p7]] U 3<=p16]]]]]] & [1<=p7 & 3<=p1]]]
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.076sec
checking: [EG [EF [[AX [[1<=p10 | 1<=p9]] & [[E [[2<=p10 & 1<=p13] U [3<=p2 & [1<=p8 & 1<=p14]]] | [1<=p1 & [1<=p4 & 1<=p7]]] | [[3<=p0 & [1<=p6 & 1<=p12]] | [3<=p1 & [1<=p7 & 1<=p13]]]]]]] & AF [[E [[1<=p1 & 1<=p4] U [2<=p11 & 1<=p14]] & [~ [A [AF [[3<=p2 & [1<=p8 & 1<=p14]]] U E [[2<=p10 & 1<=p13] U 1<=p14]]] & [p11<=1 | p14<=0]]]]]
normalized: [~ [EG [~ [[[~ [[~ [EG [~ [E [[2<=p10 & 1<=p13] U 1<=p14]]]] & ~ [E [~ [E [[2<=p10 & 1<=p13] U 1<=p14]] U [~ [E [[2<=p10 & 1<=p13] U 1<=p14]] & EG [~ [[3<=p2 & [1<=p8 & 1<=p14]]]]]]]]] & [p11<=1 | p14<=0]] & E [[1<=p1 & 1<=p4] U [2<=p11 & 1<=p14]]]]]] & EG [E [true U [[[[3<=p1 & [1<=p7 & 1<=p13]] | [3<=p0 & [1<=p6 & 1<=p12]]] | [[1<=p1 & [1<=p4 & 1<=p7]] | E [[2<=p10 & 1<=p13] U [3<=p2 & [1<=p8 & 1<=p14]]]]] & ~ [EX [~ [[1<=p10 | 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 603,522,092,808 (11)
abstracting: (1<=p10)
states: 603,522,092,808 (11)
.abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (3<=p1)
states: 1,149,154,276,608 (12)
EG iterations: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (2<=p11)
states: 0
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (p14<=0)
states: 402,348,061,872 (11)
abstracting: (p11<=1)
states: 1,207,044,185,616 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.868sec
checking: [AG [[[[[EX [[1<=p2 & [1<=p5 & 1<=p8]]] & [AF [[3<=p2 & [1<=p8 & 1<=p14]]] & 1<=p9]] | E [[[1<=p2 & 1<=p5] | [1<=p1 & [1<=p4 & 1<=p7]]] U ~ [[1<=p2 & 1<=p5]]]] & [EX [p10<=0] & [[[p1<=2 | [p7<=0 | p13<=0]] & [p0<=2 | [p6<=0 | p12<=0]]] | AX [[p0<=0 | [p3<=0 | p6<=0]]]]]] | [3<=p0 & [1<=p6 & 1<=p12]]]] | A [[~ [[[EF [3<=p15] & A [[1<=p0 & 1<=p3] U [2<=p10 & 1<=p13]]] | AF [[1<=p0 & 1<=p3]]]] & E [[[EF [[1<=p0 & [1<=p3 & 1<=p6]]] | E [[1<=p2 & [1<=p5 & 1<=p8]] U 3<=p15]] | [1<=p12 | [1<=p1 & 1<=p4]]] U [[[[[1<=p1 & 1<=p4] & [1<=p7 & [1<=p0 & 1<=p3]]] | [1<=p14 | [3<=p0 & [1<=p6 & 1<=p12]]]] & 3<=p15] & [1<=p0 & [1<=p3 & 1<=p14]]]]] U [~ [A [p11<=0 U A [[2<=p9 & 1<=p12] U 3<=p15]]] & [E [[[[[3<=p2 & [1<=p8 & 1<=p14]] | [1<=p1 & [1<=p4 & 1<=p7]]] & [1<=p2 & 1<=p5]] & [1<=p8 & [1<=p2 & 1<=p5]]] U [1<=p0 & 1<=p3]] & [EX [[[1<=p0 & [1<=p3 & 1<=p6]] | 3<=p16]] | [[1<=p0 & 1<=p3] | ~ [[3<=p16 | AG [[3<=p2 & [1<=p8 & 1<=p14]]]]]]]]]]]
normalized: [[~ [EG [~ [[[[[~ [[3<=p16 | ~ [E [true U ~ [[3<=p2 & [1<=p8 & 1<=p14]]]]]]] | [1<=p0 & 1<=p3]] | EX [[3<=p16 | [1<=p0 & [1<=p3 & 1<=p6]]]]] & E [[[1<=p8 & [1<=p2 & 1<=p5]] & [[1<=p2 & 1<=p5] & [[1<=p1 & [1<=p4 & 1<=p7]] | [3<=p2 & [1<=p8 & 1<=p14]]]]] U [1<=p0 & 1<=p3]]] & ~ [[~ [EG [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]] & ~ [E [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]] U [~ [p11<=0] & ~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]]]]]]]]] & ~ [E [~ [[[[[~ [[3<=p16 | ~ [E [true U ~ [[3<=p2 & [1<=p8 & 1<=p14]]]]]]] | [1<=p0 & 1<=p3]] | EX [[3<=p16 | [1<=p0 & [1<=p3 & 1<=p6]]]]] & E [[[1<=p8 & [1<=p2 & 1<=p5]] & [[1<=p2 & 1<=p5] & [[1<=p1 & [1<=p4 & 1<=p7]] | [3<=p2 & [1<=p8 & 1<=p14]]]]] U [1<=p0 & 1<=p3]]] & ~ [[~ [EG [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]] & ~ [E [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]] U [~ [p11<=0] & ~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]]]]]]] U [~ [[E [[[1<=p12 | [1<=p1 & 1<=p4]] | [E [[1<=p2 & [1<=p5 & 1<=p8]] U 3<=p15] | E [true U [1<=p0 & [1<=p3 & 1<=p6]]]]] U [[1<=p0 & [1<=p3 & 1<=p14]] & [3<=p15 & [[1<=p14 | [3<=p0 & [1<=p6 & 1<=p12]]] | [[1<=p7 & [1<=p0 & 1<=p3]] & [1<=p1 & 1<=p4]]]]]] & ~ [[~ [EG [~ [[1<=p0 & 1<=p3]]]] | [[~ [EG [~ [[2<=p10 & 1<=p13]]]] & ~ [E [~ [[2<=p10 & 1<=p13]] U [~ [[1<=p0 & 1<=p3]] & ~ [[2<=p10 & 1<=p13]]]]]] & E [true U 3<=p15]]]]]] & ~ [[[[[~ [[3<=p16 | ~ [E [true U ~ [[3<=p2 & [1<=p8 & 1<=p14]]]]]]] | [1<=p0 & 1<=p3]] | EX [[3<=p16 | [1<=p0 & [1<=p3 & 1<=p6]]]]] & E [[[1<=p8 & [1<=p2 & 1<=p5]] & [[1<=p2 & 1<=p5] & [[1<=p1 & [1<=p4 & 1<=p7]] | [3<=p2 & [1<=p8 & 1<=p14]]]]] U [1<=p0 & 1<=p3]]] & ~ [[~ [EG [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]] & ~ [E [~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]] U [~ [p11<=0] & ~ [[~ [EG [~ [3<=p15]]] & ~ [E [~ [3<=p15] U [~ [[2<=p9 & 1<=p12]] & ~ [3<=p15]]]]]]]]]]]]]]]]] | ~ [E [true U ~ [[[3<=p0 & [1<=p6 & 1<=p12]] | [[[~ [EX [~ [[p0<=0 | [p3<=0 | p6<=0]]]]] | [[p0<=2 | [p6<=0 | p12<=0]] & [p1<=2 | [p7<=0 | p13<=0]]]] & EX [p10<=0]] & [E [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p2 & 1<=p5]] U ~ [[1<=p2 & 1<=p5]]] | [[1<=p9 & ~ [EG [~ [[3<=p2 & [1<=p8 & 1<=p14]]]]]] & EX [[1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]]
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
.abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
.
EG iterations: 1
abstracting: (1<=p9)
states: 603,522,092,808 (11)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (p10<=0)
states: 603,522,092,808 (11)
.abstracting: (p13<=0)
states: 402,348,061,872 (11)
abstracting: (p7<=0)
states: 19,460,988,936 (10)
abstracting: (p1<=2)
states: 57,889,909,008 (10)
abstracting: (p12<=0)
states: 402,348,061,872 (11)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
abstracting: (p0<=2)
states: 57,889,909,008 (10)
abstracting: (p6<=0)
states: 19,460,988,936 (10)
abstracting: (p3<=0)
states: 19,468,488,888 (10)
abstracting: (p0<=0)
states: 19,460,988,936 (10)
.abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (p11<=0)
states: 603,522,092,808 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
.abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p13)
states: 804,696,123,744 (11)
abstracting: (2<=p10)
states: 0
EG iterations: 0
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
.
EG iterations: 1
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (3<=p0)
states: 1,149,154,276,608 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (p11<=0)
states: 603,522,092,808 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
.abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (p11<=0)
states: 603,522,092,808 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (1<=p12)
states: 804,696,123,744 (11)
abstracting: (2<=p9)
states: 0
abstracting: (3<=p15)
states: 201,174,030,936 (11)
abstracting: (3<=p15)
states: 201,174,030,936 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (1<=p7)
states: 1,187,583,196,680 (12)
abstracting: (1<=p4)
states: 1,187,575,696,728 (12)
abstracting: (1<=p1)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p5)
states: 1,187,575,696,728 (12)
abstracting: (1<=p2)
states: 1,187,583,196,680 (12)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (1<=p6)
states: 1,187,583,196,680 (12)
abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
.abstracting: (1<=p3)
states: 1,187,575,696,728 (12)
abstracting: (1<=p0)
states: 1,187,583,196,680 (12)
abstracting: (1<=p14)
states: 804,696,123,744 (11)
abstracting: (1<=p8)
states: 1,187,583,196,680 (12)
abstracting: (3<=p2)
states: 1,149,154,276,608 (12)
abstracting: (3<=p16)
states: 201,174,030,936 (11)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-PT-D2N100-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m57.867sec
totally nodes used: 18263689 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 626806618 43356502 670163120
used/not used/entry size/cache size: 38918935 28189929 16 1024MB
basic ops cache: hits/miss/sum: 190592952 23718698 214311650
used/not used/entry size/cache size: 13445723 3331493 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: 2337613 368238 2705851
used/not used/entry size/cache size: 359004 8029604 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 53254040
1 10482558
2 2846676
3 421329
4 82361
5 12530
6 3371
7 955
8 669
9 313
>= 10 4062
Total processing time: 2m34.150sec
BK_STOP 1680893037418
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:14959 (712), effective:3586 (170)
initing FirstDep: 0m 0.000sec
iterations count:70 (3), effective:12 (0)
iterations count:203 (9), effective:40 (1)
iterations count:1071 (51), effective:150 (7)
iterations count:29 (1), effective:2 (0)
iterations count:29 (1), effective:2 (0)
iterations count:28 (1), effective:2 (0)
iterations count:21 (1), effective:0 (0)
iterations count:29 (1), effective:2 (0)
iterations count:29 (1), effective:2 (0)
iterations count:72 (3), effective:11 (0)
iterations count:68 (3), effective:9 (0)
iterations count:1982 (94), effective:602 (28)
iterations count:32 (1), effective:3 (0)
iterations count:320 (15), effective:299 (14)
iterations count:621 (29), effective:150 (7)
iterations count:619 (29), effective:299 (14)
iterations count:32 (1), effective:3 (0)
iterations count:21 (1), effective:0 (0)
iterations count:65 (3), effective:12 (0)
iterations count:70 (3), effective:11 (0)
iterations count:29 (1), effective:2 (0)
iterations count:217 (10), effective:45 (2)
iterations count:25 (1), effective:1 (0)
iterations count:25 (1), effective:1 (0)
iterations count:70 (3), effective:12 (0)
iterations count:32 (1), effective:3 (0)
iterations count:288 (13), effective:60 (2)
iterations count:21 (1), effective:0 (0)
iterations count:33 (1), effective:3 (0)
iterations count:53 (2), effective:8 (0)
iterations count:65 (3), effective:9 (0)
iterations count:21 (1), effective:0 (0)
iterations count:67 (3), effective:13 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:1071 (51), effective:150 (7)
iterations count:855 (40), effective:351 (16)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:32 (1), effective:3 (0)
iterations count:21 (1), effective:0 (0)
iterations count:37 (1), effective:4 (0)
iterations count:2714 (129), effective:299 (14)
iterations count:33 (1), effective:3 (0)
iterations count:320 (15), effective:299 (14)
iterations count:70 (3), effective:11 (0)
iterations count:33 (1), effective:3 (0)
iterations count:82 (3), effective:14 (0)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:32 (1), effective:3 (0)
iterations count:21 (1), effective:0 (0)
iterations count:37 (1), effective:4 (0)
iterations count:2714 (129), effective:299 (14)
iterations count:1869 (89), effective:609 (29)
iterations count:21 (1), effective:0 (0)
iterations count:21 (1), effective:0 (0)
iterations count:32 (1), effective:3 (0)
iterations count:21 (1), effective:0 (0)
iterations count:37 (1), effective:4 (0)
iterations count:2714 (129), effective:299 (14)
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-PT-D2N100"
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-PT-D2N100, 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-167987247200346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N100.tgz
mv Murphy-PT-D2N100 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 ;