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-167873951600318.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 PhilosophersDyn-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951600318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K 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 PhilosophersDyn-PT-03-ReachabilityCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679508640888

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=PhilosophersDyn-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 18:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:10:42] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-22 18:10:42] [INFO ] Transformed 30 places.
[2023-03-22 18:10:42] [INFO ] Transformed 84 transitions.
[2023-03-22 18:10:42] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 7) seen :3
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 344 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 18:10:43] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 18:10:43] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-22 18:10:43] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-22 18:10:43] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-22 18:10:43] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 18:10:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-22 18:10:43] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 18:10:43] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1043 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: PhilosophersDyn_PT_03
(NrP: 30 NrTr: 84 NrArc: 564)

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

net check time: 0m 0.000sec

init dd package: 0m 2.749sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 448 (4.5e+02) #states 325



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

checking: EF [Neighbourhood_1_1<=1]
normalized: E [true U Neighbourhood_1_1<=1]

abstracting: (Neighbourhood_1_1<=1)
states: 325
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [1<=WaitLeft_1]
normalized: E [true U 1<=WaitLeft_1]

abstracting: (1<=WaitLeft_1)
states: 133
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [HasLeft_2<=HasLeft_2]]
normalized: ~ [E [true U HasLeft_2<=HasLeft_2]]

abstracting: (HasLeft_2<=HasLeft_2)
states: 325
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [WaitRight_2<=HasLeft_1]
normalized: E [true U WaitRight_2<=HasLeft_1]

abstracting: (WaitRight_2<=HasLeft_1)
states: 215
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [Outside_1<=HasRight_3]]
normalized: E [true U ~ [Outside_1<=HasRight_3]]

abstracting: (Outside_1<=HasRight_3)
states: 286
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [56<=sum(HasRight_3, HasRight_1, HasRight_2)]
normalized: E [true U 56<=sum(HasRight_3, HasRight_1, HasRight_2)]

abstracting: (56<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EF [60<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]
normalized: E [true U 60<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]

abstracting: (60<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
-> the formula is FALSE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [[[Neighbourhood_1_3<=WaitRight_1 | 1<=WaitLeft_3] | 1<=Forks_2]]]
normalized: E [true U ~ [[[Neighbourhood_1_3<=WaitRight_1 | 1<=WaitLeft_3] | 1<=Forks_2]]]

abstracting: (1<=Forks_2)
states: 90
abstracting: (1<=WaitLeft_3)
states: 133
abstracting: (Neighbourhood_1_3<=WaitRight_1)
states: 254
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]
normalized: E [true U sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]

abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 325
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AG [[[~ [1<=WaitLeft_1] | [[[1<=Outside_1 | ~ [HasLeft_3<=HasRight_3]] & ~ [[[[WaitLeft_2<=HasRight_2 & Neighbourhood_3_2<=1] & [HasLeft_1<=Outside_1 | 1<=Neighbourhood_1_1]] | Outside_3<=1]]] | [[~ [[~ [Outside_3<=Forks_1] & [HasLeft_1<=1 & ~ [WaitLeft_3<=1]]]] & 1<=Think_3] | [[1<=Neighbourhood_1_1 | HasLeft_2<=1] | 1<=Neighbourhood_1_2]]]] | Forks_2<=1]]
normalized: ~ [E [true U ~ [[[[[[[1<=Neighbourhood_1_1 | HasLeft_2<=1] | 1<=Neighbourhood_1_2] | [~ [[[~ [WaitLeft_3<=1] & HasLeft_1<=1] & ~ [Outside_3<=Forks_1]]] & 1<=Think_3]] | [~ [[[[HasLeft_1<=Outside_1 | 1<=Neighbourhood_1_1] & [WaitLeft_2<=HasRight_2 & Neighbourhood_3_2<=1]] | Outside_3<=1]] & [~ [HasLeft_3<=HasRight_3] | 1<=Outside_1]]] | ~ [1<=WaitLeft_1]] | Forks_2<=1]]]]

abstracting: (Forks_2<=1)
states: 325
abstracting: (1<=WaitLeft_1)
states: 133
abstracting: (1<=Outside_1)
states: 47
abstracting: (HasLeft_3<=HasRight_3)
states: 286
abstracting: (Outside_3<=1)
states: 325
abstracting: (Neighbourhood_3_2<=1)
states: 325
abstracting: (WaitLeft_2<=HasRight_2)
states: 231
abstracting: (1<=Neighbourhood_1_1)
states: 6
abstracting: (HasLeft_1<=Outside_1)
states: 274
abstracting: (1<=Think_3)
states: 94
abstracting: (Outside_3<=Forks_1)
states: 292
abstracting: (HasLeft_1<=1)
states: 325
abstracting: (WaitLeft_3<=1)
states: 325
abstracting: (1<=Neighbourhood_1_2)
states: 136
abstracting: (HasLeft_2<=1)
states: 325
abstracting: (1<=Neighbourhood_1_1)
states: 6
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [[sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2) | [sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) & [~ [8<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] & ~ [sum(Forks_3, Forks_2, Forks_1)<=88]]]]] & sum(Think_1, Think_2, Think_3)<=56] | [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3) & ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]
normalized: E [true U [[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)] | [~ [[[[~ [sum(Forks_3, Forks_2, Forks_1)<=88] & ~ [8<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]] & sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2)]] & sum(Think_1, Think_2, Think_3)<=56]]]

abstracting: (sum(Think_1, Think_2, Think_3)<=56)
states: 325
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 175
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 232
abstracting: (8<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=88)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 127
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 325
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.169sec

checking: EF [[[[[[[~ [[1<=Think_1 & [1<=Neighbourhood_1_3 & 1<=HasRight_3]]] | [[HasLeft_2<=Forks_3 & [HasRight_3<=Forks_2 & HasLeft_1<=WaitRight_1]] | ~ [[Outside_3<=1 | WaitRight_3<=WaitLeft_1]]]] & [[[WaitLeft_2<=Neighbourhood_1_2 | ~ [Neighbourhood_3_1<=1]] & 1<=Neighbourhood_2_1] | Neighbourhood_2_1<=1]] | ~ [[Neighbourhood_1_3<=1 & Forks_3<=Outside_3]]] & [Neighbourhood_3_1<=0 | ~ [[[~ [[HasLeft_3<=HasRight_2 & Think_3<=Think_3]] | Outside_1<=0] | [1<=Neighbourhood_1_3 | [~ [WaitRight_1<=1] | [1<=Neighbourhood_2_1 | Outside_1<=HasRight_1]]]]]]] | [1<=WaitRight_1 | [~ [[[[[Think_3<=Neighbourhood_2_2 | 1<=WaitLeft_3] | ~ [Forks_2<=HasLeft_1]] | [[Outside_2<=0 | Forks_3<=Forks_3] & ~ [WaitLeft_3<=1]]] & ~ [[~ [Forks_2<=0] & Forks_3<=0]]]] | [~ [[[Forks_2<=1 & [1<=Neighbourhood_1_1 | Think_2<=1]] & ~ [Neighbourhood_1_1<=HasRight_1]]] & [~ [[WaitRight_1<=0 | 1<=HasLeft_1]] & [[~ [WaitLeft_3<=Neighbourhood_2_2] & 1<=Think_1] | [Forks_1<=Forks_1 & 1<=Neighbourhood_3_1]]]]]]] & [WaitRight_2<=1 & ~ [1<=Think_2]]]]
normalized: E [true U [[[[~ [[~ [[~ [Forks_2<=0] & Forks_3<=0]] & [[~ [WaitLeft_3<=1] & [Outside_2<=0 | Forks_3<=Forks_3]] | [~ [Forks_2<=HasLeft_1] | [Think_3<=Neighbourhood_2_2 | 1<=WaitLeft_3]]]]] | [[[[~ [WaitLeft_3<=Neighbourhood_2_2] & 1<=Think_1] | [Forks_1<=Forks_1 & 1<=Neighbourhood_3_1]] & ~ [[WaitRight_1<=0 | 1<=HasLeft_1]]] & ~ [[~ [Neighbourhood_1_1<=HasRight_1] & [[1<=Neighbourhood_1_1 | Think_2<=1] & Forks_2<=1]]]]] | 1<=WaitRight_1] | [[~ [[[[[1<=Neighbourhood_2_1 | Outside_1<=HasRight_1] | ~ [WaitRight_1<=1]] | 1<=Neighbourhood_1_3] | [~ [[HasLeft_3<=HasRight_2 & Think_3<=Think_3]] | Outside_1<=0]]] | Neighbourhood_3_1<=0] & [~ [[Neighbourhood_1_3<=1 & Forks_3<=Outside_3]] | [[[[~ [Neighbourhood_3_1<=1] | WaitLeft_2<=Neighbourhood_1_2] & 1<=Neighbourhood_2_1] | Neighbourhood_2_1<=1] & [[~ [[Outside_3<=1 | WaitRight_3<=WaitLeft_1]] | [[HasRight_3<=Forks_2 & HasLeft_1<=WaitRight_1] & HasLeft_2<=Forks_3]] | ~ [[[1<=Neighbourhood_1_3 & 1<=HasRight_3] & 1<=Think_1]]]]]]] & [~ [1<=Think_2] & WaitRight_2<=1]]]

abstracting: (WaitRight_2<=1)
states: 325
abstracting: (1<=Think_2)
states: 94
abstracting: (1<=Think_1)
states: 94
abstracting: (1<=HasRight_3)
states: 51
abstracting: (1<=Neighbourhood_1_3)
states: 136
abstracting: (HasLeft_2<=Forks_3)
states: 284
abstracting: (HasLeft_1<=WaitRight_1)
states: 313
abstracting: (HasRight_3<=Forks_2)
states: 278
abstracting: (WaitRight_3<=WaitLeft_1)
states: 245
abstracting: (Outside_3<=1)
states: 325
abstracting: (Neighbourhood_2_1<=1)
states: 325
abstracting: (1<=Neighbourhood_2_1)
states: 136
abstracting: (WaitLeft_2<=Neighbourhood_1_2)
states: 257
abstracting: (Neighbourhood_3_1<=1)
states: 325
abstracting: (Forks_3<=Outside_3)
states: 235
abstracting: (Neighbourhood_1_3<=1)
states: 325
abstracting: (Neighbourhood_3_1<=0)
states: 189
abstracting: (Outside_1<=0)
states: 278
abstracting: (Think_3<=Think_3)
states: 325
abstracting: (HasLeft_3<=HasRight_2)
states: 276
abstracting: (1<=Neighbourhood_1_3)
states: 136
abstracting: (WaitRight_1<=1)
states: 325
abstracting: (Outside_1<=HasRight_1)
states: 278
abstracting: (1<=Neighbourhood_2_1)
states: 136
abstracting: (1<=WaitRight_1)
states: 133
abstracting: (Forks_2<=1)
states: 325
abstracting: (Think_2<=1)
states: 325
abstracting: (1<=Neighbourhood_1_1)
states: 6
abstracting: (Neighbourhood_1_1<=HasRight_1)
states: 320
abstracting: (1<=HasLeft_1)
states: 51
abstracting: (WaitRight_1<=0)
states: 192
abstracting: (1<=Neighbourhood_3_1)
states: 136
abstracting: (Forks_1<=Forks_1)
states: 325
abstracting: (1<=Think_1)
states: 94
abstracting: (WaitLeft_3<=Neighbourhood_2_2)
states: 192
abstracting: (1<=WaitLeft_3)
states: 133
abstracting: (Think_3<=Neighbourhood_2_2)
states: 231
abstracting: (Forks_2<=HasLeft_1)
states: 245
abstracting: (Forks_3<=Forks_3)
states: 325
abstracting: (Outside_2<=0)
states: 278
abstracting: (WaitLeft_3<=1)
states: 325
abstracting: (Forks_3<=0)
states: 235
abstracting: (Forks_2<=0)
states: 235
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[[~ [37<=sum(HasRight_3, HasRight_1, HasRight_2)] & [sum(Think_1, Think_2, Think_3)<=50 & [~ [[[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) | sum(Forks_3, Forks_2, Forks_1)<=80] | [4<=sum(Forks_3, Forks_2, Forks_1) & 71<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] | sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]] | ~ [[[sum(Think_1, Think_2, Think_3)<=73 | [34<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=23]] | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=27]]]]] & [1<=sum(Think_1, Think_2, Think_3) | sum(Outside_1, Outside_2, Outside_3)<=34]] | ~ [81<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]
normalized: ~ [E [true U ~ [[~ [81<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | [[1<=sum(Think_1, Think_2, Think_3) | sum(Outside_1, Outside_2, Outside_3)<=34] & [[[~ [[[[34<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2) & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=23] | sum(Think_1, Think_2, Think_3)<=73] | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=27]] | ~ [[[[4<=sum(Forks_3, Forks_2, Forks_1) & 71<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2) | sum(Forks_3, Forks_2, Forks_1)<=80]] | sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1)]]] & sum(Think_1, Think_2, Think_3)<=50] & ~ [37<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]]]

abstracting: (37<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (sum(Think_1, Think_2, Think_3)<=50)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Forks_3, Forks_2, Forks_1))
states: 232
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=80)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 130
abstracting: (71<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
abstracting: (4<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=27)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=73)
states: 325
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=23)
states: 325
abstracting: (34<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 0
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=34)
states: 325
abstracting: (1<=sum(Think_1, Think_2, Think_3))
states: 213
abstracting: (81<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 0
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.309sec

checking: EF [[[~ [[[[~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=43 & [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3) | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]] & ~ [[~ [sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] & [sum(Think_1, Think_2, Think_3)<=80 & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6]]]] & [[[[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=22] & [sum(Forks_3, Forks_2, Forks_1)<=99 & sum(HasLeft_1, HasLeft_3, HasLeft_2)<=20]] | 67<=sum(Outside_1, Outside_2, Outside_3)] | sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] | [~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=18 & sum(Forks_3, Forks_2, Forks_1)<=32]] & [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1) | ~ [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]]] | [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1) & [~ [[~ [[[sum(Outside_1, Outside_2, Outside_3)<=11 | sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2)] | ~ [78<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]] & [[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3)] | [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=37 | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=10]] & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2)]]] & [~ [18<=sum(Outside_1, Outside_2, Outside_3)] & sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]] & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=56]]
normalized: E [true U [[[[[~ [18<=sum(Outside_1, Outside_2, Outside_3)] & sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] & ~ [[[[[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=37 | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=10] | ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3)]] & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2)] & ~ [[~ [78<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [sum(Outside_1, Outside_2, Outside_3)<=11 | sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]]] & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)] | ~ [[[[~ [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] | sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1)] & ~ [[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=18 & sum(Forks_3, Forks_2, Forks_1)<=32]]] | [[[[[sum(Forks_3, Forks_2, Forks_1)<=99 & sum(HasLeft_1, HasLeft_3, HasLeft_2)<=20] & [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=22]] | 67<=sum(Outside_1, Outside_2, Outside_3)] | sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & [~ [[[sum(Think_1, Think_2, Think_3)<=80 & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6] & ~ [sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]] & ~ [[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3) | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=43]]]]]]] & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=56]]

abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=56)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=43)
states: 325
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 130
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 127
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 325
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=80)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 313
abstracting: (67<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=22)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=20)
states: 325
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=99)
states: 325
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=32)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=18)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 265
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 175
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=11)
states: 325
abstracting: (78<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 136
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Think_1, Think_2, Think_3))
states: 265
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=10)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=37)
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 306
abstracting: (18<=sum(Outside_1, Outside_2, Outside_3))
states: 0
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.558sec

checking: EF [[[[7<=sum(Outside_1, Outside_2, Outside_3) | [[[[[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=68 & sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)] | ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)]] | 67<=sum(Think_1, Think_2, Think_3)] & 72<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Forks_3, Forks_2, Forks_1) | [[[sum(HasRight_3, HasRight_1, HasRight_2)<=45 & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=51] & [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=83 | 21<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]] | 89<=sum(HasRight_3, HasRight_1, HasRight_2)]]] | ~ [[[[~ [sum(Forks_3, Forks_2, Forks_1)<=87] & [sum(Think_1, Think_2, Think_3)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)]] | 88<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] | [[[17<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 6<=sum(Outside_1, Outside_2, Outside_3)] | [sum(Think_1, Think_2, Think_3)<=0 | 5<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]] & ~ [6<=sum(Think_1, Think_2, Think_3)]]]]]] | ~ [[[[[[sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3) & sum(Outside_1, Outside_2, Outside_3)<=72] & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=95] | sum(Forks_3, Forks_2, Forks_1)<=38] & [[[[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=49] & ~ [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=63]] | 20<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | [[[80<=sum(Think_1, Think_2, Think_3) | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=82] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=79]] & ~ [[7<=sum(Forks_3, Forks_2, Forks_1) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]] & ~ [25<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]]] | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6]]
normalized: E [true U [[~ [[~ [25<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] & [[[~ [[7<=sum(Forks_3, Forks_2, Forks_1) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]] & [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=79] & [80<=sum(Think_1, Think_2, Think_3) | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=82]]] | [[~ [sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=63] & [sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3) & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=49]] | 20<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & [[[sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3) & sum(Outside_1, Outside_2, Outside_3)<=72] & sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=95] | sum(Forks_3, Forks_2, Forks_1)<=38]]]] | [[~ [[[~ [6<=sum(Think_1, Think_2, Think_3)] & [[sum(Think_1, Think_2, Think_3)<=0 | 5<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] | [17<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | 6<=sum(Outside_1, Outside_2, Outside_3)]]] | [[[sum(Think_1, Think_2, Think_3)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3)] & ~ [sum(Forks_3, Forks_2, Forks_1)<=87]] | 88<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]] | [[[[[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=83 | 21<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] & [sum(HasRight_3, HasRight_1, HasRight_2)<=45 & sum(WaitRight_3, WaitRight_2, WaitRight_1)<=51]] | 89<=sum(HasRight_3, HasRight_1, HasRight_2)] | sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Forks_3, Forks_2, Forks_1)] | [[[~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)] | [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=68 & sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3)]] | 67<=sum(Think_1, Think_2, Think_3)] & 72<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]] | 7<=sum(Outside_1, Outside_2, Outside_3)]] | sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6]]

abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=6)
states: 325
abstracting: (7<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (72<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
abstracting: (67<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(Outside_1, Outside_2, Outside_3))
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=68)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 127
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 19
abstracting: (89<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=51)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=45)
states: 325
abstracting: (21<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=83)
states: 325
abstracting: (88<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=87)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 226
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 232
abstracting: (6<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (17<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 0
abstracting: (5<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 0
abstracting: (sum(Think_1, Think_2, Think_3)<=0)
states: 112
abstracting: (6<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=38)
states: 325
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=95)
states: 325
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=72)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=sum(Think_1, Think_2, Think_3))
states: 325
abstracting: (20<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=49)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 226
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=63)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=82)
states: 325
abstracting: (80<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=79)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 325
abstracting: (7<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (25<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 0
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.704sec

checking: EF [[[~ [[~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=15] | [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & [[sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) | 16<=sum(Think_1, Think_2, Think_3)] | [76<=sum(Forks_3, Forks_2, Forks_1) & 59<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)]]]]] & [~ [[[[sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) & [[sum(Think_1, Think_2, Think_3)<=11 & 64<=sum(HasLeft_1, HasLeft_3, HasLeft_2)] | sum(Think_1, Think_2, Think_3)<=61]] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]] & [[[~ [23<=sum(HasRight_3, HasRight_1, HasRight_2)] | ~ [70<=sum(Outside_1, Outside_2, Outside_3)]] | [[sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(HasRight_3, HasRight_1, HasRight_2)<=44] & [47<=sum(Forks_3, Forks_2, Forks_1) | sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=57]]] | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]] | [~ [[~ [[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | 29<=sum(HasRight_3, HasRight_1, HasRight_2)]] & [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3) & [[27<=sum(Forks_3, Forks_2, Forks_1) & sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)] | [sum(Forks_3, Forks_2, Forks_1)<=34 | sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)]]]]] & [[[[[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1) & 17<=sum(Forks_3, Forks_2, Forks_1)] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & [~ [sum(Outside_1, Outside_2, Outside_3)<=24] | ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=0]]] | [[~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)] | [43<=sum(Outside_1, Outside_2, Outside_3) | sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]] & ~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=13]]] & [sum(Think_1, Think_2, Think_3)<=24 | ~ [sum(HasRight_3, HasRight_1, HasRight_2)<=48]]]]]] | sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)]]
normalized: E [true U [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | [[[[[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=48] | sum(Think_1, Think_2, Think_3)<=24] & [[~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=13] & [[43<=sum(Outside_1, Outside_2, Outside_3) | sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1)] | ~ [sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1)]]] | [[~ [sum(HasRight_3, HasRight_1, HasRight_2)<=0] | ~ [sum(Outside_1, Outside_2, Outside_3)<=24]] & [[sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1) & 17<=sum(Forks_3, Forks_2, Forks_1)] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)]]]] & ~ [[[[[sum(Forks_3, Forks_2, Forks_1)<=34 | sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3)] | [27<=sum(Forks_3, Forks_2, Forks_1) & sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2)]] & sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3)] & ~ [[sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) | 29<=sum(HasRight_3, HasRight_1, HasRight_2)]]]]] | ~ [[[sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2) | [[[47<=sum(Forks_3, Forks_2, Forks_1) | sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=57] & [sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & sum(HasRight_3, HasRight_1, HasRight_2)<=44]] | [~ [70<=sum(Outside_1, Outside_2, Outside_3)] | ~ [23<=sum(HasRight_3, HasRight_1, HasRight_2)]]]] & [~ [sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)] & [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2) & [sum(Think_1, Think_2, Think_3)<=61 | [sum(Think_1, Think_2, Think_3)<=11 & 64<=sum(HasLeft_1, HasLeft_3, HasLeft_2)]]]]]]] & ~ [[[sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1) & [[76<=sum(Forks_3, Forks_2, Forks_1) & 59<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)] | [sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2) | 16<=sum(Think_1, Think_2, Think_3)]]] | ~ [sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=15]]]]]]

abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=15)
states: 325
abstracting: (16<=sum(Think_1, Think_2, Think_3))
states: 0
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 243
abstracting: (59<=sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2))
states: 0
abstracting: (76<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 265
abstracting: (64<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 0
abstracting: (sum(Think_1, Think_2, Think_3)<=11)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=61)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(HasLeft_1, HasLeft_3, HasLeft_2))
states: 136
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 271
abstracting: (23<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (70<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=44)
states: 325
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 265
abstracting: (sum(Neighbourhood_3_1, Neighbourhood_3_2, Neighbourhood_1_3, Neighbourhood_2_1, Neighbourhood_2_3, Neighbourhood_1_1, Neighbourhood_3_3, Neighbourhood_2_2, Neighbourhood_1_2)<=57)
states: 325
abstracting: (47<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 271
abstracting: (29<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 0
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(Outside_1, Outside_2, Outside_3))
states: 127
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=sum(HasRight_3, HasRight_1, HasRight_2))
states: 243
abstracting: (27<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=sum(Outside_1, Outside_2, Outside_3))
states: 169
abstracting: (sum(Forks_3, Forks_2, Forks_1)<=34)
states: 325
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitLeft_1, WaitLeft_3, WaitLeft_2))
states: 325
abstracting: (17<=sum(Forks_3, Forks_2, Forks_1))
states: 0
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=sum(Forks_3, Forks_2, Forks_1))
states: 247
abstracting: (sum(Outside_1, Outside_2, Outside_3)<=24)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=0)
states: 187
abstracting: (sum(WaitRight_3, WaitRight_2, WaitRight_1)<=sum(Forks_3, Forks_2, Forks_1))
states: 178
abstracting: (sum(WaitLeft_1, WaitLeft_3, WaitLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 235
abstracting: (43<=sum(Outside_1, Outside_2, Outside_3))
states: 0
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=13)
states: 325
abstracting: (sum(Think_1, Think_2, Think_3)<=24)
states: 325
abstracting: (sum(HasRight_3, HasRight_1, HasRight_2)<=48)
states: 325
abstracting: (sum(HasLeft_1, HasLeft_3, HasLeft_2)<=sum(WaitRight_3, WaitRight_2, WaitRight_1))
states: 313
-> the formula is TRUE

FORMULA PhilosophersDyn-PT-03-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.664sec

totally nodes used: 15703 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 43323 140313 183636
used/not used/entry size/cache size: 142984 66965880 16 1024MB
basic ops cache: hits/miss/sum: 15811 51705 67516
used/not used/entry size/cache size: 78006 16699210 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 31563 31563
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1904 5355 7259
used/not used/entry size/cache size: 5355 8383253 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 67093309
1 15408
2 146
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.567sec


BK_STOP 1679508664331

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:1658 (19), effective:60 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:602 (7), effective:13 (0)

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

iterations count:323 (3), effective:9 (0)

iterations count:1058 (12), effective:29 (0)

iterations count:1162 (13), effective:38 (0)

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

iterations count:462 (5), effective:12 (0)

iterations count:628 (7), effective:19 (0)

iterations count:816 (9), effective:23 (0)

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

iterations count:183 (2), effective:5 (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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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-167873951600318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;