About the Execution of Marcie+red for Philosophers-PT-000005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5451.924 | 10157.00 | 13080.00 | 356.20 | FTTTTFTTTTTTTTTT | 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.r298-tall-167873951400190.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 Philosophers-PT-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951400190
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:23 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 Philosophers-PT-000005-ReachabilityCardinality-00
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-01
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-02
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-03
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-04
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-05
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-06
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-07
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-08
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-09
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-10
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-11
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-12
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-13
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-14
FORMULA_NAME Philosophers-PT-000005-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679478184866
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 09:43:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:43:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:43:06] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-22 09:43:06] [INFO ] Transformed 25 places.
[2023-03-22 09:43:06] [INFO ] Transformed 25 transitions.
[2023-03-22 09:43:06] [INFO ] Found NUPN structural information;
[2023-03-22 09:43:06] [INFO ] Parsed PT model containing 25 places and 25 transitions and 80 arcs in 86 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Philosophers-PT-000005-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 270 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 8) seen :2
FORMULA Philosophers-PT-000005-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-PT-000005-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 25 rows 25 cols
[2023-03-22 09:43:07] [INFO ] Computed 10 place invariants in 22 ms
[2023-03-22 09:43:07] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:1
[2023-03-22 09:43:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 09:43:07] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
FORMULA Philosophers-PT-000005-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-000005-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-000005-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-000005-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-000005-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Philosophers-PT-000005-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1418 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Philosophers_PT_000005
(NrP: 25 NrTr: 25 NrArc: 80)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.819sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 110 (1.1e+02) #states 243
starting MCC model checker
--------------------------
checking: EF [~ [[Eat_4<=1 & Think_3<=Catch2_2]]]
normalized: E [true U ~ [[Eat_4<=1 & Think_3<=Catch2_2]]]
abstracting: (Think_3<=Catch2_2)
states: 171
abstracting: (Eat_4<=1)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[~ [[1<=Fork_1 | Think_4<=Eat_4]] | 1<=Think_5]]
normalized: E [true U [~ [[1<=Fork_1 | Think_4<=Eat_4]] | 1<=Think_5]]
abstracting: (1<=Think_5)
states: 108
abstracting: (Think_4<=Eat_4)
states: 135
abstracting: (1<=Fork_1)
states: 81
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=12]
normalized: ~ [E [true U ~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=12]]]
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=12)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=62]
normalized: ~ [E [true U ~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=62]]]
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=62)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12]
normalized: ~ [E [true U ~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12]]]
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EF [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=26]
normalized: E [true U sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=26]
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=26)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [[1<=Eat_3 | [[[Catch2_1<=1 | 1<=Think_2] & 1<=Eat_5] | [[Catch2_5<=Catch2_2 | Fork_2<=1] | ~ [1<=Catch1_2]]]]]
normalized: ~ [E [true U ~ [[[[[Catch2_1<=1 | 1<=Think_2] & 1<=Eat_5] | [~ [1<=Catch1_2] | [Catch2_5<=Catch2_2 | Fork_2<=1]]] | 1<=Eat_3]]]]
abstracting: (1<=Eat_3)
states: 27
abstracting: (Fork_2<=1)
states: 243
abstracting: (Catch2_5<=Catch2_2)
states: 201
abstracting: (1<=Catch1_2)
states: 54
abstracting: (1<=Eat_5)
states: 27
abstracting: (1<=Think_2)
states: 108
abstracting: (Catch2_1<=1)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[1<=Fork_5 | [[~ [[[[[[1<=Catch2_1 | Think_2<=0] & [1<=Catch2_2 & 1<=Fork_2]] & 1<=Catch1_4] & ~ [[~ [Eat_4<=1] | [Catch1_5<=1 & 1<=Think_2]]]] | ~ [[Catch2_3<=Eat_1 | Catch1_2<=1]]]] | [~ [[~ [[1<=Think_1 | 1<=Eat_2]] | [[Catch1_5<=Catch2_5 & Catch2_5<=1] | [Eat_2<=0 | Catch2_5<=Think_4]]]] | ~ [[~ [1<=Eat_3] | [[~ [1<=Catch2_2] & [Eat_3<=1 & Fork_2<=0]] | ~ [1<=Catch2_3]]]]]] & Fork_2<=1]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [[1<=Think_1 | 1<=Eat_2]] | [[Eat_2<=0 | Catch2_5<=Think_4] | [Catch1_5<=Catch2_5 & Catch2_5<=1]]]] | ~ [[[~ [1<=Catch2_3] | [[Eat_3<=1 & Fork_2<=0] & ~ [1<=Catch2_2]]] | ~ [1<=Eat_3]]]] | ~ [[~ [[Catch2_3<=Eat_1 | Catch1_2<=1]] | [~ [[[Catch1_5<=1 & 1<=Think_2] | ~ [Eat_4<=1]]] & [[[1<=Catch2_2 & 1<=Fork_2] & [1<=Catch2_1 | Think_2<=0]] & 1<=Catch1_4]]]]] & Fork_2<=1] | 1<=Fork_5]]]]
abstracting: (1<=Fork_5)
states: 81
abstracting: (Fork_2<=1)
states: 243
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Think_2<=0)
states: 135
abstracting: (1<=Catch2_1)
states: 54
abstracting: (1<=Fork_2)
states: 81
abstracting: (1<=Catch2_2)
states: 54
abstracting: (Eat_4<=1)
states: 243
abstracting: (1<=Think_2)
states: 108
abstracting: (Catch1_5<=1)
states: 243
abstracting: (Catch1_2<=1)
states: 243
abstracting: (Catch2_3<=Eat_1)
states: 195
abstracting: (1<=Eat_3)
states: 27
abstracting: (1<=Catch2_2)
states: 54
abstracting: (Fork_2<=0)
states: 162
abstracting: (Eat_3<=1)
states: 243
abstracting: (1<=Catch2_3)
states: 54
abstracting: (Catch2_5<=1)
states: 243
abstracting: (Catch1_5<=Catch2_5)
states: 189
abstracting: (Catch2_5<=Think_4)
states: 207
abstracting: (Eat_2<=0)
states: 216
abstracting: (1<=Eat_2)
states: 27
abstracting: (1<=Think_1)
states: 108
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[[[~ [[[~ [Fork_4<=1] & [Think_4<=Fork_3 & 1<=Fork_3]] | 1<=Eat_5]] & [~ [[Catch1_5<=0 & Catch2_1<=Eat_5]] & [[Think_1<=0 | [Eat_4<=Catch1_1 & Think_1<=1]] & [~ [Fork_5<=1] & [Catch2_2<=0 | Catch2_3<=Eat_1]]]]] | [Fork_4<=Catch1_4 | ~ [[[[Catch1_4<=1 | 1<=Fork_1] & [1<=Eat_3 | Catch2_2<=0]] & ~ [[Fork_4<=Catch2_1 & 1<=Catch1_4]]]]]] | 1<=Catch2_5] & [Catch1_5<=Eat_1 & ~ [Catch1_4<=1]]]]]
normalized: E [true U ~ [[[[[~ [[[[Think_4<=Fork_3 & 1<=Fork_3] & ~ [Fork_4<=1]] | 1<=Eat_5]] & [[[[Catch2_2<=0 | Catch2_3<=Eat_1] & ~ [Fork_5<=1]] & [[Eat_4<=Catch1_1 & Think_1<=1] | Think_1<=0]] & ~ [[Catch1_5<=0 & Catch2_1<=Eat_5]]]] | [~ [[~ [[Fork_4<=Catch2_1 & 1<=Catch1_4]] & [[1<=Eat_3 | Catch2_2<=0] & [Catch1_4<=1 | 1<=Fork_1]]]] | Fork_4<=Catch1_4]] | 1<=Catch2_5] & [~ [Catch1_4<=1] & Catch1_5<=Eat_1]]]]
abstracting: (Catch1_5<=Eat_1)
states: 198
abstracting: (Catch1_4<=1)
states: 243
abstracting: (1<=Catch2_5)
states: 54
abstracting: (Fork_4<=Catch1_4)
states: 189
abstracting: (1<=Fork_1)
states: 81
abstracting: (Catch1_4<=1)
states: 243
abstracting: (Catch2_2<=0)
states: 189
abstracting: (1<=Eat_3)
states: 27
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Fork_4<=Catch2_1)
states: 180
abstracting: (Catch2_1<=Eat_5)
states: 198
abstracting: (Catch1_5<=0)
states: 189
abstracting: (Think_1<=0)
states: 135
abstracting: (Think_1<=1)
states: 243
abstracting: (Eat_4<=Catch1_1)
states: 222
abstracting: (Fork_5<=1)
states: 243
abstracting: (Catch2_3<=Eat_1)
states: 195
abstracting: (Catch2_2<=0)
states: 189
abstracting: (1<=Eat_5)
states: 27
abstracting: (Fork_4<=1)
states: 243
abstracting: (1<=Fork_3)
states: 81
abstracting: (Think_4<=Fork_3)
states: 189
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[[[~ [[[[Fork_4<=Fork_3 | Think_5<=Eat_4] | [Catch2_1<=0 & Eat_2<=Fork_5]] | Think_1<=Think_4]] | [Catch1_1<=Catch2_2 | [[~ [Catch2_2<=Catch1_4] & [Think_5<=1 & Catch1_1<=Catch2_2]] | [[Catch2_1<=Fork_5 & 1<=Catch2_3] | Think_1<=Catch2_5]]]] | [~ [Catch1_4<=Catch2_3] | [1<=Fork_3 & [[[1<=Catch2_3 & Think_5<=Think_3] & ~ [1<=Eat_1]] & Think_4<=0]]]] | Fork_1<=1]] | ~ [[[[[~ [[Catch1_4<=0 | 1<=Catch1_1]] & Catch2_3<=Catch2_1] & Catch2_4<=Eat_4] & 1<=Fork_4] | ~ [Catch1_2<=Fork_4]]]]]
normalized: E [true U [~ [[[[~ [[[[Catch2_1<=0 & Eat_2<=Fork_5] | [Fork_4<=Fork_3 | Think_5<=Eat_4]] | Think_1<=Think_4]] | [[[[Catch2_1<=Fork_5 & 1<=Catch2_3] | Think_1<=Catch2_5] | [[Think_5<=1 & Catch1_1<=Catch2_2] & ~ [Catch2_2<=Catch1_4]]] | Catch1_1<=Catch2_2]] | [[[[~ [1<=Eat_1] & [1<=Catch2_3 & Think_5<=Think_3]] & Think_4<=0] & 1<=Fork_3] | ~ [Catch1_4<=Catch2_3]]] | Fork_1<=1]] | ~ [[~ [Catch1_2<=Fork_4] | [[[~ [[Catch1_4<=0 | 1<=Catch1_1]] & Catch2_3<=Catch2_1] & Catch2_4<=Eat_4] & 1<=Fork_4]]]]]
abstracting: (1<=Fork_4)
states: 81
abstracting: (Catch2_4<=Eat_4)
states: 189
abstracting: (Catch2_3<=Catch2_1)
states: 201
abstracting: (1<=Catch1_1)
states: 54
abstracting: (Catch1_4<=0)
states: 189
abstracting: (Catch1_2<=Fork_4)
states: 207
abstracting: (Fork_1<=1)
states: 243
abstracting: (Catch1_4<=Catch2_3)
states: 189
abstracting: (1<=Fork_3)
states: 81
abstracting: (Think_4<=0)
states: 135
abstracting: (Think_5<=Think_3)
states: 183
abstracting: (1<=Catch2_3)
states: 54
abstracting: (1<=Eat_1)
states: 27
abstracting: (Catch1_1<=Catch2_2)
states: 198
abstracting: (Catch2_2<=Catch1_4)
states: 201
abstracting: (Catch1_1<=Catch2_2)
states: 198
abstracting: (Think_5<=1)
states: 243
abstracting: (Think_1<=Catch2_5)
states: 171
abstracting: (1<=Catch2_3)
states: 54
abstracting: (Catch2_1<=Fork_5)
states: 216
abstracting: (Think_1<=Think_4)
states: 183
abstracting: (Think_5<=Eat_4)
states: 153
abstracting: (Fork_4<=Fork_3)
states: 189
abstracting: (Eat_2<=Fork_5)
states: 225
abstracting: (Catch2_1<=0)
states: 189
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[~ [[~ [[~ [[74<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 53<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] | [[~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=34]] & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]] | ~ [96<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]] | [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & ~ [48<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]
normalized: E [true U ~ [[[~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & ~ [48<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | ~ [[~ [96<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] | ~ [[[[[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=34] & ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | ~ [[74<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 53<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]]]]]]
abstracting: (53<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (74<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 127
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=34)
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 243
abstracting: (96<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (48<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 112
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.177sec
checking: EF [[[Think_4<=Catch1_1 & [[[Catch1_1<=0 & [[[[Eat_5<=Fork_4 & 1<=Catch1_4] & Catch2_5<=Catch2_2] & ~ [Think_5<=Catch2_2]] & ~ [Catch1_5<=1]]] & [[[~ [Eat_2<=Think_3] | Fork_2<=Fork_2] | ~ [1<=Catch2_3]] | ~ [Fork_1<=0]]] | ~ [1<=Think_4]]] | [[[~ [1<=Think_1] | [[~ [[~ [1<=Catch2_1] | ~ [Catch2_1<=Think_2]]] & [[[1<=Catch1_2 & Catch1_1<=0] & Eat_3<=1] & [[Catch1_4<=0 & 1<=Catch1_1] | ~ [Catch2_1<=Eat_1]]]] & [[[1<=Catch2_5 | Think_4<=1] | [~ [Catch2_4<=Fork_3] | ~ [Think_1<=Think_5]]] | [[[Think_1<=0 | 1<=Catch2_5] & [Catch2_4<=Catch1_3 | Eat_5<=Eat_2]] & [[Catch2_3<=Think_2 & Catch1_1<=Eat_5] & [Eat_3<=0 | 1<=Fork_2]]]]]] | ~ [[~ [1<=Catch2_1] | [[~ [[Catch2_3<=1 & Catch2_3<=Eat_1]] & ~ [[1<=Catch2_5 & Catch1_1<=Catch2_2]]] | ~ [Catch2_2<=Catch2_3]]]]] | [[[[1<=Think_1 & [[1<=Catch1_5 & [Think_4<=Catch1_3 & Think_3<=0]] & 1<=Think_2]] & Think_3<=0] & Fork_5<=1] | 1<=Catch2_5]]]]
normalized: E [true U [[[[[[~ [[~ [Catch2_1<=Think_2] | ~ [1<=Catch2_1]]] & [[~ [Catch2_1<=Eat_1] | [Catch1_4<=0 & 1<=Catch1_1]] & [[1<=Catch1_2 & Catch1_1<=0] & Eat_3<=1]]] & [[[[Eat_3<=0 | 1<=Fork_2] & [Catch2_3<=Think_2 & Catch1_1<=Eat_5]] & [[Catch2_4<=Catch1_3 | Eat_5<=Eat_2] & [Think_1<=0 | 1<=Catch2_5]]] | [[~ [Think_1<=Think_5] | ~ [Catch2_4<=Fork_3]] | [1<=Catch2_5 | Think_4<=1]]]] | ~ [1<=Think_1]] | ~ [[[[~ [[1<=Catch2_5 & Catch1_1<=Catch2_2]] & ~ [[Catch2_3<=1 & Catch2_3<=Eat_1]]] | ~ [Catch2_2<=Catch2_3]] | ~ [1<=Catch2_1]]]] | [[[[[[[Think_4<=Catch1_3 & Think_3<=0] & 1<=Catch1_5] & 1<=Think_2] & 1<=Think_1] & Think_3<=0] & Fork_5<=1] | 1<=Catch2_5]] | [[~ [1<=Think_4] | [[~ [Fork_1<=0] | [~ [1<=Catch2_3] | [~ [Eat_2<=Think_3] | Fork_2<=Fork_2]]] & [[~ [Catch1_5<=1] & [~ [Think_5<=Catch2_2] & [[Eat_5<=Fork_4 & 1<=Catch1_4] & Catch2_5<=Catch2_2]]] & Catch1_1<=0]]] & Think_4<=Catch1_1]]]
abstracting: (Think_4<=Catch1_1)
states: 159
abstracting: (Catch1_1<=0)
states: 189
abstracting: (Catch2_5<=Catch2_2)
states: 201
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Eat_5<=Fork_4)
states: 216
abstracting: (Think_5<=Catch2_2)
states: 159
abstracting: (Catch1_5<=1)
states: 243
abstracting: (Fork_2<=Fork_2)
states: 243
abstracting: (Eat_2<=Think_3)
states: 234
abstracting: (1<=Catch2_3)
states: 54
abstracting: (Fork_1<=0)
states: 162
abstracting: (1<=Think_4)
states: 108
abstracting: (1<=Catch2_5)
states: 54
abstracting: (Fork_5<=1)
states: 243
abstracting: (Think_3<=0)
states: 135
abstracting: (1<=Think_1)
states: 108
abstracting: (1<=Think_2)
states: 108
abstracting: (1<=Catch1_5)
states: 54
abstracting: (Think_3<=0)
states: 135
abstracting: (Think_4<=Catch1_3)
states: 153
abstracting: (1<=Catch2_1)
states: 54
abstracting: (Catch2_2<=Catch2_3)
states: 207
abstracting: (Catch2_3<=Eat_1)
states: 195
abstracting: (Catch2_3<=1)
states: 243
abstracting: (Catch1_1<=Catch2_2)
states: 198
abstracting: (1<=Catch2_5)
states: 54
abstracting: (1<=Think_1)
states: 108
abstracting: (Think_4<=1)
states: 243
abstracting: (1<=Catch2_5)
states: 54
abstracting: (Catch2_4<=Fork_3)
states: 216
abstracting: (Think_1<=Think_5)
states: 171
abstracting: (1<=Catch2_5)
states: 54
abstracting: (Think_1<=0)
states: 135
abstracting: (Eat_5<=Eat_2)
states: 219
abstracting: (Catch2_4<=Catch1_3)
states: 198
abstracting: (Catch1_1<=Eat_5)
states: 189
abstracting: (Catch2_3<=Think_2)
states: 207
abstracting: (1<=Fork_2)
states: 81
abstracting: (Eat_3<=0)
states: 216
abstracting: (Eat_3<=1)
states: 243
abstracting: (Catch1_1<=0)
states: 189
abstracting: (1<=Catch1_2)
states: 54
abstracting: (1<=Catch1_1)
states: 54
abstracting: (Catch1_4<=0)
states: 189
abstracting: (Catch2_1<=Eat_1)
states: 189
abstracting: (1<=Catch2_1)
states: 54
abstracting: (Catch2_1<=Think_2)
states: 225
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | [~ [94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] | [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) & [~ [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=36 & [~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=5] | [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=66 & [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 37<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]] | [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=36]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=36] | sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | ~ [[[[[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 37<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=66] | ~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=5]] & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=36]]] & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | ~ [94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]]
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 243
abstracting: (94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 208
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=36)
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=5)
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=66)
states: 243
abstracting: (37<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 243
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=36)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.151sec
checking: EF [[[[[~ [1<=Eat_3] | [[Catch2_1<=1 & [[~ [Think_4<=Catch2_3] | [1<=Think_3 & Catch1_5<=Catch1_4]] & [Eat_5<=Catch2_4 | ~ [1<=Think_2]]]] & [Think_4<=1 & [[[Catch1_4<=Fork_4 | Fork_5<=Think_3] | [Catch1_4<=1 & 1<=Catch1_5]] & [[Catch1_5<=Catch2_2 & Catch2_4<=0] & ~ [Catch2_2<=Eat_1]]]]]] | Think_4<=Catch1_4] | ~ [Catch1_3<=Catch2_1]] | [[[[[Fork_4<=0 & [Catch2_2<=Catch1_3 | [[Fork_2<=Fork_1 | Eat_3<=Catch2_4] | [Catch2_1<=Think_4 | Think_5<=Fork_5]]]] | 1<=Catch1_4] | [[[~ [[Catch2_3<=Catch2_5 | Think_1<=0]] & [~ [Think_3<=Think_1] | Catch2_2<=Eat_3]] & [[[Fork_5<=Fork_1 | Catch2_1<=Fork_5] | [1<=Catch2_1 & 1<=Eat_1]] | [1<=Eat_2 & [Think_1<=Eat_4 & 1<=Fork_4]]]] & [[1<=Eat_1 | ~ [[Think_5<=1 & Fork_4<=0]]] & [Catch1_1<=Think_4 & [Catch2_1<=0 & [Fork_5<=Eat_2 & Catch1_5<=Fork_2]]]]]] | ~ [[~ [Eat_4<=Think_2] | ~ [1<=Catch1_4]]]] & Eat_1<=Fork_1]]]
normalized: E [true U [[[[[[[[[Catch1_4<=1 & 1<=Catch1_5] | [Catch1_4<=Fork_4 | Fork_5<=Think_3]] & [~ [Catch2_2<=Eat_1] & [Catch1_5<=Catch2_2 & Catch2_4<=0]]] & Think_4<=1] & [[[~ [1<=Think_2] | Eat_5<=Catch2_4] & [[1<=Think_3 & Catch1_5<=Catch1_4] | ~ [Think_4<=Catch2_3]]] & Catch2_1<=1]] | ~ [1<=Eat_3]] | Think_4<=Catch1_4] | ~ [Catch1_3<=Catch2_1]] | [[~ [[~ [1<=Catch1_4] | ~ [Eat_4<=Think_2]]] | [[[[[[Fork_5<=Eat_2 & Catch1_5<=Fork_2] & Catch2_1<=0] & Catch1_1<=Think_4] & [~ [[Think_5<=1 & Fork_4<=0]] | 1<=Eat_1]] & [[[[Think_1<=Eat_4 & 1<=Fork_4] & 1<=Eat_2] | [[1<=Catch2_1 & 1<=Eat_1] | [Fork_5<=Fork_1 | Catch2_1<=Fork_5]]] & [[~ [Think_3<=Think_1] | Catch2_2<=Eat_3] & ~ [[Catch2_3<=Catch2_5 | Think_1<=0]]]]] | [[[[[Catch2_1<=Think_4 | Think_5<=Fork_5] | [Fork_2<=Fork_1 | Eat_3<=Catch2_4]] | Catch2_2<=Catch1_3] & Fork_4<=0] | 1<=Catch1_4]]] & Eat_1<=Fork_1]]]
abstracting: (Eat_1<=Fork_1)
states: 216
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Fork_4<=0)
states: 162
abstracting: (Catch2_2<=Catch1_3)
states: 189
abstracting: (Eat_3<=Catch2_4)
states: 225
abstracting: (Fork_2<=Fork_1)
states: 189
abstracting: (Think_5<=Fork_5)
states: 189
abstracting: (Catch2_1<=Think_4)
states: 213
abstracting: (Think_1<=0)
states: 135
abstracting: (Catch2_3<=Catch2_5)
states: 201
abstracting: (Catch2_2<=Eat_3)
states: 189
abstracting: (Think_3<=Think_1)
states: 183
abstracting: (Catch2_1<=Fork_5)
states: 216
abstracting: (Fork_5<=Fork_1)
states: 189
abstracting: (1<=Eat_1)
states: 27
abstracting: (1<=Catch2_1)
states: 54
abstracting: (1<=Eat_2)
states: 27
abstracting: (1<=Fork_4)
states: 81
abstracting: (Think_1<=Eat_4)
states: 147
abstracting: (1<=Eat_1)
states: 27
abstracting: (Fork_4<=0)
states: 162
abstracting: (Think_5<=1)
states: 243
abstracting: (Catch1_1<=Think_4)
states: 213
abstracting: (Catch2_1<=0)
states: 189
abstracting: (Catch1_5<=Fork_2)
states: 207
abstracting: (Fork_5<=Eat_2)
states: 171
abstracting: (Eat_4<=Think_2)
states: 228
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Catch1_3<=Catch2_1)
states: 201
abstracting: (Think_4<=Catch1_4)
states: 135
abstracting: (1<=Eat_3)
states: 27
abstracting: (Catch2_1<=1)
states: 243
abstracting: (Think_4<=Catch2_3)
states: 171
abstracting: (Catch1_5<=Catch1_4)
states: 207
abstracting: (1<=Think_3)
states: 108
abstracting: (Eat_5<=Catch2_4)
states: 216
abstracting: (1<=Think_2)
states: 108
abstracting: (Think_4<=1)
states: 243
abstracting: (Catch2_4<=0)
states: 189
abstracting: (Catch1_5<=Catch2_2)
states: 201
abstracting: (Catch2_2<=Eat_1)
states: 198
abstracting: (Fork_5<=Think_3)
states: 198
abstracting: (Catch1_4<=Fork_4)
states: 216
abstracting: (1<=Catch1_5)
states: 54
abstracting: (Catch1_4<=1)
states: 243
-> the formula is TRUE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[[[~ [[[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=29 | [~ [46<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=91]] & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] & [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | [[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | ~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=42]] | ~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]] & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=99] | [[[[[~ [[52<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=40]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | [~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29 | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]] & [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=14] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] | ~ [[[~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & 29<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] & [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=18] | [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=93 & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=95] & [~ [41<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] | ~ [[[[~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=43] | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & 50<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | [~ [27<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & ~ [6<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]]]]]
normalized: E [true U ~ [[[[~ [[[~ [27<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & ~ [6<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | [[~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=43] | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & 50<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] | ~ [41<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & [[~ [[[[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=93 & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=18]] & [~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & 29<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] | [[[[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=14] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] & ~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29 | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] | [~ [[52<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=40]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=95]] | [[[[~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=42] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & ~ [[[[~ [46<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=91] | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=29] & sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]] & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=99]]]]
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=99)
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=29)
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=91)
states: 243
abstracting: (46<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 127
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=42)
states: 243
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=95)
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=40)
states: 243
abstracting: (52<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 208
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29)
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=14)
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
abstracting: (29<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 147
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=18)
states: 243
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 77
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=93)
states: 243
abstracting: (41<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (50<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=43)
states: 243
abstracting: (6<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (27<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
-> the formula is FALSE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.520sec
checking: EF [[[[~ [[[~ [[[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=54 | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] | [[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=47 & ~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] & [[73<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 29<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | ~ [37<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]] & [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) | ~ [[100<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] | [[90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & [36<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] | 46<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]] & ~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=10]] & [~ [[[[[sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=3 | 21<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | 95<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] & 34<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] & [[[~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] | ~ [44<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] & ~ [[46<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=34]]] & ~ [[[86<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2] & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]] & [[~ [[~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] | ~ [[~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & [42<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | 9<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]]] & [~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & 94<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]] & [~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12 & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]] | ~ [[[[~ [[90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2]] & [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | 89<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]] & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] & ~ [[~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29 | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=89]] & ~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]]]]
normalized: E [true U [[~ [[~ [[~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29 | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=89]] & ~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] & [[[~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | 89<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] & ~ [[90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2]]] & sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] | ~ [[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12 & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]] & [[[[~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & 94<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & [~ [[[[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | 9<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] & 42<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & ~ [sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]] | ~ [[~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)]]]] & ~ [[[~ [[[86<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2] & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] & [~ [[46<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=34]] & [~ [44<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] | ~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]] & [[[sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) | 95<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] | [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=3 | 21<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] & 34<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]] & [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=10] & ~ [[[[[[36<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) & sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] & 90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | 46<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | [~ [[100<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1) | sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] & [[[~ [37<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | [73<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) & 29<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] & [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=47]] | ~ [[[sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1) | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)] | [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=54 | sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]]]]]]]
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=54)
states: 243
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 182
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=47)
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
abstracting: (29<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (73<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (37<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 188
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
abstracting: (100<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (46<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (36<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=10)
states: 243
abstracting: (34<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (21<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=3)
states: 237
abstracting: (95<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 32
abstracting: (44<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=34)
states: 243
abstracting: (46<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 147
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2)
states: 217
abstracting: (86<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 77
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 243
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 243
abstracting: (42<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (9<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 123
abstracting: (94<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 207
abstracting: (sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=12)
states: 243
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=2)
states: 217
abstracting: (90<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (89<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 208
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 188
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=89)
states: 243
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=29)
states: 243
-> the formula is FALSE
FORMULA Philosophers-PT-000005-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.655sec
totally nodes used: 8482 (8.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4158 13290 17448
used/not used/entry size/cache size: 14789 67094075 16 1024MB
basic ops cache: hits/miss/sum: 5394 21285 26679
used/not used/entry size/cache size: 37483 16739733 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 19158 19158
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1368 3763 5131
used/not used/entry size/cache size: 3763 8384845 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 67100425
1 8396
2 43
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.372sec
BK_STOP 1679478195023
--------------------
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 ReachabilityCardinality -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:108 (4), effective:15 (0)
initing FirstDep: 0m 0.000sec
iterations count:159 (6), effective:19 (0)
iterations count:129 (5), effective:15 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:97 (3), effective:10 (0)
iterations count:110 (4), effective:18 (0)
iterations count:53 (2), effective:6 (0)
iterations count:34 (1), effective:2 (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="Philosophers-PT-000005"
export BK_EXAMINATION="ReachabilityCardinality"
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 Philosophers-PT-000005, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873951400190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;