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-167987247300362.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-D4N025, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 19K 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-D4N025-CTLFireability-00
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-01
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-02
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-03
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-04
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-05
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-06
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-07
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-08
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-09
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-10
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-11
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-12
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-13
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-14
FORMULA_NAME Murphy-PT-D4N025-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680893394873

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-D4N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:49:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:49:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:49:56] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-04-07 18:49:56] [INFO ] Transformed 30 places.
[2023-04-07 18:49:56] [INFO ] Transformed 35 transitions.
[2023-04-07 18:49:56] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:49:56] [INFO ] Computed 6 invariants in 10 ms
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-04-07 18:49:56] [INFO ] Invariant cache hit.
[2023-04-07 18:49:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:49:57] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:49:57] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 44) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :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 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 22 ms. (steps per millisecond=454 ) 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 22 ms. (steps per millisecond=454 ) 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 10000 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
Running SMT prover for 9 properties.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:49:57] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-04-07 18:49:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:49:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:49:57] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-04-07 18:49:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:49:57] [INFO ] After 25ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-04-07 18:49:57] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 18:49:57] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 17 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:49:57] [INFO ] Invariant cache hit.
[2023-04-07 18:49:57] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 287113 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287113 steps, saw 198159 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 18:50:01] [INFO ] Invariant cache hit.
[2023-04-07 18:50:01] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:50:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:50:01] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:01] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:01] [INFO ] After 18ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:01] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 18:50:01] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 17 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:01] [INFO ] Invariant cache hit.
[2023-04-07 18:50:01] [INFO ] Implicit Places using invariants in 25 ms returned [10, 11, 14]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29 ms. Remains : 27/30 places, 35/35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 309844 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309844 steps, saw 214097 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 35 rows 27 cols
[2023-04-07 18:50:04] [INFO ] Computed 3 invariants in 1 ms
[2023-04-07 18:50:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:04] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:50:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:50:04] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:04] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:04] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 18:50:04] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 17 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 27/27 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:04] [INFO ] Invariant cache hit.
[2023-04-07 18:50:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 18:50:04] [INFO ] Invariant cache hit.
[2023-04-07 18:50:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:04] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-07 18:50:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:50:04] [INFO ] Invariant cache hit.
[2023-04-07 18:50:04] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 27/27 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-04-07 18:50:04] [INFO ] Invariant cache hit.
[2023-04-07 18:50:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:50:04] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:50:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:50:04] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 18:50:04] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:05] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:50:05] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 18:50:05] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:50:05] [INFO ] Computed 6 invariants in 0 ms
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [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 : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:05] [INFO ] Invariant cache hit.
[2023-04-07 18:50:05] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:05] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2259226 steps, run timeout after 3001 ms. (steps per millisecond=752 ) properties seen :{}
Probabilistic random walk after 2259226 steps, saw 1569532 distinct states, run finished after 3001 ms. (steps per millisecond=752 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 18:50:08] [INFO ] Invariant cache hit.
[2023-04-07 18:50:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:50:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:50:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:50:08] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:50:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:50:08] [INFO ] After 2ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:50:08] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 18:50:08] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Graph (complete) has 115 edges and 30 vertex of which 3 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /30 variables (removed 27) and now considering 4/35 (removed 31) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 18:50:08] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:50:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 3/30 places, 4/35 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:50:09] [INFO ] Computed 6 invariants in 1 ms
[2023-04-07 18:50:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [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 : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [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 : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [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 : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:50:09] [INFO ] Invariant cache hit.
[2023-04-07 18:50:09] [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 : 30/30 places, 35/35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:50:09] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:50:09] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:50:09] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-07 18:50:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 13371 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: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.680sec


RS generation: 0m 8.974sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: AX [AG [EF [p17<=0]]]
normalized: ~ [EX [E [true U ~ [E [true U p17<=0]]]]]

abstracting: (p17<=0)
states: 10,006,303,154,335,488 (16)
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.346sec

checking: EG [EF [[2<=p18 & 1<=p23]]]
normalized: EG [E [true U [2<=p18 & 1<=p23]]]

abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.377sec

checking: EG [[1<=p2 & 1<=p7]]
normalized: EG [[1<=p2 & 1<=p7]]

abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: AG [EF [EX [EG [[1<=p17 & 1<=p19]]]]]
normalized: ~ [E [true U ~ [E [true U EX [EG [[1<=p17 & 1<=p19]]]]]]]

abstracting: (1<=p19)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.506sec

checking: AG [[EG [p28<=2] | EX [[EF [p15<=0] & [p16<=1 | p21<=0]]]]]
normalized: ~ [E [true U ~ [[EX [[E [true U p15<=0] & [p16<=1 | p21<=0]]] | EG [p28<=2]]]]]

abstracting: (p28<=2)
states: 16,677,171,923,892,480 (16)
.
EG iterations: 1
abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
abstracting: (p15<=0)
states: 10,006,303,154,335,488 (16)
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.276sec

checking: AX [AF [~ [A [AF [[2<=p15 & 1<=p20]] U EX [~ [[p16<=1 | p21<=0]]]]]]]
normalized: ~ [EX [EG [[~ [EG [~ [EX [~ [[p16<=1 | p21<=0]]]]]] & ~ [E [~ [EX [~ [[p16<=1 | p21<=0]]]] U [EG [~ [[2<=p15 & 1<=p20]]] & ~ [EX [~ [[p16<=1 | p21<=0]]]]]]]]]]]

abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0

EG iterations: 0
abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.
EG iterations: 0
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EG [A [~ [EG [~ [AG [[2<=p17 & 1<=p22]]]]] U [1<=p18 | [EF [[1<=p4 & [1<=p9 & 1<=p14]]] & EX [EG [1<=p17]]]]]]
normalized: EG [[~ [EG [~ [[1<=p18 | [EX [EG [1<=p17]] & E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]]]] & ~ [E [~ [[1<=p18 | [EX [EG [1<=p17]] & E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]] U [EG [E [true U ~ [[2<=p17 & 1<=p22]]]] & ~ [[1<=p18 | [EX [EG [1<=p17]] & E [true U [1<=p4 & [1<=p9 & 1<=p14]]]]]]]]]]]

abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p17)
states: 0

EG iterations: 0
abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.595sec

checking: AG [[EF [[E [[3<=p4 & [1<=p24 & 1<=p14]] U [2<=p18 & 1<=p23]] | p16<=0]] | [~ [A [[[3<=p27 | [3<=p2 & [1<=p12 & 1<=p22]]] & [2<=p15 & 1<=p20]] U EF [1<=p20]]] | p21<=0]]]
normalized: ~ [E [true U ~ [[[p21<=0 | ~ [[~ [EG [~ [E [true U 1<=p20]]]] & ~ [E [~ [E [true U 1<=p20]] U [~ [E [true U 1<=p20]] & ~ [[[2<=p15 & 1<=p20] & [3<=p27 | [3<=p2 & [1<=p12 & 1<=p22]]]]]]]]]]] | E [true U [p16<=0 | E [[3<=p4 & [1<=p24 & 1<=p14]] U [2<=p18 & 1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
abstracting: (3<=p4)
states: 16,316,817,174,687,744 (16)
abstracting: (p16<=0)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p12)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p2)
states: 16,316,817,174,687,744 (16)
abstracting: (3<=p27)
states: 3,335,434,384,778,496 (15)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
.
EG iterations: 1
abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.233sec

checking: EF [[A [EF [[2<=p17 & 1<=p22]] U E [[3<=p1 & [1<=p11 & 1<=p21]] U [2<=p18 & 1<=p23]]] & [AG [[[3<=p2 & [1<=p12 & 1<=p22]] | [1<=p4 & [1<=p9 & 1<=p14]]]] | EG [[1<=p3 & [1<=p8 & 1<=p13]]]]]]
normalized: E [true U [[EG [[1<=p3 & [1<=p8 & 1<=p13]]] | ~ [E [true U ~ [[[1<=p4 & [1<=p9 & 1<=p14]] | [3<=p2 & [1<=p12 & 1<=p22]]]]]]] & [~ [EG [~ [E [[3<=p1 & [1<=p11 & 1<=p21]] U [2<=p18 & 1<=p23]]]]] & ~ [E [~ [E [[3<=p1 & [1<=p11 & 1<=p21]] U [2<=p18 & 1<=p23]]] U [~ [E [true U [2<=p17 & 1<=p22]]] & ~ [E [[3<=p1 & [1<=p11 & 1<=p21]] U [2<=p18 & 1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p1)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p17)
states: 0
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p1)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p1)
states: 16,316,817,174,687,744 (16)

EG iterations: 0
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p12)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p2)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.123sec

checking: E [~ [[E [~ [AG [[1<=p1 & 1<=p6]]] U [[EG [1<=p15] & 3<=p3] & [1<=p13 & 1<=p23]]] & EF [[[[[1<=p4 & [1<=p9 & 1<=p14]] | [1<=p1 & [1<=p6 & 1<=p11]]] & 1<=p4] & [1<=p9 & ~ [[1<=p3 & 1<=p8]]]]]]] U 1<=p23]
normalized: E [~ [[E [true U [[1<=p4 & [[1<=p1 & [1<=p6 & 1<=p11]] | [1<=p4 & [1<=p9 & 1<=p14]]]] & [1<=p9 & ~ [[1<=p3 & 1<=p8]]]]] & E [E [true U ~ [[1<=p1 & 1<=p6]]] U [[1<=p13 & 1<=p23] & [3<=p3 & EG [1<=p15]]]]]] U 1<=p23]

abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
abstracting: (3<=p3)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p14)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.271sec

checking: AG [A [[[EG [EX [3<=p25]] | ~ [AX [1<=p18]]] | [[EX [[3<=p1 & [1<=p11 & 1<=p21]]] & EG [1<=p15]] | [2<=p16 & [1<=p21 & [~ [[1<=p3 & [1<=p8 & 1<=p13]]] | [[1<=p2 & 1<=p7] | [2<=p19 & 1<=p24]]]]]]] U [1<=p16 | AG [[EG [[1<=p3 & 1<=p8]] | [1<=p23 | 1<=p22]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[1<=p16 | ~ [E [true U ~ [[[1<=p23 | 1<=p22] | EG [[1<=p3 & 1<=p8]]]]]]]]]] & ~ [E [~ [[1<=p16 | ~ [E [true U ~ [[[1<=p23 | 1<=p22] | EG [[1<=p3 & 1<=p8]]]]]]]] U [~ [[[[2<=p16 & [1<=p21 & [[[1<=p2 & 1<=p7] | [2<=p19 & 1<=p24]] | ~ [[1<=p3 & [1<=p8 & 1<=p13]]]]]] | [EG [1<=p15] & EX [[3<=p1 & [1<=p11 & 1<=p21]]]]] | [EX [~ [1<=p18]] | EG [EX [3<=p25]]]]] & ~ [[1<=p16 | ~ [E [true U ~ [[[1<=p23 | 1<=p22] | EG [[1<=p3 & 1<=p8]]]]]]]]]]]]]]]

abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p16)
states: 10,006,303,154,335,488 (16)
abstracting: (3<=p25)
states: 3,335,434,384,778,496 (15)
..
EG iterations: 1
abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
.abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p1)
states: 16,316,817,174,687,744 (16)
.abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p19)
states: 0
abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p16)
states: 0
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p16)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p16)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.377sec

checking: [AG [A [[EX [EG [1<=p18]] | [[AF [[2<=p17 & 1<=p22]] | E [1<=p18 U [1<=p2 & 1<=p7]]] & ~ [[1<=p0 & 1<=p5]]]] U [~ [EG [~ [[p16<=1 | p21<=0]]]] & AX [[[1<=p3 & 1<=p8] | 1<=p15]]]]] | AF [[[EG [AF [[1<=p1 & [1<=p6 & 1<=p11]]]] & p28<=2] & [3<=p0 & [1<=p10 & 1<=p20]]]]]
normalized: [~ [EG [~ [[[3<=p0 & [1<=p10 & 1<=p20]] & [p28<=2 & EG [~ [EG [~ [[1<=p1 & [1<=p6 & 1<=p11]]]]]]]]]]] | ~ [E [true U ~ [[~ [EG [~ [[~ [EX [~ [[1<=p15 | [1<=p3 & 1<=p8]]]]] & ~ [EG [~ [[p16<=1 | p21<=0]]]]]]]] & ~ [E [~ [[~ [EX [~ [[1<=p15 | [1<=p3 & 1<=p8]]]]] & ~ [EG [~ [[p16<=1 | p21<=0]]]]]] U [~ [[[~ [[1<=p0 & 1<=p5]] & [E [1<=p18 U [1<=p2 & 1<=p7]] | ~ [EG [~ [[2<=p17 & 1<=p22]]]]]] | EX [EG [1<=p18]]]] & ~ [[~ [EX [~ [[1<=p15 | [1<=p3 & 1<=p8]]]]] & ~ [EG [~ [[p16<=1 | p21<=0]]]]]]]]]]]]]]

abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.
EG iterations: 1
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
.abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
.
EG iterations: 1
.abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p17)
states: 0

EG iterations: 0
abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p18)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.
EG iterations: 1
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
.abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
.
EG iterations: 1
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
..
EG iterations: 1
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p28<=2)
states: 16,677,171,923,892,480 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p10)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p0)
states: 16,316,817,174,687,744 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.121sec

checking: [EX [[[[A [[1<=p0 & 1<=p5] U [1<=p2 & 1<=p7]] & AX [[1<=p4 & 1<=p9]]] & [1<=p17 & EX [1<=p23]]] | 3<=p29]] | [AX [3<=p28] | E [EF [[~ [AG [1<=p21]] & [EX [[1<=p0 & 1<=p5]] | ~ [[[1<=p1 & [1<=p6 & 1<=p11]] | 1<=p15]]]]] U [AG [[~ [AG [~ [[p16<=1 | p21<=0]]]] | [[1<=p21 & 1<=p16] | p28<=2]]] & ~ [EF [1<=p23]]]]]]
normalized: [[E [E [true U [[~ [[1<=p15 | [1<=p1 & [1<=p6 & 1<=p11]]]] | EX [[1<=p0 & 1<=p5]]] & E [true U ~ [1<=p21]]]] U [~ [E [true U 1<=p23]] & ~ [E [true U ~ [[[p28<=2 | [1<=p21 & 1<=p16]] | E [true U [p16<=1 | p21<=0]]]]]]]] | ~ [EX [~ [3<=p28]]]] | EX [[3<=p29 | [[1<=p17 & EX [1<=p23]] & [~ [EX [~ [[1<=p4 & 1<=p9]]]] & [~ [EG [~ [[1<=p2 & 1<=p7]]]] & ~ [E [~ [[1<=p2 & 1<=p7]] U [~ [[1<=p0 & 1<=p5]] & ~ [[1<=p2 & 1<=p7]]]]]]]]]]]

abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p7)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p2)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
.abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
.abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
abstracting: (3<=p29)
states: 3,335,434,384,778,496 (15)
.abstracting: (3<=p28)
states: 3,335,434,384,778,496 (15)
.abstracting: (p21<=0)
states: 6,670,868,769,556,992 (15)
abstracting: (p16<=1)
states: 20,012,606,308,670,976 (16)
abstracting: (1<=p16)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (p28<=2)
states: 16,677,171,923,892,480 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
.abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.066sec

checking: E [[[AG [1<=p16] | AX [[~ [[~ [[1<=p4 & 1<=p9]] | A [1<=p17 U [2<=p15 & 1<=p20]]]] & AF [3<=p28]]]] | [[[1<=p20 & 1<=p1] & [1<=p6 & 1<=p11]] | [3<=p26 & AG [[[[[3<=p3 & [1<=p13 & 1<=p23]] | [2<=p18 & 1<=p23]] & 1<=p23] & [2<=p18 & 1<=p23]]]]]] U EG [[EG [1<=p21] | E [EF [[2<=p19 & 1<=p24]] U AX [1<=p15]]]]]
normalized: E [[[[3<=p26 & ~ [E [true U ~ [[[2<=p18 & 1<=p23] & [1<=p23 & [[2<=p18 & 1<=p23] | [3<=p3 & [1<=p13 & 1<=p23]]]]]]]]] | [[1<=p6 & 1<=p11] & [1<=p20 & 1<=p1]]] | [~ [EX [~ [[~ [EG [~ [3<=p28]]] & ~ [[[~ [EG [~ [[2<=p15 & 1<=p20]]]] & ~ [E [~ [[2<=p15 & 1<=p20]] U [~ [1<=p17] & ~ [[2<=p15 & 1<=p20]]]]]] | ~ [[1<=p4 & 1<=p9]]]]]]]] | ~ [E [true U ~ [1<=p16]]]]] U EG [[E [E [true U [2<=p19 & 1<=p24]] U ~ [EX [~ [1<=p15]]]] | EG [1<=p21]]]]

abstracting: (1<=p21)
states: 13,341,737,539,113,984 (16)
.
EG iterations: 1
abstracting: (1<=p15)
states: 10,006,303,154,335,488 (16)
.abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p19)
states: 0
.
EG iterations: 1
abstracting: (1<=p16)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p9)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p4)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p17)
states: 10,006,303,154,335,488 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0

EG iterations: 0
abstracting: (3<=p28)
states: 3,335,434,384,778,496 (15)
.
EG iterations: 1
.abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p3)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p18)
states: 0
abstracting: (3<=p26)
states: 3,335,434,384,778,496 (15)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.499sec

checking: E [[[EX [[AG [[1<=p0 & 1<=p5]] & 3<=p25]] | [~ [EF [[3<=p2 & [1<=p12 & 1<=p22]]]] | [EG [[2<=p15 & 1<=p20]] & [A [[1<=p3 & [1<=p8 & 1<=p13]] U 1<=p24] | [E [3<=p25 U [1<=p0 & 1<=p5]] | 1<=p23]]]]] & [~ [EF [~ [[3<=p26 | [1<=p0 & 1<=p5]]]]] | [1<=p1 & [1<=p6 & 1<=p11]]]] U [3<=p28 & [EG [[1<=p1 & 1<=p6]] | [3<=p3 & [1<=p13 & 1<=p23]]]]]
normalized: E [[[[1<=p1 & [1<=p6 & 1<=p11]] | ~ [E [true U ~ [[3<=p26 | [1<=p0 & 1<=p5]]]]]] & [[[[[1<=p23 | E [3<=p25 U [1<=p0 & 1<=p5]]] | [~ [EG [~ [1<=p24]]] & ~ [E [~ [1<=p24] U [~ [[1<=p3 & [1<=p8 & 1<=p13]]] & ~ [1<=p24]]]]]] & EG [[2<=p15 & 1<=p20]]] | ~ [E [true U [3<=p2 & [1<=p12 & 1<=p22]]]]] | EX [[3<=p25 & ~ [E [true U ~ [[1<=p0 & 1<=p5]]]]]]]] U [3<=p28 & [[3<=p3 & [1<=p13 & 1<=p23]] | EG [[1<=p1 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
.
EG iterations: 1
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p3)
states: 16,316,817,174,687,744 (16)
abstracting: (3<=p28)
states: 3,335,434,384,778,496 (15)
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p25)
states: 3,335,434,384,778,496 (15)
.abstracting: (1<=p22)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p12)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p2)
states: 16,316,817,174,687,744 (16)
abstracting: (1<=p20)
states: 13,341,737,539,113,984 (16)
abstracting: (2<=p15)
states: 0
.
EG iterations: 1
abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p13)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p8)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p3)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p24)
states: 13,341,737,539,113,984 (16)
.
EG iterations: 1
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p25)
states: 3,335,434,384,778,496 (15)
abstracting: (1<=p23)
states: 13,341,737,539,113,984 (16)
abstracting: (1<=p5)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p0)
states: 18,680,799,210,518,016 (16)
abstracting: (3<=p26)
states: 3,335,434,384,778,496 (15)
abstracting: (1<=p11)
states: 18,680,799,210,518,016 (16)
abstracting: (1<=p6)
states: 18,680,767,986,456,576 (16)
abstracting: (1<=p1)
states: 18,680,799,210,518,016 (16)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.133sec

totally nodes used: 11800214 (1.2e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 240679716 33552752 274232468
used/not used/entry size/cache size: 32122182 34986682 16 1024MB
basic ops cache: hits/miss/sum: 60716123 10713764 71429887
used/not used/entry size/cache size: 10966921 5810295 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: 1141218 276579 1417797
used/not used/entry size/cache size: 271914 8116694 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 57056320
1 8596486
2 1301155
3 128447
4 13167
5 2291
6 3012
7 1546
8 2547
9 649
>= 10 3244

Total processing time: 0m47.410sec


BK_STOP 1680893458334

--------------------
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:23162 (661), effective:4563 (130)

initing FirstDep: 0m 0.000sec


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

iterations count:54 (1), effective:5 (0)

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

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

iterations count:136 (3), effective:19 (0)

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

iterations count:136 (3), effective:19 (0)

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

iterations count:136 (3), effective:19 (0)

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

iterations count:42 (1), effective:2 (0)

iterations count:42 (1), effective:2 (0)

iterations count:42 (1), effective:2 (0)

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

iterations count:1706 (48), effective:193 (5)

iterations count:295 (8), effective:65 (1)

iterations count:379 (10), effective:54 (1)

iterations count:648 (18), effective:83 (2)

iterations count:42 (1), effective:2 (0)

iterations count:571 (16), effective:69 (1)

iterations count:571 (16), effective:69 (1)

iterations count:571 (16), effective:69 (1)

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

iterations count:128 (3), effective:17 (0)

iterations count:347 (9), effective:141 (4)

iterations count:551 (15), effective:65 (1)

iterations count:163 (4), effective:128 (3)

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

iterations count:42 (1), effective:2 (0)

iterations count:43 (1), effective:2 (0)

iterations count:82 (2), effective:11 (0)

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

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

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

iterations count:42 (1), effective:2 (0)

iterations count:163 (4), effective:128 (3)

iterations count:258 (7), effective:44 (1)

iterations count:555 (15), effective:65 (1)

iterations count:111 (3), effective:16 (0)

iterations count:166 (4), effective:129 (3)

iterations count:35 (1), effective:0 (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-D4N025"
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-D4N025, 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-167987247300362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;