Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390000194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390000194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 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-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1589791757832

[2020-05-18 08:49:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 08:49:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 08:49:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 08:49:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 918 ms
[2020-05-18 08:49:21] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-05-18 08:49:21] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 55 ms.
[2020-05-18 08:49:21] [INFO ] Computed order based on color domains.
[2020-05-18 08:49:21] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 17 ms.
[2020-05-18 08:49:21] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 08:49:21] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 102 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14355 resets, run finished after 473 ms. (steps per millisecond=211 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-05-18 08:49:22] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 08:49:22] [INFO ] Computed 11 place invariants in 10 ms
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 53 ms returned sat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 18 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 31 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 39 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned unsat
[2020-05-18 08:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 36 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 68 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 69 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-18 08:49:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-05-18 08:49:23] [INFO ] [Real]Added 36 Read/Feed constraints in 24 ms returned sat
[2020-05-18 08:49:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2020-05-18 08:49:23] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 11 ms.
[2020-05-18 08:49:23] [INFO ] Added : 29 causal constraints over 6 iterations in 103 ms. Result :sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Real]Added 36 Read/Feed constraints in 46 ms returned sat
[2020-05-18 08:49:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-18 08:49:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2020-05-18 08:49:24] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2020-05-18 08:49:24] [INFO ] Added : 30 causal constraints over 7 iterations in 102 ms. Result :sat
[2020-05-18 08:49:24] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 27 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:24] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Real]Added 36 Read/Feed constraints in 11 ms returned sat
[2020-05-18 08:49:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 68 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 19 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:24] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2020-05-18 08:49:24] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-05-18 08:49:24] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 7 ms.
[2020-05-18 08:49:24] [INFO ] Added : 45 causal constraints over 9 iterations in 237 ms. Result :sat
Successfully simplified 31 atomic propositions for a total of 31 simplifications.
[2020-05-18 08:49:25] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-18 08:49:25] [INFO ] Flatten gal took : 100 ms
FORMULA PhilosophersDyn-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 08:49:25] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 08:49:25] [INFO ] Applying decomposition
[2020-05-18 08:49:25] [INFO ] Flatten gal took : 24 ms
[2020-05-18 08:49:25] [INFO ] Input system was already deterministic with 81 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph4505053344957627065.txt, -o, /tmp/graph4505053344957627065.bin, -w, /tmp/graph4505053344957627065.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 08:49:25] [INFO ] Computed 11 place invariants in 2 ms
inv : Outside_2 + Think_2 + WaitRight_2 + HasRight_2 = 1
inv : Neighbourhood_0 - Neighbourhood_4 - Neighbourhood_5 - Neighbourhood_7 - Neighbourhood_8 + Outside_0 - Outside_1 - Outside_2 = -1
inv : Outside_0 + Think_0 + WaitLeft_0 + HasLeft_0 = 1
inv : Neighbourhood_1 + Neighbourhood_4 + Neighbourhood_7 + Outside_1 = 1
inv : Outside_1 + Think_1 + WaitRight_1 + HasRight_1 = 1
inv : Outside_0 + Think_0 + WaitRight_0 + HasRight_0 = 1
inv : Neighbourhood_2 + Neighbourhood_5 + Neighbourhood_8 + Outside_2 = 1
inv : Outside_2 + Think_2 + WaitLeft_2 + HasLeft_2 = 1
inv : Outside_1 + Think_1 + WaitLeft_1 + HasLeft_1 = 1
inv : Neighbourhood_6 + Neighbourhood_7 + Neighbourhood_8 + Outside_2 = 1
inv : Neighbourhood_3 + Neighbourhood_4 + Neighbourhood_5 + Outside_1 = 1
Total of 11 invariants.
[2020-05-18 08:49:25] [INFO ] Computed 11 place invariants in 3 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4505053344957627065.bin, -l, -1, -v, -w, /tmp/graph4505053344957627065.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 08:49:25] [INFO ] Decomposing Gal with order
[2020-05-18 08:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 08:49:25] [INFO ] Removed a total of 51 redundant transitions.
[2020-05-18 08:49:25] [INFO ] Flatten gal took : 111 ms
[2020-05-18 08:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 08:49:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-18 08:49:25] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 13 LTL properties
[2020-05-18 08:49:25] [INFO ] Proved 30 variables to be positive in 424 ms
Checking formula 0 : !(((!(F(((F("((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))&&(((i2.u2.Neighbourhood_8<2)||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_0<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&(((i1.u0.Neighbourhood_0<2)||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_0<1)||(i1.u0.Neighbourhood_1<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&(((i0.u1.Neighbourhood_4<2)||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_0<1)||(i1.u0.Neighbourhood_2<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_4<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_0<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_1<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_4<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i0.u1.Neighbourhood_3<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i2.u2.Neighbourhood_7<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_3<1)||(i0.u1.Neighbourhood_4<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i2.u2.Neighbourhood_6<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_4<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))"))&&("(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))"))&&("((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1))||(((i2.u2.Neighbourhood_8>=2)&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||(((i1.u0.Neighbourhood_0>=2)&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_1>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=2)&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_2>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))"))))&&(G(X("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))))
Formula 0 simplified : !(!F("((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1))||(((i2.u2.Neighbourhood_8>=2)&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||(((i1.u0.Neighbourhood_0>=2)&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_1>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=2)&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_2>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))" & "(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))" & F"((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))&&(((i2.u2.Neighbourhood_8<2)||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_0<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&(((i1.u0.Neighbourhood_0<2)||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_0<1)||(i1.u0.Neighbourhood_1<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&(((i0.u1.Neighbourhood_4<2)||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_0<1)||(i1.u0.Neighbourhood_2<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_4<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_0<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i1.u0.Neighbourhood_1<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_4<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i0.u1.Neighbourhood_3<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i2.u2.Neighbourhood_7<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_3<1)||(i0.u1.Neighbourhood_4<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i2.u2.Neighbourhood_6<1)||(i2.u2.Neighbourhood_8<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1)))&&((((i0.u1.Neighbourhood_4<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1)))&&((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1)))") & GX"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")
[2020-05-18 08:49:26] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-18 08:49:26] [INFO ] Computation of disable matrix completed :0/81 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
built 4 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
[2020-05-18 08:49:26] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 08:49:26] [INFO ] Computing symmetric may enable matrix : 81 transitions.
built 31 ordering constraints for composite.
[2020-05-18 08:49:26] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions Leavel0r0p1, Leavel0r0p2, Leavel0r1p2, Leavel0r2p1, Leavel1r0p2, Leavel1r1p0, Leavel1r1p2, Leavel1r2p0, Leavel2r0p1, Leavel2r1p0, Leavel2r2p0, Leavel2r2p1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :39/30/12/81
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.112743,20420,1,0,2359,1049,2049,5185,746,2225,12075
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(X(((F(X("(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))")))U(X(F("(((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1))||(((i2.u2.Neighbourhood_8>=2)&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||(((i1.u0.Neighbourhood_0>=2)&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_1>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=2)&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_2>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1)))"))))||(X("(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))")))))))
Formula 1 simplified : !XGX((FX"(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))" U XF"(((((((((((((((((((((((((((((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1))||(((i2.u2.Neighbourhood_8>=2)&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||(((i1.u0.Neighbourhood_0>=2)&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_1>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=2)&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Neighbourhood_2>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Neighbourhood_5>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Neighbourhood_6>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Neighbourhood_4>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Neighbourhood_8>=1))&&(i2.u2.Think_2>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Neighbourhood_7>=1))&&(i0.u1.Think_1>=1))&&(i0.u1.Forks_1>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Neighbourhood_3>=1))&&(i1.u0.Think_0>=1))&&(i1.u0.Forks_0>=1)))||(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1)))") | X"(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))")
Computing Next relation with stutter on 45 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.137712,21532,1,0,3831,1058,2068,6876,748,2405,20064
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((!(F("(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))")))||("(((((((((((i1.u0.Neighbourhood_2<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1))&&(((i0.u1.Neighbourhood_3<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_6<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i1.u0.Neighbourhood_1<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i0.u1.Neighbourhood_5<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))")))))
Formula 2 simplified : !GX("(((((((((((i1.u0.Neighbourhood_2<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1))&&(((i0.u1.Neighbourhood_3<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_6<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i1.u0.Neighbourhood_1<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i0.u1.Neighbourhood_5<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))" | !F"(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))")
Computing Next relation with stutter on 45 deadlock states
12 unique states visited
0 strongly connected components in search stack
19 transitions explored
9 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.177459,23636,1,0,7850,1107,2169,11375,754,2689,34777
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(X("(((i1.u0.Think_0>=1)||(i0.u1.Think_1>=1))||(i2.u2.Think_2>=1))")))))
Formula 3 simplified : !GXX"(((i1.u0.Think_0>=1)||(i0.u1.Think_1>=1))||(i2.u2.Think_2>=1))"
Computing Next relation with stutter on 45 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.197858,24428,1,0,9387,1127,2176,13504,754,2798,41897
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(X(F("(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))"))))||(G(((((((((((((!((F("(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))"))U("(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))")))&&("((((i1.u0.Neighbourhood_2<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))"))&&("((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))"))&&("((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))"))&&("((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))"))&&("((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))"))&&("((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))"))&&("((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))"))&&("((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))"))&&("((((i1.u0.Neighbourhood_1<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))"))&&("((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))"))&&("((((i0.u1.Neighbourhood_3<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))"))&&("((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))")))))
Formula 4 simplified : !(XXF"(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))" | G("((((i0.u1.Neighbourhood_3<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))" & "((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))" & "((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))" & "((((i0.u1.Neighbourhood_5<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))" & "((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))" & "((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))" & "((((i1.u0.Neighbourhood_1<1)||(i0.u1.Neighbourhood_5<1))||(i0.u1.Think_1<1))||(i0.u1.Forks_1<1))" & "((((i1.u0.Neighbourhood_1<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))" & "((((i1.u0.Neighbourhood_2<1)||(i0.u1.Neighbourhood_3<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))" & "((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i1.u0.Think_0<1))||(i1.u0.Forks_0<1))" & "((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_6<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))" & "((((i1.u0.Neighbourhood_2<1)||(i2.u2.Neighbourhood_7<1))||(i2.u2.Think_2<1))||(i2.u2.Forks_2<1))" & !(F"(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))" U "(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))")))
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.656213,31844,1,0,9530,1127,2280,13766,754,2798,43252
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X((G((X(X(X("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))))&&("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))&&("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))))))
Formula 5 simplified : !XFX("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))" & G("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))" & XXX"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.6756,31844,1,0,10374,1128,2283,14834,754,2863,47159
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((((("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")U("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))&&(F("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))&&(!(X("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))))U(!(X("(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))"))))))
Formula 6 simplified : !X(("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))" & F"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))" & !X"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))") U !X"(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))")
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.679129,31844,1,0,10374,1128,2283,14834,754,2863,47166
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F(X((X("(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))"))||(F("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))))||(G("(((((((((((i2.u2.Neighbourhood_6<1)||(i1.u0.Forks_0<1))||(i2.u5.WaitRight_2<1))&&(((i0.u1.Neighbourhood_3<1)||(i1.u0.Forks_0<1))||(i0.u4.WaitRight_1<1)))&&(((i1.u0.Neighbourhood_1<1)||(i0.u1.Forks_1<1))||(i1.u3.WaitRight_0<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.Forks_2<1))||(i2.u5.WaitRight_2<1)))&&(((i0.u1.Neighbourhood_5<1)||(i2.u2.Forks_2<1))||(i0.u4.WaitRight_1<1)))&&(((i1.u0.Neighbourhood_2<1)||(i2.u2.Forks_2<1))||(i1.u3.WaitRight_0<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.Forks_1<1))||(i0.u4.WaitRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i0.u1.Forks_1<1))||(i2.u5.WaitRight_2<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.Forks_0<1))||(i1.u3.WaitRight_0<1)))")))))
Formula 7 simplified : !X(FX(X"(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1))" | F"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))") | G"(((((((((((i2.u2.Neighbourhood_6<1)||(i1.u0.Forks_0<1))||(i2.u5.WaitRight_2<1))&&(((i0.u1.Neighbourhood_3<1)||(i1.u0.Forks_0<1))||(i0.u4.WaitRight_1<1)))&&(((i1.u0.Neighbourhood_1<1)||(i0.u1.Forks_1<1))||(i1.u3.WaitRight_0<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.Forks_2<1))||(i2.u5.WaitRight_2<1)))&&(((i0.u1.Neighbourhood_5<1)||(i2.u2.Forks_2<1))||(i0.u4.WaitRight_1<1)))&&(((i1.u0.Neighbourhood_2<1)||(i2.u2.Forks_2<1))||(i1.u3.WaitRight_0<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.Forks_1<1))||(i0.u4.WaitRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i0.u1.Forks_1<1))||(i2.u5.WaitRight_2<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.Forks_0<1))||(i1.u3.WaitRight_0<1)))")
Computing Next relation with stutter on 45 deadlock states
8 unique states visited
0 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.710721,31844,1,0,11689,1142,2375,16032,755,2891,53718
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((G(!(G((F("(((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))&&(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1))))"))&&("(((((((((((((((((((((((((((((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))")))))&&(X("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))")))))
Formula 8 simplified : !F(G!G("(((((((((((((((((((((((((((((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))" & F"(((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))&&(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1))))") & X"((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))")
Computing Next relation with stutter on 45 deadlock states
21 unique states visited
8 strongly connected components in search stack
29 transitions explored
8 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.806688,31844,1,0,14832,1142,2746,19230,784,3034,75301
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((X("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))"))&&((!(F((G("(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))"))&&("(((i1.u0.Think_0>=1)||(i0.u1.Think_1>=1))||(i2.u2.Think_2>=1))"))))||("(((i1.u0.Think_0<1)&&(i0.u1.Think_1<1))&&(i2.u2.Think_2<1))")))))
Formula 9 simplified : !G(X"((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))" & ("(((i1.u0.Think_0<1)&&(i0.u1.Think_1<1))&&(i2.u2.Think_2<1))" | !F("(((i1.u0.Think_0>=1)||(i0.u1.Think_1>=1))||(i2.u2.Think_2>=1))" & G"(((((((((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1)))")))
Computing Next relation with stutter on 45 deadlock states
11 unique states visited
5 strongly connected components in search stack
13 transitions explored
7 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.831271,31844,1,0,15594,1145,2783,20321,784,3055,78975
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((F(G(!((G("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))"))U("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))")))))||(("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))")U(F(("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))")U("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))))))
Formula 10 simplified : !X(FG!(G"((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))" U "((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))") | ("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))" U F("((((i2.u2.Forks_2>=1)&&(i2.u2.WaitLeft_2>=1))||((i0.u1.Forks_1>=1)&&(i0.u1.WaitLeft_1>=1)))||((i1.u0.Forks_0>=1)&&(i1.u0.WaitLeft_0>=1)))" U "(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))")))
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.851853,31844,1,0,16527,1151,2799,21275,784,3068,83410
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(F(G(X((G(X(G((F("(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))"))&&("((((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1)))")))))&&("(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))")))))))
Formula 11 simplified : FGX("(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))" & GXG("((((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Outside_0>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Outside_2>=1)))" & F"(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))"))
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.867815,31844,1,0,16579,1151,2817,21313,784,3068,84020
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G((((((((((X(G("(((((((((((i1.u0.Neighbourhood_2<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1))&&(((i0.u1.Neighbourhood_3<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_6<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i1.u0.Neighbourhood_1<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i0.u1.Neighbourhood_5<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))")))||("(((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))"))||("(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))"))||("(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))"))||("(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))"))||("(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))"))||("(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))"))||("(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))"))||("(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))"))||("(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))")))U((F((((X("(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))"))&&("(i1.u0.Outside_0>=1)"))&&("(i0.u1.Outside_1>=1)"))&&("(i2.u2.Outside_2>=1)")))U("(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))"))))
Formula 12 simplified : !(G("(((i0.u1.Neighbourhood_3>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))" | "(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))" | "(((i0.u1.Neighbourhood_5>=1)&&(i0.u1.HasLeft_1>=1))&&(i0.u4.HasRight_1>=1))" | "(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))" | "(((i1.u0.Neighbourhood_1>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))" | "(((i1.u0.Neighbourhood_2>=1)&&(i1.u0.HasLeft_0>=1))&&(i1.u3.HasRight_0>=1))" | "(((i2.u2.Neighbourhood_6>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))" | "(((i2.u2.Neighbourhood_7>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))" | "(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.HasLeft_2>=1))&&(i2.u5.HasRight_2>=1))" | XG"(((((((((((i1.u0.Neighbourhood_2<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1))&&(((i0.u1.Neighbourhood_3<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_6<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i2.u2.Neighbourhood_8<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))&&(((i0.u1.Neighbourhood_4<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i1.u0.Neighbourhood_0<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i1.u0.Neighbourhood_1<1)||(i1.u0.HasLeft_0<1))||(i1.u3.HasRight_0<1)))&&(((i0.u1.Neighbourhood_5<1)||(i0.u1.HasLeft_1<1))||(i0.u4.HasRight_1<1)))&&(((i2.u2.Neighbourhood_7<1)||(i2.u2.HasLeft_2<1))||(i2.u5.HasRight_2<1)))") U (F("(i0.u1.Outside_1>=1)" & "(i1.u0.Outside_0>=1)" & "(i2.u2.Outside_2>=1)" & X"(((((((((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Forks_0>=1))&&(i2.u5.WaitRight_2>=1))||(((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Forks_0>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Forks_1>=1))&&(i1.u3.WaitRight_0>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Forks_2>=1))&&(i2.u5.WaitRight_2>=1)))||(((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Forks_2>=1))&&(i0.u4.WaitRight_1>=1)))||(((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Forks_2>=1))&&(i1.u3.WaitRight_0>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Forks_1>=1))&&(i0.u4.WaitRight_1>=1)))||(((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Forks_1>=1))&&(i2.u5.WaitRight_2>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Forks_0>=1))&&(i1.u3.WaitRight_0>=1)))") U "(((((((((((((((((((((((((((((i0.u1.Neighbourhood_4>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=2))||((((i0.u1.Neighbourhood_5>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i1.u0.Outside_0>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_7>=1)&&(i0.u1.Outside_1>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=2)))||((((i0.u1.Neighbourhood_3>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i0.u1.Outside_1>=1))&&(i2.u2.Forks_2>=2)))||((((i1.u0.Neighbourhood_1>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i1.u0.Neighbourhood_0>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||(((i2.u2.Neighbourhood_8>=1)&&(i2.u2.Outside_2>=1))&&(i2.u2.Forks_2>=2)))||(((i1.u0.Neighbourhood_0>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=2)))||((((i2.u2.Neighbourhood_6>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||((((i2.u2.Neighbourhood_6>=1)&&(i1.u0.Outside_0>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i2.u2.Neighbourhood_7>=1)&&(i1.u0.Outside_0>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_2>=1)&&(i2.u2.Outside_2>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_5>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=1))&&(i2.u2.Forks_2>=1)))||((((i0.u1.Neighbourhood_3>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))||(((i0.u1.Neighbourhood_4>=1)&&(i2.u2.Outside_2>=1))&&(i0.u1.Forks_1>=2)))||((((i1.u0.Neighbourhood_2>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i2.u2.Forks_2>=1)))||((((i1.u0.Neighbourhood_1>=1)&&(i0.u1.Outside_1>=1))&&(i1.u0.Forks_0>=1))&&(i0.u1.Forks_1>=1)))"))
Computing Next relation with stutter on 45 deadlock states
12 unique states visited
10 strongly connected components in search stack
13 transitions explored
10 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.79729,70736,1,0,16914,1151,3237,21695,796,3079,86267
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 08:49:31] [INFO ] Built C files in 6510ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589791772213

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961390000194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;