About the Execution of Marcie+red for CircadianClock-PT-000001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.348 | 10781.00 | 15254.00 | 441.50 | TFTTTTFTFFFTFFTF | 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.r074-smll-167814399800098.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 CircadianClock-PT-000001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814399800098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:22 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 CircadianClock-PT-000001-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678299298756
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=CircadianClock-PT-000001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-08 18:15:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:15:01] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-08 18:15:01] [INFO ] Transformed 14 places.
[2023-03-08 18:15:01] [INFO ] Transformed 16 transitions.
[2023-03-08 18:15:01] [INFO ] Found NUPN structural information;
[2023-03-08 18:15:01] [INFO ] Parsed PT model containing 14 places and 16 transitions and 58 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CircadianClock-PT-000001-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 14 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-08 18:15:01] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 18:15:01] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-08 18:15:01] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 18:15:01] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:15:01] [INFO ] Invariant cache hit.
[2023-03-08 18:15:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 18:15:01] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-08 18:15:01] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:15:01] [INFO ] Invariant cache hit.
[2023-03-08 18:15:01] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 21 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 9 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 37) seen :36
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 18:15:02] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-08 18:15:02] [INFO ] Invariant cache hit.
[2023-03-08 18:15:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-08 18:15:02] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA CircadianClock-PT-000001-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 5 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 6 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 2 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 14/14 places, 16/16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 1 ms
[2023-03-08 18:15:02] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:15:02] [INFO ] Flatten gal took : 3 ms
[2023-03-08 18:15:02] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-08 18:15:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 16 transitions and 58 arcs took 1 ms.
Total runtime 1573 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: 14 NrTr: 16 NrArc: 58)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.741sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 21 (2.1e+01) #states 128
starting MCC model checker
--------------------------
checking: EG [EX [[~ [A [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]] U [p6<=1 & 1<=p6]]] & EF [[p0<=0 & 0<=p0]]]]]
normalized: EG [EX [[E [true U [p0<=0 & 0<=p0]] & ~ [[~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]] & ~ [[p6<=1 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
.
EG iterations: 1
abstracting: (0<=p0)
states: 128
abstracting: (p0<=0)
states: 64
.
EG iterations: 0
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [EX [EG [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]]] U A [EX [AG [[p7<=1 & 1<=p7]]] U ~ [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]]]]
normalized: [~ [EG [~ [[~ [EG [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]] & ~ [E [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] U [~ [EX [~ [E [true U ~ [[p7<=1 & 1<=p7]]]]]] & [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]]]]]] & ~ [E [~ [[~ [EG [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]] & ~ [E [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] U [~ [EX [~ [E [true U ~ [[p7<=1 & 1<=p7]]]]]] & [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]]]] U [~ [EX [EG [[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]] & ~ [[~ [EG [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]] & ~ [E [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] U [~ [EX [~ [E [true U ~ [[p7<=1 & 1<=p7]]]]]] & [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]]]]]]]]
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.
EG iterations: 1
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
.abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [EF [AG [E [~ [[[p3<=1 & 1<=p3] & [p11<=1 & 1<=p11]]] U E [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]] U [[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]]]]]
normalized: EG [E [true U ~ [E [true U ~ [E [~ [[[p11<=1 & 1<=p11] & [p3<=1 & 1<=p3]]] U E [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [AG [[[[p0<=1 & 1<=p0] | [p8<=0 & 0<=p8]] | [[[p3<=1 & 1<=p3] & [p11<=1 & 1<=p11]] | [[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]]]]]]
normalized: EG [~ [E [true U ~ [[[[[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]] | [[p11<=1 & 1<=p11] & [p3<=1 & 1<=p3]]] | [[p8<=0 & 0<=p8] | [p0<=1 & 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (0<=p8)
states: 128
abstracting: (p8<=0)
states: 64
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[EG [[[[[p3<=0 & 0<=p3] | [p11<=0 & 0<=p11]] | [[p1<=0 & 0<=p1] | [p9<=0 & 0<=p9]]] & AX [[[p3<=0 & 0<=p3] | [p11<=0 & 0<=p11]]]]] | [p0<=1 & 1<=p0]]]
normalized: E [true U [[p0<=1 & 1<=p0] | EG [[~ [EX [~ [[[p11<=0 & 0<=p11] | [p3<=0 & 0<=p3]]]]] & [[[p9<=0 & 0<=p9] | [p1<=0 & 0<=p1]] | [[p11<=0 & 0<=p11] | [p3<=0 & 0<=p3]]]]]]]
abstracting: (0<=p3)
states: 128
abstracting: (p3<=0)
states: 64
abstracting: (0<=p11)
states: 128
abstracting: (p11<=0)
states: 64
abstracting: (0<=p1)
states: 128
abstracting: (p1<=0)
states: 64
abstracting: (0<=p9)
states: 128
abstracting: (p9<=0)
states: 64
abstracting: (0<=p3)
states: 128
abstracting: (p3<=0)
states: 64
abstracting: (0<=p11)
states: 128
abstracting: (p11<=0)
states: 64
..
EG iterations: 1
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [AG [[EF [[AG [[[p6<=0 & 0<=p6] | [p13<=0 & 0<=p13]]] | [[p5<=1 & 1<=p5] & [[p10<=1 & 1<=p10] & [p6<=1 & 1<=p6]]]]] | E [~ [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]] U ~ [[p8<=1 & 1<=p8]]]]]]
normalized: ~ [EG [E [true U ~ [[E [true U [~ [E [true U ~ [[[p13<=0 & 0<=p13] | [p6<=0 & 0<=p6]]]]] | [[[p6<=1 & 1<=p6] & [p10<=1 & 1<=p10]] & [p5<=1 & 1<=p5]]]] | E [~ [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]] U ~ [[p8<=1 & 1<=p8]]]]]]]]
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (0<=p6)
states: 128
abstracting: (p6<=0)
states: 64
abstracting: (0<=p13)
states: 128
abstracting: (p13<=0)
states: 64
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [[EF [EG [[[AX [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]] & [p5<=1 & 1<=p5]] & [[p13<=1 & 1<=p13] & [[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]]]]] | AF [[[[[p0<=0 & 0<=p0] & [p6<=0 & 0<=p6]] | [[p5<=0 & 0<=p5] | [p13<=0 & 0<=p13]]] & ~ [E [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]] U [[p0<=1 & 1<=p0] & [p4<=1 & 1<=p4]]]]]]]]
normalized: EG [[~ [EG [~ [[~ [E [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] U [[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]]]] & [[[p13<=0 & 0<=p13] | [p5<=0 & 0<=p5]] | [[p6<=0 & 0<=p6] & [p0<=0 & 0<=p0]]]]]]] | E [true U EG [[[[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] & [p13<=1 & 1<=p13]] & [[p5<=1 & 1<=p5] & ~ [EX [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
abstracting: (0<=p0)
states: 128
abstracting: (p0<=0)
states: 64
abstracting: (0<=p6)
states: 128
abstracting: (p6<=0)
states: 64
abstracting: (0<=p5)
states: 128
abstracting: (p5<=0)
states: 64
abstracting: (0<=p13)
states: 128
abstracting: (p13<=0)
states: 64
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [A [~ [[[~ [EF [[p7<=1 & 1<=p7]]] | AX [~ [[p7<=1 & 1<=p7]]]] & ~ [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]]]] U ~ [[EF [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]]] | [p7<=1 & 1<=p7]]]] & E [[AX [~ [EG [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]]]] & AX [EX [[[p4<=1 & 1<=p4] & [[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]]]]]] U [EF [[p7<=1 & 1<=p7]] & EF [EX [~ [[[p3<=1 & 1<=p3] & [p11<=1 & 1<=p11]]]]]]]]
normalized: [E [[~ [EX [~ [EX [[[[p8<=1 & 1<=p8] & [p10<=1 & 1<=p10]] & [p4<=1 & 1<=p4]]]]]] & ~ [EX [EG [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]] U [E [true U EX [~ [[[p11<=1 & 1<=p11] & [p3<=1 & 1<=p3]]]]] & E [true U [p7<=1 & 1<=p7]]]] & [~ [EG [[[p7<=1 & 1<=p7] | E [true U [[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]]]] & ~ [E [[[p7<=1 & 1<=p7] | E [true U [[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]] U [[~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [~ [EX [[p7<=1 & 1<=p7]]] | ~ [E [true U [p7<=1 & 1<=p7]]]]] & [[p7<=1 & 1<=p7] | E [true U [[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
.abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
EG iterations: 0
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
.abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.
EG iterations: 1
.abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
..-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EX [A [AX [[[~ [[[p0<=1 & 1<=p0] & [[p8<=1 & 1<=p8] & [p12<=1 & 1<=p12]]]] & [p4<=1 & 1<=p4]] & [[p10<=1 & 1<=p10] & [[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]]] U AX [[AG [[p0<=1 & 1<=p0]] | [[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]]]]] & [EF [AG [[p0<=1 & 1<=p0]]] & AF [AX [[[[p3<=0 & 0<=p3] | [p13<=0 & 0<=p13]] & [[[p2<=0 & 0<=p2] | [p11<=0 & 0<=p11]] & [p6<=0 & 0<=p6]]]]]]]
normalized: [EX [[~ [EG [EX [~ [[[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] | ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]]]]]] & ~ [E [EX [~ [[[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] | ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]]]] U [EX [~ [[[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] | ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]]]] & EX [~ [[[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] & [p10<=1 & 1<=p10]] & [[p4<=1 & 1<=p4] & ~ [[[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]]]]]]]]]]]] & [~ [EG [EX [~ [[[[p6<=0 & 0<=p6] & [[p11<=0 & 0<=p11] | [p2<=0 & 0<=p2]]] & [[p13<=0 & 0<=p13] | [p3<=0 & 0<=p3]]]]]]] & E [true U ~ [E [true U ~ [[p0<=1 & 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (0<=p3)
states: 128
abstracting: (p3<=0)
states: 64
abstracting: (0<=p13)
states: 128
abstracting: (p13<=0)
states: 64
abstracting: (0<=p2)
states: 128
abstracting: (p2<=0)
states: 64
abstracting: (0<=p11)
states: 128
abstracting: (p11<=0)
states: 64
abstracting: (0<=p6)
states: 128
abstracting: (p6<=0)
states: 64
.
EG iterations: 0
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.
EG iterations: 0
.-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [~ [A [[[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]] | AF [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]]] U [p0<=1 & 1<=p0]]] | [AG [[AG [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]] | [[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]]] | [A [~ [EG [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]]] U [E [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]] U [p0<=1 & 1<=p0]] | [[p0<=1 & 1<=p0] & [[p8<=1 & 1<=p8] & [p12<=1 & 1<=p12]]]]] & AF [AX [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]]]]]]
normalized: [[[~ [EG [EX [~ [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]]]]] & [~ [EG [~ [[[[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]] | E [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] U [p0<=1 & 1<=p0]]]]]] & ~ [E [~ [[[[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]] | E [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] U [p0<=1 & 1<=p0]]]] U [EG [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]] & ~ [[[[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]] | E [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]] U [p0<=1 & 1<=p0]]]]]]]]] | ~ [E [true U ~ [[[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] | ~ [E [true U ~ [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]]]]]]]]] | ~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[~ [EG [~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]] | [[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]] & ~ [[p0<=1 & 1<=p0]]]]]]]]
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
.
EG iterations: 0
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AX [[[E [E [~ [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]] U [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]] | [p7<=1 & 1<=p7]]] U [[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]] | EG [[[p0<=0 & 0<=p0] & [E [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]] U [p8<=1 & 1<=p8]] | [[p1<=0 & 0<=p1] | [p9<=0 & 0<=p9]]]]]] | [AX [[[[p7<=0 & 0<=p7] | [[p9<=0 & 0<=p9] | [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]]]] & EX [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]]]] | [EX [EX [[[p0<=1 & 1<=p0] & [[p8<=1 & 1<=p8] & [p12<=1 & 1<=p12]]]]] | [[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]]]]]]
normalized: ~ [EX [~ [[[[[[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]] | EX [EX [[[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]]]]] | ~ [EX [~ [[EX [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] | [p9<=0 & 0<=p9]] | [p7<=0 & 0<=p7]]]]]]] | [EG [[[[[p9<=0 & 0<=p9] | [p1<=0 & 0<=p1]] | E [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]] U [p8<=1 & 1<=p8]]] & [p0<=0 & 0<=p0]]] | E [E [~ [[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] U [[p7<=1 & 1<=p7] | [[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]]] U [[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]]]]]]]
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (0<=p0)
states: 128
abstracting: (p0<=0)
states: 64
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (0<=p1)
states: 128
abstracting: (p1<=0)
states: 64
abstracting: (0<=p9)
states: 128
abstracting: (p9<=0)
states: 64
.
EG iterations: 1
abstracting: (0<=p7)
states: 128
abstracting: (p7<=0)
states: 64
abstracting: (0<=p9)
states: 128
abstracting: (p9<=0)
states: 64
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
..abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
..abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
.-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [EG [EX [EG [[p6<=0 & 0<=p6]]]] & A [E [[EG [[[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]]] & ~ [EG [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]]]]] U A [A [[[p3<=1 & 1<=p3] & [p11<=1 & 1<=p11]] U [p0<=1 & 1<=p0]] U [EF [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]] | [[[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]] & [[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]]]]] U [AX [AX [EX [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]]]]] & A [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]] U [[[[[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]] | [[p0<=1 & 1<=p0] & [p4<=1 & 1<=p4]]] & ~ [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]]] | [~ [[p7<=1 & 1<=p7]] & ~ [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]]]]]]]]]
normalized: [[~ [EG [~ [[[~ [EG [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] U [~ [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]] & ~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]]] & ~ [EX [EX [~ [EX [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] U [~ [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]] & ~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]]] & ~ [EX [EX [~ [EX [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]]]]]]] U [~ [E [[~ [EG [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]] & EG [[[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]] U [~ [EG [~ [[[[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]] | E [true U [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]]]] & ~ [E [~ [[[[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]] | E [true U [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]] U [~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p11<=1 & 1<=p11] & [p3<=1 & 1<=p3]]] & ~ [[p0<=1 & 1<=p0]]]]]]] & ~ [[[[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]] | E [true U [[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]]]]]]]]] & ~ [[[~ [EG [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]] & ~ [E [~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] U [~ [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]] & ~ [[[~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & ~ [[p7<=1 & 1<=p7]]] | [~ [[[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]] & [[[p4<=1 & 1<=p4] & [p0<=1 & 1<=p0]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]]] & ~ [EX [EX [~ [EX [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]]]]]]]]]]]] & EG [EX [EG [[p6<=0 & 0<=p6]]]]]
abstracting: (0<=p6)
states: 128
abstracting: (p6<=0)
states: 64
.
EG iterations: 1
.
EG iterations: 0
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
...abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
...abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
...abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000001-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [E [EG [[[E [[[1<=p0 & p0<=1] & [p4<=1 & 1<=p4]] U [[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]]] & [p0<=1 & 1<=p0]] & [[p4<=1 & 1<=p4] & [[p6<=1 & 1<=p6] | [p7<=1 & 1<=p7]]]]] U A [[p0<=1 & 1<=p0] U A [[[p0<=1 & 1<=p0] | [[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]] U [[[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]] | [[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]]]] U [~ [E [EF [~ [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]]]] U ~ [[[p0<=1 & 1<=p0] & [p2<=1 & 1<=p2]]]]] | [[[~ [AX [[p0<=1 & 1<=p0]]] | [p6<=1 & 1<=p6]] | [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]] | [[p3<=1 & 1<=p3] & [p11<=1 & 1<=p11]]]] & [~ [[[[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]] | EF [[[p0<=1 & 1<=p0] & [[p8<=1 & 1<=p8] & [p12<=1 & 1<=p12]]]]] & A [[[p2<=1 & 1<=p2] & [p11<=1 & 1<=p11]] U [p6<=1 & 1<=p6]]]] | AX [AF [[[p3<=1 & 1<=p3] & [p13<=1 & 1<=p13]]]]]]]]
normalized: E [E [EG [[[[[p7<=1 & 1<=p7] | [p6<=1 & 1<=p6]] & [p4<=1 & 1<=p4]] & [[p0<=1 & 1<=p0] & E [[[p4<=1 & 1<=p4] & [1<=p0 & p0<=1]] U [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]] U [~ [EG [~ [[~ [EG [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]] U [~ [[[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]] | [p0<=1 & 1<=p0]]] & ~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]] U [~ [[[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]] | [p0<=1 & 1<=p0]]] & ~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]] U [~ [[~ [EG [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]] & ~ [E [~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]] U [~ [[[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]] | [p0<=1 & 1<=p0]]] & ~ [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] | [[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]]]]]]]]] & ~ [[p0<=1 & 1<=p0]]]]]]] U [[[~ [EX [EG [~ [[[p13<=1 & 1<=p13] & [p3<=1 & 1<=p3]]]]]] | ~ [[[~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [~ [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]] & ~ [[p6<=1 & 1<=p6]]]]]] & [E [true U [[[p12<=1 & 1<=p12] & [p8<=1 & 1<=p8]] & [p0<=1 & 1<=p0]]] | [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]] & [[[[p11<=1 & 1<=p11] & [p3<=1 & 1<=p3]] | [[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] | [[p6<=1 & 1<=p6] | EX [~ [[p0<=1 & 1<=p0]]]]]] | ~ [E [E [true U ~ [[[p11<=1 & 1<=p11] & [p2<=1 & 1<=p2]]]] U ~ [[[p2<=1 & 1<=p2] & [p0<=1 & 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
.abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p8)
states: 64
abstracting: (p8<=1)
states: 128
abstracting: (1<=p12)
states: 64
abstracting: (p12<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p2)
states: 64
abstracting: (p2<=1)
states: 128
abstracting: (1<=p11)
states: 64
abstracting: (p11<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p3)
states: 64
abstracting: (p3<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
.
EG iterations: 1
.abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p5)
states: 64
abstracting: (p5<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p10)
states: 64
abstracting: (p10<=1)
states: 128
abstracting: (1<=p1)
states: 64
abstracting: (p1<=1)
states: 128
abstracting: (1<=p9)
states: 64
abstracting: (p9<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p13)
states: 64
abstracting: (p13<=1)
states: 128
abstracting: (p0<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p0)
states: 64
abstracting: (p0<=1)
states: 128
abstracting: (1<=p4)
states: 64
abstracting: (p4<=1)
states: 128
abstracting: (1<=p6)
states: 64
abstracting: (p6<=1)
states: 128
abstracting: (1<=p7)
states: 64
abstracting: (p7<=1)
states: 128
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000001-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
totally nodes used: 3183 (3.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5209 12042 17251
used/not used/entry size/cache size: 14786 67094078 16 1024MB
basic ops cache: hits/miss/sum: 3095 4094 7189
used/not used/entry size/cache size: 7551 16769665 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: 786 161 947
used/not used/entry size/cache size: 161 8388447 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 67105696
1 3153
2 15
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.644sec
BK_STOP 1678299309537
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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:113 (7), effective:18 (1)
initing FirstDep: 0m 0.000sec
iterations count:25 (1), effective:2 (0)
iterations count:22 (1), effective:2 (0)
iterations count:17 (1), effective:1 (0)
iterations count:16 (1), effective:0 (0)
iterations count:17 (1), effective:1 (0)
iterations count:16 (1), effective:0 (0)
iterations count:26 (1), effective:3 (0)
iterations count:17 (1), effective:1 (0)
iterations count:16 (1), effective:0 (0)
iterations count:52 (3), effective:6 (0)
iterations count:41 (2), effective:6 (0)
iterations count:56 (3), effective:8 (0)
iterations count:53 (3), effective:9 (0)
iterations count:25 (1), effective:2 (0)
iterations count:18 (1), effective:1 (0)
iterations count:37 (2), effective:6 (0)
iterations count:46 (2), effective:8 (0)
iterations count:23 (1), effective:2 (0)
iterations count:35 (2), effective:5 (0)
iterations count:21 (1), effective:2 (0)
iterations count:35 (2), effective:5 (0)
iterations count:35 (2), effective:5 (0)
iterations count:21 (1), effective:2 (0)
iterations count:16 (1), effective:0 (0)
iterations count:16 (1), effective:0 (0)
iterations count:22 (1), effective:2 (0)
iterations count:22 (1), effective:2 (0)
iterations count:22 (1), effective:2 (0)
iterations count:16 (1), effective:0 (0)
iterations count:22 (1), effective:2 (0)
iterations count:36 (2), effective:4 (0)
iterations count:25 (1), effective:2 (0)
iterations count:28 (1), effective:3 (0)
iterations count:25 (1), effective:2 (0)
iterations count:25 (1), effective:2 (0)
iterations count:25 (1), effective:2 (0)
iterations count:21 (1), effective:2 (0)
iterations count:40 (2), effective:6 (0)
iterations count:20 (1), effective:1 (0)
iterations count:24 (1), effective:2 (0)
iterations count:31 (1), effective:4 (0)
iterations count:21 (1), effective:1 (0)
iterations count:31 (1), effective:4 (0)
iterations count:31 (1), effective:4 (0)
iterations count:16 (1), effective:0 (0)
iterations count:24 (1), effective:2 (0)
iterations count:24 (1), effective:2 (0)
iterations count:28 (1), effective:3 (0)
iterations count:22 (1), effective:2 (0)
iterations count:59 (3), effective:9 (0)
iterations count:24 (1), effective:2 (0)
iterations count:29 (1), effective:4 (0)
iterations count:29 (1), effective:4 (0)
iterations count:22 (1), effective:2 (0)
iterations count:29 (1), effective:4 (0)
iterations count:28 (1), effective:3 (0)
iterations count:17 (1), effective:1 (0)
iterations count:20 (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="CircadianClock-PT-000001"
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 CircadianClock-PT-000001, 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 r074-smll-167814399800098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 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 ;