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-158961390000234.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-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K 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-PT-03-00
FORMULA_NAME PhilosophersDyn-PT-03-01
FORMULA_NAME PhilosophersDyn-PT-03-02
FORMULA_NAME PhilosophersDyn-PT-03-03
FORMULA_NAME PhilosophersDyn-PT-03-04
FORMULA_NAME PhilosophersDyn-PT-03-05
FORMULA_NAME PhilosophersDyn-PT-03-06
FORMULA_NAME PhilosophersDyn-PT-03-07
FORMULA_NAME PhilosophersDyn-PT-03-08
FORMULA_NAME PhilosophersDyn-PT-03-09
FORMULA_NAME PhilosophersDyn-PT-03-10
FORMULA_NAME PhilosophersDyn-PT-03-11
FORMULA_NAME PhilosophersDyn-PT-03-12
FORMULA_NAME PhilosophersDyn-PT-03-13
FORMULA_NAME PhilosophersDyn-PT-03-14
FORMULA_NAME PhilosophersDyn-PT-03-15

=== Now, execution of the tool begins

BK_START 1589795483142

[2020-05-18 09:51:24] [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 09:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 09:51:24] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-05-18 09:51:24] [INFO ] Transformed 30 places.
[2020-05-18 09:51:24] [INFO ] Transformed 84 transitions.
[2020-05-18 09:51:24] [INFO ] Parsed PT model containing 30 places and 84 transitions in 73 ms.
[2020-05-18 09:51:24] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:24] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:24] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:24] [INFO ] Reduced 5 identical enabling conditions.
[2020-05-18 09:51:24] [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 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14309 resets, run finished after 298 ms. (steps per millisecond=335 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-18 09:51:25] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 09:51:25] [INFO ] Computed 11 place invariants in 3 ms
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-05-18 09:51:25] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2020-05-18 09:51:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-18 09:51:25] [INFO ] Flatten gal took : 38 ms
FORMULA PhilosophersDyn-PT-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 09:51:25] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-18 09:51:25] [INFO ] Applying decomposition
[2020-05-18 09:51:25] [INFO ] Flatten gal took : 12 ms
[2020-05-18 09:51: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/graph7156938255115180362.txt, -o, /tmp/graph7156938255115180362.bin, -w, /tmp/graph7156938255115180362.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7156938255115180362.bin, -l, -1, -v, -w, /tmp/graph7156938255115180362.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-18 09:51:25] [INFO ] Decomposing Gal with order
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 09:51:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 09:51:25] [INFO ] Computed 11 place invariants in 3 ms
inv : Neighbourhood_1_1 + Neighbourhood_2_1 + Neighbourhood_3_1 + Outside_1 = 1
inv : WaitLeft_2 + Think_2 + HasLeft_2 + Outside_2 = 1
inv : Outside_3 + Neighbourhood_3_3 + Neighbourhood_3_2 + Neighbourhood_3_1 = 1
inv : Think_3 + Outside_3 + HasLeft_3 + WaitLeft_3 = 1
inv : Think_3 + Outside_3 + WaitRight_3 + HasRight_3 = 1
inv : Neighbourhood_1_2 - Neighbourhood_2_1 + Neighbourhood_1_3 - Neighbourhood_3_1 = 0
inv : Neighbourhood_2_3 + Neighbourhood_1_3 - Neighbourhood_3_2 - Neighbourhood_3_1 = 0
inv : WaitRight_1 + Think_1 + HasRight_1 + Outside_1 = 1
inv : Neighbourhood_2_2 + Neighbourhood_2_1 - Neighbourhood_1_3 + Neighbourhood_3_2 + Neighbourhood_3_1 + Outside_2 = 1
inv : Think_1 + HasLeft_1 + WaitLeft_1 + Outside_1 = 1
inv : HasRight_2 + Think_2 + WaitRight_2 + Outside_2 = 1
Total of 11 invariants.
[2020-05-18 09:51:25] [INFO ] Computed 11 place invariants in 6 ms
[2020-05-18 09:51:25] [INFO ] Removed a total of 51 redundant transitions.
[2020-05-18 09:51:26] [INFO ] Flatten gal took : 38 ms
[2020-05-18 09:51:26] [INFO ] Proved 30 variables to be positive in 71 ms
[2020-05-18 09:51:26] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-18 09:51:26] [INFO ] Computation of disable matrix completed :0/81 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 09:51:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-18 09:51:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 09:51:26] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2020-05-18 09:51:26] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-18 09:51:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 09:51:26] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 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 12 LTL properties
Checking formula 0 : !(((!(F(((F("((((((((((((((((((((((((((((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i1.u1.Neighbourhood_2_1<1))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&(((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<2)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Neighbourhood_2_2<1))||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&(((i1.u1.Neighbourhood_2_2<2)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&(((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<2)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i2.u2.Neighbourhood_3_2<1)))"))&&("(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))"))&&("((((((((((((((((((((((((((((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=2)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Neighbourhood_2_2>=2)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=2)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i2.u2.Neighbourhood_3_2>=1)))"))))&&(G(X("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))")))))
Formula 0 simplified : !(!F("((((((((((((((((((((((((((((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=2)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Neighbourhood_2_2>=2)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=2)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i2.u2.Neighbourhood_3_2>=1)))" & "(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))" & F"((((((((((((((((((((((((((((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i1.u1.Neighbourhood_2_1<1))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&(((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<2)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Neighbourhood_2_2<1))||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1)))&&((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1)))&&((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&(((i1.u1.Neighbourhood_2_2<2)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))||(i0.u5.Neighbourhood_1_3<1)))&&((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1)))&&(((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i2.u2.Neighbourhood_3_3<2)))&&((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_1<1)))&&((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&((((i1.u1.Neighbourhood_2_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i2.u2.Neighbourhood_3_2<1)))") & GX"(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))")
built 4 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
built 31 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_3_1_1, Leave_2_3_3, Leave_1_3_2, Leave_2_3_1, Leave_1_3_3, Leave_1_2_2, Leave_3_2_1, Leave_2_1_3, Leave_3_2_2, Leave_3_1_2, Leave_1_2_3, 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.119039,20592,1,0,2502,1351,2133,5470,942,3211,13093
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(X(((F(X("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")))U(X(F("(((((((((((((((((((((((((((((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=2)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Neighbourhood_2_2>=2)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=2)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1)))"))))||(X("(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))")))))))
Formula 1 simplified : !XGX((FX"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))" U XF"(((((((((((((((((((((((((((((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=2)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||((((i1.u1.Think_2>=1)&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Neighbourhood_2_2>=2)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i1.u1.Neighbourhood_2_1>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||((((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Think_3>=1)&&(i2.u2.Forks_3>=1))&&(i2.u2.Neighbourhood_3_3>=2)))||((((i0.u5.Neighbourhood_1_2>=1)&&(i0.u5.Forks_1>=1))&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))||((((i0.u5.Forks_1>=1)&&(i0.u5.Think_1>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u1.Think_2>=1))&&(i1.u1.Forks_2>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1)))") | X"(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=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.146311,21704,1,0,3951,1356,2152,7199,943,3310,21273
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((!(F("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")))||("(((((((((((i1.u3.HasRight_2<1)||(i1.u1.HasLeft_2<1))||(i1.u1.Neighbourhood_2_3<1))&&(((i0.u5.Neighbourhood_1_1<1)||(i0.u0.HasRight_1<1))||(i0.u5.HasLeft_1<1)))&&(((i0.u0.HasRight_1<1)||(i0.u5.Neighbourhood_1_3<1))||(i0.u5.HasLeft_1<1)))&&(((i1.u3.HasRight_2<1)||(i1.u1.Neighbourhood_2_2<1))||(i1.u1.HasLeft_2<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u4.HasRight_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u2.Neighbourhood_3_2<1))||(i2.u4.HasRight_3<1)))&&(((i0.u5.Neighbourhood_1_2<1)||(i0.u0.HasRight_1<1))||(i0.u5.HasLeft_1<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u2.Neighbourhood_3_3<1))||(i2.u4.HasRight_3<1)))&&(((i1.u3.HasRight_2<1)||(i1.u1.HasLeft_2<1))||(i1.u1.Neighbourhood_2_1<1)))")))))
Formula 2 simplified : !GX("(((((((((((i1.u3.HasRight_2<1)||(i1.u1.HasLeft_2<1))||(i1.u1.Neighbourhood_2_3<1))&&(((i0.u5.Neighbourhood_1_1<1)||(i0.u0.HasRight_1<1))||(i0.u5.HasLeft_1<1)))&&(((i0.u0.HasRight_1<1)||(i0.u5.Neighbourhood_1_3<1))||(i0.u5.HasLeft_1<1)))&&(((i1.u3.HasRight_2<1)||(i1.u1.Neighbourhood_2_2<1))||(i1.u1.HasLeft_2<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u4.HasRight_3<1))||(i2.u2.Neighbourhood_3_1<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u2.Neighbourhood_3_2<1))||(i2.u4.HasRight_3<1)))&&(((i0.u5.Neighbourhood_1_2<1)||(i0.u0.HasRight_1<1))||(i0.u5.HasLeft_1<1)))&&(((i2.u2.HasLeft_3<1)||(i2.u2.Neighbourhood_3_3<1))||(i2.u4.HasRight_3<1)))&&(((i1.u3.HasRight_2<1)||(i1.u1.HasLeft_2<1))||(i1.u1.Neighbourhood_2_1<1)))" | !F"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=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.194819,24072,1,0,7991,1453,2274,11871,949,3669,36697
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(X("(((i2.u2.Think_3>=1)||(i1.u1.Think_2>=1))||(i0.u5.Think_1>=1))")))))
Formula 3 simplified : !GXX"(((i2.u2.Think_3>=1)||(i1.u1.Think_2>=1))||(i0.u5.Think_1>=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.220124,24600,1,0,9459,1471,2282,13898,949,3756,43567
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(X(F("(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))"))))||(G(((((((((((((!((F("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))"))U("(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))")))&&("((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))"))&&("((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))||(i2.u2.Neighbourhood_3_2<1))"))&&("((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i2.u2.Neighbourhood_3_1<1))"))&&("((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))"))&&("((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))"))&&("((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1))"))&&("((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_2<1))"))&&("((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1))"))&&("((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_1<1))"))&&("((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))||(i0.u5.Neighbourhood_1_3<1))"))&&("((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1))"))&&("((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1))")))))
Formula 4 simplified : !(XXF"(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))" | G("((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1))" & "((((i0.u5.Forks_1<1)||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))||(i0.u5.Neighbourhood_1_3<1))" & "((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i1.u1.Neighbourhood_2_1<1))" & "((((i0.u5.Neighbourhood_1_2<1)||(i0.u5.Forks_1<1))||(i0.u5.Think_1<1))||(i2.u2.Neighbourhood_3_1<1))" & "((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))" & "((((i0.u5.Neighbourhood_1_2<1)||(i1.u1.Think_2<1))||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))" & "((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_1<1))||(i2.u2.Neighbourhood_3_2<1))" & "((((i1.u1.Think_2<1)||(i1.u1.Forks_2<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1))" & "((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_1<1))" & "((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i0.u5.Neighbourhood_1_3<1))||(i2.u2.Neighbourhood_3_2<1))" & "((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_1<1))" & "((((i2.u2.Think_3<1)||(i2.u2.Forks_3<1))||(i1.u1.Neighbourhood_2_3<1))||(i2.u2.Neighbourhood_3_2<1))" & !(F"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))" U "(((((((((((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_3>=1))||(((i0.u5.Neighbourhood_1_1>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i0.u0.HasRight_1>=1)&&(i0.u5.Neighbourhood_1_3>=1))&&(i0.u5.HasLeft_1>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.Neighbourhood_2_2>=1))&&(i1.u1.HasLeft_2>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u4.HasRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_2>=1))&&(i2.u4.HasRight_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.HasRight_1>=1))&&(i0.u5.HasLeft_1>=1)))||(((i2.u2.HasLeft_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.HasRight_3>=1)))||(((i1.u3.HasRight_2>=1)&&(i1.u1.HasLeft_2>=1))&&(i1.u1.Neighbourhood_2_1>=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
1 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.71307,32156,1,0,9604,1473,2386,14166,949,3758,44978
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(X((G((X(X(X("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))"))))&&("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))")))&&("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))"))))))
Formula 5 simplified : !XFX("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))" & G("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))" & XXX"(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=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
1 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.727315,32156,1,0,10432,1483,2389,15209,949,3800,48837
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((((("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))")U("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))"))&&(F("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))")))&&(!(X("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))"))))U(!(X("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))"))))))
Formula 6 simplified : !X(("(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))" & F"(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))" & !X"(((((((((((i1.u1.Neighbourhood_2_2>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Forks_2>=1))||(((i0.u0.WaitRight_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1)))||(((i0.u5.Forks_1>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_1>=1)))||(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1)))||(((i2.u2.Forks_3>=1)&&(i2.u2.Neighbourhood_3_3>=1))&&(i2.u4.WaitRight_3>=1)))||(((i1.u3.WaitRight_2>=1)&&(i2.u2.Forks_3>=1))&&(i1.u1.Neighbourhood_2_3>=1)))||(((i0.u5.Neighbourhood_1_2>=1)&&(i0.u0.WaitRight_1>=1))&&(i1.u1.Forks_2>=1)))||(((i0.u5.Forks_1>=1)&&(i1.u3.WaitRight_2>=1))&&(i1.u1.Neighbourhood_2_1>=1)))||(((i0.u5.Forks_1>=1)&&(i0.u0.WaitRight_1>=1))&&(i0.u5.Neighbourhood_1_1>=1)))") U !X"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=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.729956,32156,1,0,10432,1483,2389,15209,949,3800,48845
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(G((F("((i1.u1.WaitLeft_2>=1)&&(i1.u1.Forks_2>=1))"))U("(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1))")))))
Formula 7 simplified : !FG(F"((i1.u1.WaitLeft_2>=1)&&(i1.u1.Forks_2>=1))" U "(((i1.u1.Forks_2>=1)&&(i2.u4.WaitRight_3>=1))&&(i2.u2.Neighbourhood_3_2>=1))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 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.744641,32156,1,0,11302,1489,2433,16262,953,3860,52201
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(!(X(F(((((!(G(F(X("(((i2.u2.Outside_3<1)||(i1.u1.Outside_2<1))||(i0.u5.Outside_1<1))")))))&&("(i0.u5.Forks_1>=1)"))&&("(i2.u2.Forks_3>=1)"))&&("(i0.u5.Neighbourhood_1_3>=1)"))&&("(i1.u1.Outside_2>=1)")))))))
Formula 8 simplified : !G!XF("(i0.u5.Forks_1>=1)" & "(i0.u5.Neighbourhood_1_3>=1)" & "(i1.u1.Outside_2>=1)" & "(i2.u2.Forks_3>=1)" & !GFX"(((i2.u2.Outside_3<1)||(i1.u1.Outside_2<1))||(i0.u5.Outside_1<1))")
Computing Next relation with stutter on 45 deadlock states
6 unique states visited
0 strongly connected components in search stack
7 transitions explored
4 items max in DFS search stack
1 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.760005,32156,1,0,12049,1490,2477,17034,953,3886,55307
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F((!(F("((i1.u1.WaitLeft_2>=1)&&(i1.u1.Forks_2>=1))")))&&("((i1.u1.WaitLeft_2<1)||(i1.u1.Forks_2<1))")))))
Formula 9 simplified : !XF("((i1.u1.WaitLeft_2<1)||(i1.u1.Forks_2<1))" & !F"((i1.u1.WaitLeft_2>=1)&&(i1.u1.Forks_2>=1))")
Computing Next relation with stutter on 45 deadlock states
15 unique states visited
12 strongly connected components in search stack
15 transitions explored
15 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.808843,32156,1,0,15545,1490,2534,20540,958,3910,70417
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X(F((F(X("((((i0.u5.Forks_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i1.u1.Outside_2>=1))")))||(F("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")))))U(!(F("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")))))
Formula 10 simplified : !(XF(FX"((((i0.u5.Forks_1>=1)&&(i2.u2.Forks_3>=1))&&(i0.u5.Neighbourhood_1_3>=1))&&(i1.u1.Outside_2>=1))" | F"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))") U !F"(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")
Computing Next relation with stutter on 45 deadlock states
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
1 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.814866,32156,1,0,15892,1490,2557,20818,960,3910,71705
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F(G((("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))")U("(i1.u1.Think_2>=1)"))U((X(X("(i1.u1.Think_2>=1)")))||("((((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))&&(((i0.u5.Forks_1<1)||(i1.u3.WaitRight_2<1))||(i1.u1.Neighbourhood_2_1<1)))")))))))
Formula 11 simplified : !XFG(("(((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))" U "(i1.u1.Think_2>=1)") U ("((((i2.u2.Outside_3>=1)&&(i1.u1.Outside_2>=1))&&(i0.u5.Outside_1>=1))&&(((i0.u5.Forks_1<1)||(i1.u3.WaitRight_2<1))||(i1.u1.Neighbourhood_2_1<1)))" | XX"(i1.u1.Think_2>=1)"))
Computing Next relation with stutter on 45 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1 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.824426,32156,1,0,16374,1496,2601,21288,962,3947,73744
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 09:51:27] [WARNING] Script execution failed on command (assert (and (and (and (>= (select s0 14) 1) (>= (select s0 15) 1)) (>= (select s0 21) 1)) (= (store (store (store s0 21 (- (select s0 21) 1)) 14 (- (select s0 14) 1)) 26 (+ (select s0 26) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (and (>= (select s0 14) 1) (>= (select s0 15) 1)) (>= (select s0 21) 1)) (= (store (store (store s0 21 (- (select s0 21) 1)) 14 (- (select s0 14) 1)) 26 (+ (select s0 26) 1)) s1))")
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:502)
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 09:51:27] [INFO ] Built C files in 1214ms 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 1589795487369

--------------------
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-PT-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-PT-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-158961390000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "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 ;