About the Execution of Marcie+red for Murphy-PT-D3N050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12524.871 | 102395.00 | 118176.00 | 903.70 | TFTFTTTTTTTFFTFF | 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-167987247200354.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-D3N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K 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 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K 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 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K 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 15K 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-D3N050-CTLFireability-00
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-01
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-02
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-03
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-04
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-05
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-06
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-07
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-08
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-09
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-10
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-11
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-12
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-13
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-14
FORMULA_NAME Murphy-PT-D3N050-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680893122945
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-D3N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:45:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:45:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:45:24] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-07 18:45:24] [INFO ] Transformed 24 places.
[2023-04-07 18:45:24] [INFO ] Transformed 28 transitions.
[2023-04-07 18:45:24] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-PT-D3N050-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:45:24] [INFO ] Computed 5 invariants in 5 ms
[2023-04-07 18:45:24] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2023-04-07 18:45:24] [INFO ] Invariant cache hit.
[2023-04-07 18:45:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-07 18:45:24] [INFO ] Invariant cache hit.
[2023-04-07 18:45:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-07 18:45:24] [INFO ] Invariant cache hit.
[2023-04-07 18:45:24] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 24 out of 24 places after structural reductions.
[2023-04-07 18:45:25] [INFO ] Flatten gal took : 18 ms
[2023-04-07 18:45:25] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:45:25] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 47) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-04-07 18:45:25] [INFO ] Invariant cache hit.
[2023-04-07 18:45:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:45:25] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:45:25] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:45:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:45:25] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-07 18:45:25] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:25] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:25] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 18:45:25] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:25] [INFO ] Invariant cache hit.
[2023-04-07 18:45:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 335190 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335190 steps, saw 227810 distinct states, run finished after 3003 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 18:45:29] [INFO ] Invariant cache hit.
[2023-04-07 18:45:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:45:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 18:45:29] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:45:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:45:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-07 18:45:29] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:29] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:29] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 18:45:29] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:29] [INFO ] Invariant cache hit.
[2023-04-07 18:45:29] [INFO ] Implicit Places using invariants in 39 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 47 ms. Remains : 21/24 places, 28/28 transitions.
Incomplete random walk after 10020 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 331053 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331053 steps, saw 225142 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 28 rows 21 cols
[2023-04-07 18:45:32] [INFO ] Computed 2 invariants in 2 ms
[2023-04-07 18:45:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:45:32] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:45:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:45:32] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:32] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:32] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 18:45:33] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 21/21 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:33] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-04-07 18:45:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 21/21 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:45:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 18:45:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:45:33] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 18:45:33] [INFO ] After 15ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:33] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 18:45:33] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-07 18:45:33] [INFO ] Computed 5 invariants in 1 ms
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 11 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-07 18:45:33] [INFO ] Invariant cache hit.
[2023-04-07 18:45:33] [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 : 24/24 places, 28/28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:45:33] [INFO ] Input system was already deterministic with 28 transitions.
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:45:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 18:45:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 1 ms.
Total runtime 9576 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: 24 NrTr: 28 NrArc: 108)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.775sec
RS generation: 0m14.801sec
-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)
starting MCC model checker
--------------------------
checking: AG [AF [EX [AX [p15<=0]]]]
normalized: ~ [E [true U EG [~ [EX [~ [EX [~ [p15<=0]]]]]]]]
abstracting: (p15<=0)
states: 270,355,042,165,464 (14)
...
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-PT-D3N050-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.776sec
checking: EX [EX [AX [EF [p12<=0]]]]
normalized: EX [EX [~ [EX [~ [E [true U p12<=0]]]]]]
abstracting: (p12<=0)
states: 270,355,042,165,464 (14)
...-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.322sec
checking: AF [EG [AX [AX [[p13<=1 | p17<=0]]]]]
normalized: ~ [EG [~ [EG [~ [EX [EX [~ [[p13<=1 | p17<=0]]]]]]]]]
abstracting: (p17<=0)
states: 180,236,694,776,976 (14)
abstracting: (p13<=1)
states: 540,710,084,330,928 (14)
..
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [AF [EX [AF [[p3<=2 | [p11<=0 | p19<=0]]]]]]
normalized: ~ [E [true U EG [~ [EX [~ [EG [~ [[p3<=2 | [p11<=0 | p19<=0]]]]]]]]]]
abstracting: (p19<=0)
states: 180,236,694,776,976 (14)
abstracting: (p11<=0)
states: 17,685,822,727,584 (13)
abstracting: (p3<=2)
states: 52,058,044,996,416 (13)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-PT-D3N050-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.350sec
checking: AG [EX [[EF [[p3<=0 | p7<=0]] | [[1<=p1 & [1<=p5 & 1<=p9]] | [EG [[p2<=0 | p6<=0]] & [p15<=1 | p19<=0]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[p15<=1 | p19<=0] & EG [[p2<=0 | p6<=0]]] | [1<=p1 & [1<=p5 & 1<=p9]]] | E [true U [p3<=0 | p7<=0]]]]]]]
abstracting: (p7<=0)
states: 17,686,785,187,728 (13)
abstracting: (p3<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
abstracting: (p6<=0)
states: 17,686,785,187,728 (13)
abstracting: (p2<=0)
states: 17,685,822,727,584 (13)
.
EG iterations: 1
abstracting: (p19<=0)
states: 180,236,694,776,976 (14)
abstracting: (p15<=1)
states: 540,710,084,330,928 (14)
.-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.443sec
checking: [AG [~ [A [[[1<=p19 | 3<=p23] | [[1<=p0 & 1<=p4] | AG [[1<=p0 & [1<=p4 & 1<=p8]]]]] U AG [[1<=p2 & 1<=p6]]]]] | EG [[p3<=0 | p7<=0]]]
normalized: [EG [[p3<=0 | p7<=0]] | ~ [E [true U [~ [EG [E [true U ~ [[1<=p2 & 1<=p6]]]]] & ~ [E [E [true U ~ [[1<=p2 & 1<=p6]]] U [~ [[[~ [E [true U ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]] | [1<=p0 & 1<=p4]] | [1<=p19 | 3<=p23]]] & E [true U ~ [[1<=p2 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
EG iterations: 0
abstracting: (p7<=0)
states: 17,686,785,187,728 (13)
abstracting: (p3<=0)
states: 17,685,822,727,584 (13)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.431sec
checking: AF [AG [[[1<=p17 | [EG [[p1<=0 | [p5<=0 | p9<=0]]] | p14<=0]] | [p14<=1 | [p18<=0 | [2<=p14 & [1<=p18 & A [1<=p19 U [1<=p2 & [1<=p6 & 1<=p10]]]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[p14<=1 | [p18<=0 | [2<=p14 & [1<=p18 & [~ [EG [~ [[1<=p2 & [1<=p6 & 1<=p10]]]]] & ~ [E [~ [[1<=p2 & [1<=p6 & 1<=p10]]] U [~ [1<=p19] & ~ [[1<=p2 & [1<=p6 & 1<=p10]]]]]]]]]]] | [1<=p17 | [p14<=0 | EG [[p1<=0 | [p5<=0 | p9<=0]]]]]]]]]]
abstracting: (p9<=0)
states: 17,685,822,727,584 (13)
abstracting: (p5<=0)
states: 17,686,785,187,728 (13)
abstracting: (p1<=0)
states: 17,685,822,727,584 (13)
.
EG iterations: 1
abstracting: (p14<=0)
states: 270,355,042,165,464 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
abstracting: (p18<=0)
states: 180,236,694,776,976 (14)
abstracting: (p14<=1)
states: 540,710,084,330,928 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.302sec
checking: ~ [A [[p17<=0 & E [AX [EG [1<=p15]] U AX [AG [1<=p16]]]] U EG [[[[1<=p1 & 1<=p5] | [[AG [[1<=p0 & 1<=p4]] & 3<=p3] & [1<=p11 & 1<=p19]]] | [[2<=p12 & 1<=p16] | [1<=p13 | p23<=2]]]]]]
normalized: ~ [[~ [EG [~ [EG [[[[1<=p1 & 1<=p5] | [[3<=p3 & ~ [E [true U ~ [[1<=p0 & 1<=p4]]]]] & [1<=p11 & 1<=p19]]] | [[1<=p13 | p23<=2] | [2<=p12 & 1<=p16]]]]]]] & ~ [E [~ [EG [[[[1<=p1 & 1<=p5] | [[3<=p3 & ~ [E [true U ~ [[1<=p0 & 1<=p4]]]]] & [1<=p11 & 1<=p19]]] | [[1<=p13 | p23<=2] | [2<=p12 & 1<=p16]]]]] U [~ [EG [[[[1<=p1 & 1<=p5] | [[3<=p3 & ~ [E [true U ~ [[1<=p0 & 1<=p4]]]]] & [1<=p11 & 1<=p19]]] | [[1<=p13 | p23<=2] | [2<=p12 & 1<=p16]]]]] & ~ [[p17<=0 & E [~ [EX [~ [EG [1<=p15]]]] U ~ [EX [E [true U ~ [1<=p16]]]]]]]]]]]]
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
.abstracting: (1<=p15)
states: 270,355,042,165,464 (14)
.
EG iterations: 1
.abstracting: (p17<=0)
states: 180,236,694,776,976 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (p23<=2)
states: 450,591,736,942,440 (14)
abstracting: (1<=p13)
states: 270,355,042,165,464 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (p23<=2)
states: 450,591,736,942,440 (14)
abstracting: (1<=p13)
states: 270,355,042,165,464 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (p23<=2)
states: 450,591,736,942,440 (14)
abstracting: (1<=p13)
states: 270,355,042,165,464 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA Murphy-PT-D3N050-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.502sec
checking: E [[3<=p3 & [1<=p11 & 1<=p19]] U ~ [E [[AG [1<=p18] | [EF [[2<=p15 & 1<=p19]] | EG [[1<=p0 & 1<=p4]]]] U [[~ [[~ [[1<=p3 & 1<=p7]] | E [1<=p19 U [1<=p3 & 1<=p7]]]] & AG [3<=p20]] & [[3<=p20 | 1<=p19] & A [1<=p15 U 3<=p21]]]]]]
normalized: E [[3<=p3 & [1<=p11 & 1<=p19]] U ~ [E [[[EG [[1<=p0 & 1<=p4]] | E [true U [2<=p15 & 1<=p19]]] | ~ [E [true U ~ [1<=p18]]]] U [[[~ [EG [~ [3<=p21]]] & ~ [E [~ [3<=p21] U [~ [1<=p15] & ~ [3<=p21]]]]] & [3<=p20 | 1<=p19]] & [~ [E [true U ~ [3<=p20]]] & ~ [[E [1<=p19 U [1<=p3 & 1<=p7]] | ~ [[1<=p3 & 1<=p7]]]]]]]]]
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (3<=p20)
states: 90,118,347,388,488 (13)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (3<=p20)
states: 90,118,347,388,488 (13)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (1<=p15)
states: 270,355,042,165,464 (14)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
.
EG iterations: 1
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.227sec
checking: AG [[[p2<=2 | [p10<=0 | p18<=0]] | [~ [A [[[3<=p0 & 1<=p8] & [1<=p16 & [1<=p1 & 1<=p5]]] U [1<=p0 & [1<=p4 & 1<=p8]]]] | [AX [~ [A [[1<=p3 & [1<=p7 & 1<=p11]] U [2<=p12 & 1<=p16]]]] | AF [EX [[p0<=2 | [p8<=0 | p16<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EX [[~ [EG [~ [[2<=p12 & 1<=p16]]]] & ~ [E [~ [[2<=p12 & 1<=p16]] U [~ [[2<=p12 & 1<=p16]] & ~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]]]]] | ~ [EG [~ [EX [[p0<=2 | [p8<=0 | p16<=0]]]]]]] | ~ [[~ [EG [~ [[1<=p0 & [1<=p4 & 1<=p8]]]]] & ~ [E [~ [[1<=p0 & [1<=p4 & 1<=p8]]] U [~ [[[1<=p16 & [1<=p1 & 1<=p5]] & [3<=p0 & 1<=p8]]] & ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]]] | [p2<=2 | [p10<=0 | p18<=0]]]]]]
abstracting: (p18<=0)
states: 180,236,694,776,976 (14)
abstracting: (p10<=0)
states: 17,685,822,727,584 (13)
abstracting: (p2<=2)
states: 52,058,044,996,416 (13)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (p8<=0)
states: 17,685,822,727,584 (13)
abstracting: (p0<=2)
states: 52,058,044,996,416 (13)
..
EG iterations: 1
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
EG iterations: 0
.-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.485sec
checking: A [A [EX [[AG [[3<=p2 & [1<=p10 & 1<=p18]]] & EX [[2<=p14 & 1<=p18]]]] U AG [[EG [1<=p19] & [[3<=p22 | [3<=p3 & [1<=p11 & 1<=p19]]] & EX [[1<=p2 & [1<=p6 & 1<=p10]]]]]]] U AG [EF [[~ [AG [[1<=p0 & [1<=p4 & 1<=p8]]]] | [[EF [3<=p21] & 3<=p1] & [1<=p9 & 1<=p17]]]]]]
normalized: [~ [EG [E [true U ~ [E [true U [[[1<=p9 & 1<=p17] & [3<=p1 & E [true U 3<=p21]]] | E [true U ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]]]] & ~ [E [E [true U ~ [E [true U [[[1<=p9 & 1<=p17] & [3<=p1 & E [true U 3<=p21]]] | E [true U ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]] U [~ [[~ [EG [E [true U ~ [[[EX [[1<=p2 & [1<=p6 & 1<=p10]]] & [3<=p22 | [3<=p3 & [1<=p11 & 1<=p19]]]] & EG [1<=p19]]]]]] & ~ [E [E [true U ~ [[[EX [[1<=p2 & [1<=p6 & 1<=p10]]] & [3<=p22 | [3<=p3 & [1<=p11 & 1<=p19]]]] & EG [1<=p19]]]] U [~ [EX [[EX [[2<=p14 & 1<=p18]] & ~ [E [true U ~ [[3<=p2 & [1<=p10 & 1<=p18]]]]]]]] & E [true U ~ [[[EX [[1<=p2 & [1<=p6 & 1<=p10]]] & [3<=p22 | [3<=p3 & [1<=p11 & 1<=p19]]]] & EG [1<=p19]]]]]]]]] & E [true U ~ [E [true U [[[1<=p9 & 1<=p17] & [3<=p1 & E [true U 3<=p21]]] | E [true U ~ [[1<=p0 & [1<=p4 & 1<=p8]]]]]]]]]]]]
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p1)
states: 488,652,039,334,512 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
.
EG iterations: 1
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (3<=p22)
states: 90,118,347,388,488 (13)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (3<=p2)
states: 488,652,039,334,512 (14)
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
..abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
.
EG iterations: 1
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (3<=p22)
states: 90,118,347,388,488 (13)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
.
EG iterations: 1
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (3<=p22)
states: 90,118,347,388,488 (13)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.
EG iterations: 0
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p1)
states: 488,652,039,334,512 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p1)
states: 488,652,039,334,512 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.231sec
checking: [EX [[AG [p12<=0] | AX [[[[1<=p3 & [1<=p7 & 1<=p11]] | [1<=p0 & 1<=p4]] & A [[1<=p0 & [1<=p4 & 1<=p8]] U [1<=p2 & [1<=p6 & 1<=p10]]]]]]] | [AG [3<=p23] | [EX [[EF [p21<=2] | [[p21<=2 & [p15<=1 | p19<=0]] | AX [[p3<=0 | [p7<=0 | p11<=0]]]]]] & EX [p12<=0]]]]
normalized: [[[EX [[E [true U p21<=2] | [~ [EX [~ [[p3<=0 | [p7<=0 | p11<=0]]]]] | [p21<=2 & [p15<=1 | p19<=0]]]]] & EX [p12<=0]] | ~ [E [true U ~ [3<=p23]]]] | EX [[~ [EX [~ [[[~ [EG [~ [[1<=p2 & [1<=p6 & 1<=p10]]]]] & ~ [E [~ [[1<=p2 & [1<=p6 & 1<=p10]]] U [~ [[1<=p0 & [1<=p4 & 1<=p8]]] & ~ [[1<=p2 & [1<=p6 & 1<=p10]]]]]]] & [[1<=p0 & 1<=p4] | [1<=p3 & [1<=p7 & 1<=p11]]]]]]] | ~ [E [true U ~ [p12<=0]]]]]]
abstracting: (p12<=0)
states: 270,355,042,165,464 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
..abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (p12<=0)
states: 270,355,042,165,464 (14)
.abstracting: (p19<=0)
states: 180,236,694,776,976 (14)
abstracting: (p15<=1)
states: 540,710,084,330,928 (14)
abstracting: (p21<=2)
states: 450,591,736,942,440 (14)
abstracting: (p11<=0)
states: 17,685,822,727,584 (13)
abstracting: (p7<=0)
states: 17,686,785,187,728 (13)
abstracting: (p3<=0)
states: 17,685,822,727,584 (13)
.abstracting: (p21<=2)
states: 450,591,736,942,440 (14)
.-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.241sec
checking: AX [[[A [[[[1<=p0 & [1<=p4 & 1<=p8]] & [3<=p3 & [1<=p11 & 1<=p19]]] | EX [[2<=p13 & 1<=p17]]] U [AG [[2<=p12 & 1<=p16]] & [[3<=p23 | [3<=p0 & [1<=p8 & 1<=p16]]] & EF [[2<=p12 & 1<=p16]]]]] & ~ [E [~ [A [3<=p20 U 3<=p21]] U 1<=p13]]] & [AF [[p3<=2 | [p11<=0 | p19<=0]]] & [1<=p16 | AF [[1<=p3 & [1<=p7 & 1<=p11]]]]]]]
normalized: ~ [EX [~ [[[[1<=p16 | ~ [EG [~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]] & ~ [EG [~ [[p3<=2 | [p11<=0 | p19<=0]]]]]] & [~ [E [~ [[~ [EG [~ [3<=p21]]] & ~ [E [~ [3<=p21] U [~ [3<=p20] & ~ [3<=p21]]]]]] U 1<=p13]] & [~ [EG [~ [[[E [true U [2<=p12 & 1<=p16]] & [3<=p23 | [3<=p0 & [1<=p8 & 1<=p16]]]] & ~ [E [true U ~ [[2<=p12 & 1<=p16]]]]]]]] & ~ [E [~ [[[E [true U [2<=p12 & 1<=p16]] & [3<=p23 | [3<=p0 & [1<=p8 & 1<=p16]]]] & ~ [E [true U ~ [[2<=p12 & 1<=p16]]]]]] U [~ [[EX [[2<=p13 & 1<=p17]] | [[3<=p3 & [1<=p11 & 1<=p19]] & [1<=p0 & [1<=p4 & 1<=p8]]]]] & ~ [[[E [true U [2<=p12 & 1<=p16]] & [3<=p23 | [3<=p0 & [1<=p8 & 1<=p16]]]] & ~ [E [true U ~ [[2<=p12 & 1<=p16]]]]]]]]]]]]]]]
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (3<=p3)
states: 488,652,039,334,512 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (2<=p13)
states: 0
.abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
EG iterations: 0
abstracting: (1<=p13)
states: 270,355,042,165,464 (14)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p20)
states: 90,118,347,388,488 (13)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
abstracting: (3<=p21)
states: 90,118,347,388,488 (13)
.
EG iterations: 1
abstracting: (p19<=0)
states: 180,236,694,776,976 (14)
abstracting: (p11<=0)
states: 17,685,822,727,584 (13)
abstracting: (p3<=2)
states: 52,058,044,996,416 (13)
.
EG iterations: 1
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
.-> the formula is FALSE
FORMULA Murphy-PT-D3N050-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.353sec
checking: AX [EF [[[[AF [[3<=p2 & [1<=p10 & 1<=p18]]] & [AX [[3<=p0 & [1<=p8 & 1<=p16]]] & [[2<=p12 & 1<=p16] | [1<=p3 & 1<=p7]]]] | [2<=p14 & [1<=p18 & [A [[3<=p0 & [1<=p8 & 1<=p16]] U [1<=p3 & [1<=p7 & 1<=p11]]] | A [1<=p16 U [1<=p2 & 1<=p6]]]]]] & [EG [[1<=p3 & 1<=p7]] | [EX [[p2<=2 | [p10<=0 | p18<=0]]] | [1<=p0 & [1<=p4 & 1<=p8]]]]]]]
normalized: ~ [EX [~ [E [true U [[[[1<=p0 & [1<=p4 & 1<=p8]] | EX [[p2<=2 | [p10<=0 | p18<=0]]]] | EG [[1<=p3 & 1<=p7]]] & [[2<=p14 & [1<=p18 & [[~ [EG [~ [[1<=p2 & 1<=p6]]]] & ~ [E [~ [[1<=p2 & 1<=p6]] U [~ [1<=p16] & ~ [[1<=p2 & 1<=p6]]]]]] | [~ [EG [~ [[1<=p3 & [1<=p7 & 1<=p11]]]]] & ~ [E [~ [[1<=p3 & [1<=p7 & 1<=p11]]] U [~ [[3<=p0 & [1<=p8 & 1<=p16]]] & ~ [[1<=p3 & [1<=p7 & 1<=p11]]]]]]]]]] | [[[[1<=p3 & 1<=p7] | [2<=p12 & 1<=p16]] & ~ [EX [~ [[3<=p0 & [1<=p8 & 1<=p16]]]]]] & ~ [EG [~ [[3<=p2 & [1<=p10 & 1<=p18]]]]]]]]]]]]
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (3<=p2)
states: 488,652,039,334,512 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
.abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
abstracting: (1<=p11)
states: 523,024,261,603,344 (14)
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
abstracting: (1<=p7)
states: 523,023,299,143,200 (14)
abstracting: (1<=p3)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (p18<=0)
states: 180,236,694,776,976 (14)
abstracting: (p10<=0)
states: 17,685,822,727,584 (13)
abstracting: (p2<=2)
states: 52,058,044,996,416 (13)
.abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
.-> the formula is TRUE
FORMULA Murphy-PT-D3N050-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.047sec
checking: AX [[[EF [[[1<=p0 & [1<=p4 & 1<=p8]] | [1<=p1 & [1<=p5 & 1<=p9]]]] & [EX [[1<=p1 & [1<=p5 & [p15<=1 | p19<=0]]]] & EG [[3<=p0 & [1<=p8 & 1<=p16]]]]] & [[AF [EG [1<=p19]] & E [[2<=p15 & [1<=p19 & [1<=p17 | [1<=p1 & [1<=p5 & 1<=p9]]]]] U ~ [[[1<=p0 & 1<=p4] & [1<=p8 & 1<=p15]]]]] & [[EG [[1<=p2 & [1<=p6 & 1<=p10]]] | E [3<=p23 U [2<=p12 & 1<=p16]]] & [[[p0<=2 | [p8<=0 | p16<=0]] & [[p2<=0 | p6<=0] | [p10<=0 | [[1<=p0 & 1<=p4] | [[1<=p0 & 1<=p4] & [1<=p8 & [p1<=0 | p5<=0]]]]]]] | [AG [[3<=p23 | [2<=p12 & 1<=p16]]] & [AF [1<=p12] | [2<=p14 & [1<=p18 & AX [[1<=p1 & [1<=p5 & 1<=p9]]]]]]]]]]]]
normalized: ~ [EX [~ [[[[[[[[2<=p14 & [1<=p18 & ~ [EX [~ [[1<=p1 & [1<=p5 & 1<=p9]]]]]]] | ~ [EG [~ [1<=p12]]]] & ~ [E [true U ~ [[3<=p23 | [2<=p12 & 1<=p16]]]]]] | [[[p10<=0 | [[[1<=p8 & [p1<=0 | p5<=0]] & [1<=p0 & 1<=p4]] | [1<=p0 & 1<=p4]]] | [p2<=0 | p6<=0]] & [p0<=2 | [p8<=0 | p16<=0]]]] & [E [3<=p23 U [2<=p12 & 1<=p16]] | EG [[1<=p2 & [1<=p6 & 1<=p10]]]]] & [E [[2<=p15 & [1<=p19 & [1<=p17 | [1<=p1 & [1<=p5 & 1<=p9]]]]] U ~ [[[1<=p8 & 1<=p15] & [1<=p0 & 1<=p4]]]] & ~ [EG [~ [EG [1<=p19]]]]]] & [[EG [[3<=p0 & [1<=p8 & 1<=p16]]] & EX [[1<=p1 & [1<=p5 & [p15<=1 | p19<=0]]]]] & E [true U [[1<=p1 & [1<=p5 & 1<=p9]] | [1<=p0 & [1<=p4 & 1<=p8]]]]]]]]]
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
abstracting: (p19<=0)
states: 180,236,694,776,976 (14)
abstracting: (p15<=1)
states: 540,710,084,330,928 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
.abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (3<=p0)
states: 488,652,039,334,512 (14)
.
EG iterations: 1
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p15)
states: 270,355,042,165,464 (14)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
abstracting: (1<=p17)
states: 360,473,389,553,952 (14)
abstracting: (1<=p19)
states: 360,473,389,553,952 (14)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p10)
states: 523,024,261,603,344 (14)
abstracting: (1<=p6)
states: 523,023,299,143,200 (14)
abstracting: (1<=p2)
states: 523,024,261,603,344 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (p16<=0)
states: 180,236,694,776,976 (14)
abstracting: (p8<=0)
states: 17,685,822,727,584 (13)
abstracting: (p0<=2)
states: 52,058,044,996,416 (13)
abstracting: (p6<=0)
states: 17,686,785,187,728 (13)
abstracting: (p2<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (1<=p4)
states: 523,023,299,143,200 (14)
abstracting: (1<=p0)
states: 523,024,261,603,344 (14)
abstracting: (p5<=0)
states: 17,686,785,187,728 (13)
abstracting: (p1<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p8)
states: 523,024,261,603,344 (14)
abstracting: (p10<=0)
states: 17,685,822,727,584 (13)
abstracting: (1<=p16)
states: 360,473,389,553,952 (14)
abstracting: (2<=p12)
states: 0
abstracting: (3<=p23)
states: 90,118,347,388,488 (13)
abstracting: (1<=p12)
states: 270,355,042,165,464 (14)
.
EG iterations: 1
abstracting: (1<=p9)
states: 523,024,261,603,344 (14)
abstracting: (1<=p5)
states: 523,023,299,143,200 (14)
abstracting: (1<=p1)
states: 523,024,261,603,344 (14)
.abstracting: (1<=p18)
states: 360,473,389,553,952 (14)
abstracting: (2<=p14)
states: 0
.-> the formula is FALSE
FORMULA Murphy-PT-D3N050-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.900sec
totally nodes used: 21048590 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 510117434 50329096 560446530
used/not used/entry size/cache size: 42827899 24280965 16 1024MB
basic ops cache: hits/miss/sum: 146304045 21760864 168064909
used/not used/entry size/cache size: 14092111 2685105 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: 2682428 502301 3184729
used/not used/entry size/cache size: 486678 7901930 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 51036128
1 12132410
2 3278631
3 534402
4 93552
5 19834
6 8050
7 1919
8 594
9 153
>= 10 3191
Total processing time: 1m30.428sec
BK_STOP 1680893225340
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:20755 (741), effective:4264 (152)
initing FirstDep: 0m 0.000sec
iterations count:36 (1), effective:2 (0)
iterations count:32 (1), effective:1 (0)
iterations count:265 (9), effective:48 (1)
iterations count:728 (26), effective:100 (3)
iterations count:828 (29), effective:100 (3)
iterations count:227 (8), effective:199 (7)
iterations count:828 (29), effective:100 (3)
iterations count:246 (8), effective:204 (7)
iterations count:828 (29), effective:100 (3)
iterations count:36 (1), effective:2 (0)
iterations count:36 (1), effective:2 (0)
iterations count:227 (8), effective:199 (7)
iterations count:227 (8), effective:199 (7)
iterations count:28 (1), effective:0 (0)
iterations count:227 (8), effective:199 (7)
iterations count:97 (3), effective:13 (0)
iterations count:31 (1), effective:1 (0)
iterations count:32 (1), effective:1 (0)
iterations count:36 (1), effective:2 (0)
iterations count:28 (1), effective:0 (0)
iterations count:36 (1), effective:2 (0)
iterations count:728 (26), effective:100 (3)
iterations count:227 (8), effective:199 (7)
iterations count:40 (1), effective:3 (0)
iterations count:28 (1), effective:0 (0)
iterations count:1019 (36), effective:199 (7)
iterations count:1920 (68), effective:199 (7)
iterations count:1019 (36), effective:199 (7)
iterations count:28 (1), effective:0 (0)
iterations count:1019 (36), effective:199 (7)
iterations count:227 (8), effective:199 (7)
iterations count:40 (1), effective:3 (0)
iterations count:28 (1), effective:0 (0)
iterations count:227 (8), effective:199 (7)
iterations count:40 (1), effective:3 (0)
iterations count:28 (1), effective:0 (0)
iterations count:39 (1), effective:3 (0)
iterations count:227 (8), effective:199 (7)
iterations count:31 (1), effective:1 (0)
iterations count:31 (1), effective:1 (0)
iterations count:28 (1), effective:0 (0)
iterations count:28 (1), effective:0 (0)
iterations count:226 (8), effective:198 (7)
iterations count:28 (1), effective:0 (0)
iterations count:31 (1), effective:1 (0)
iterations count:28 (1), effective:0 (0)
iterations count:426 (15), effective:199 (7)
iterations count:36 (1), effective:2 (0)
iterations count:399 (14), effective:79 (2)
iterations count:91 (3), effective:14 (0)
iterations count:28 (1), effective:0 (0)
iterations count:31 (1), effective:1 (0)
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-D3N050"
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-D3N050, 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-167987247200354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 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 ;