fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r126-tajo-158961389700012
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Philosophers-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.290 4073.00 9401.00 78.40 FFFTFFFTFTFFFFFT normal

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-158961389700012.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 Philosophers-COL-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389700012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K 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.1K 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 3.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.9K 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 Philosophers-COL-000010-CTLFireability-00
FORMULA_NAME Philosophers-COL-000010-CTLFireability-01
FORMULA_NAME Philosophers-COL-000010-CTLFireability-02
FORMULA_NAME Philosophers-COL-000010-CTLFireability-03
FORMULA_NAME Philosophers-COL-000010-CTLFireability-04
FORMULA_NAME Philosophers-COL-000010-CTLFireability-05
FORMULA_NAME Philosophers-COL-000010-CTLFireability-06
FORMULA_NAME Philosophers-COL-000010-CTLFireability-07
FORMULA_NAME Philosophers-COL-000010-CTLFireability-08
FORMULA_NAME Philosophers-COL-000010-CTLFireability-09
FORMULA_NAME Philosophers-COL-000010-CTLFireability-10
FORMULA_NAME Philosophers-COL-000010-CTLFireability-11
FORMULA_NAME Philosophers-COL-000010-CTLFireability-12
FORMULA_NAME Philosophers-COL-000010-CTLFireability-13
FORMULA_NAME Philosophers-COL-000010-CTLFireability-14
FORMULA_NAME Philosophers-COL-000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589780468696

[2020-05-18 05:41:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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 05:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:41:10] [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 05:41:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2020-05-18 05:41:11] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:41:11] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 16 ms.
[2020-05-18 05:41:11] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:11] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 10 ms.
[2020-05-18 05:41:11] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Finished random walk after 250 steps, including 2 resets, run visited all 15 properties in 19 ms. (steps per millisecond=13 )
[2020-05-18 05:41:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 33 ms
[2020-05-18 05:41:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 14 ms
FORMULA Philosophers-COL-000010-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:11] [INFO ] Applying decomposition
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 11 ms
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/graph14979224331373590756.txt, -o, /tmp/graph14979224331373590756.bin, -w, /tmp/graph14979224331373590756.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/graph14979224331373590756.bin, -l, -1, -v, -w, /tmp/graph14979224331373590756.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:11] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:11] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-18 05:41:11] [INFO ] Flatten gal took : 68 ms
[2020-05-18 05:41:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 21 ms.
[2020-05-18 05:41:11] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-18 05:41:11] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 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-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59049,0.015776,4664,60,72,414,304,121,280,86,387,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,0.110632,7804,1,0,6947,1267,432,8340,378,3100,9226
FORMULA Philosophers-COL-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))))] = FALSE
(forward)formula 1,0,0.139694,8860,1,0,9579,1289,441,10453,384,3441,12391
FORMULA Philosophers-COL-000010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))))] = FALSE
(forward)formula 2,0,0.152614,9124,1,0,9579,1289,441,10453,384,3441,12391
FORMULA Philosophers-COL-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((EG((((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1)))) * (((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))),(((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1))))] != FALSE
(forward)formula 3,1,0.192508,10708,1,0,13875,1366,606,15957,402,4514,18052
FORMULA Philosophers-COL-000010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(EG(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))))] = FALSE
(forward)formula 4,0,0.220465,12028,1,0,16442,1470,613,21914,402,5638,21595
FORMULA Philosophers-COL-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (!(E((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1))) U ((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))&&(((((((((((i2.u3.fork_9>=1)&&(u0.catch2_0>=1))||((i3.u2.fork_3>=1)&&(i3.u2.catch2_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u6.catch2_7>=1)))||((i4.u6.fork_7>=1)&&(i2.u7.catch2_8>=1)))||((u1.fork_2>=1)&&(u1.catch2_3>=1)))||((i3.u4.fork_4>=1)&&(i3.u4.catch2_5>=1)))||((i4.u5.fork_5>=1)&&(i4.u5.catch2_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u3.catch2_9>=1)))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_1>=1)&&(u1.catch2_2>=1)))))) * AG((((((((((((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,(((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))) * ((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))&&(((((((((((i2.u3.fork_9>=1)&&(u0.catch2_0>=1))||((i3.u2.fork_3>=1)&&(i3.u2.catch2_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u6.catch2_7>=1)))||((i4.u6.fork_7>=1)&&(i2.u7.catch2_8>=1)))||((u1.fork_2>=1)&&(u1.catch2_3>=1)))||((i3.u4.fork_4>=1)&&(i3.u4.catch2_5>=1)))||((i4.u5.fork_5>=1)&&(i4.u5.catch2_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u3.catch2_9>=1)))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_1>=1)&&(u1.catch2_2>=1)))))] = FALSE * [(FwdU(Init,TRUE) * !((((((((((((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1)))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))] = FALSE)
(forward)formula 5,0,0.226251,12556,1,0,16559,1485,702,22207,412,5694,21778
FORMULA Philosophers-COL-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))] = FALSE
(forward)formula 6,0,0.228232,12556,1,0,16588,1485,703,22258,412,5696,21779
FORMULA Philosophers-COL-000010-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG(E((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1))) U (((((((((((u1.think_3<1)||(u1.fork_2<1))&&((u0.think_0<1)||(i2.u3.fork_9<1)))&&((u0.think_1<1)||(u0.fork_0<1)))&&((i3.u4.think_5<1)||(i3.u4.fork_4<1)))&&((u1.think_2<1)||(u1.fork_1<1)))&&((i3.u2.think_4<1)||(i3.u2.fork_3<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_5<1)))&&((i4.u6.think_7<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i4.u6.fork_7<1)))&&((i2.u3.think_9<1)||(i2.u7.fork_8<1)))))
=> equivalent forward existential formula: [FwdG(Init,E((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1))) U (((((((((((u1.think_3<1)||(u1.fork_2<1))&&((u0.think_0<1)||(i2.u3.fork_9<1)))&&((u0.think_1<1)||(u0.fork_0<1)))&&((i3.u4.think_5<1)||(i3.u4.fork_4<1)))&&((u1.think_2<1)||(u1.fork_1<1)))&&((i3.u2.think_4<1)||(i3.u2.fork_3<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_5<1)))&&((i4.u6.think_7<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i4.u6.fork_7<1)))&&((i2.u3.think_9<1)||(i2.u7.fork_8<1)))))] != FALSE
(forward)formula 7,1,0.296316,15196,1,0,22967,1642,761,31247,418,7403,29758
FORMULA Philosophers-COL-000010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(AF((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))] = FALSE
(forward)formula 8,0,0.309355,15988,1,0,24823,1681,764,33175,418,7566,32169
FORMULA Philosophers-COL-000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF((((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))||(((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))||(((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1))))))] = FALSE
(forward)formula 9,1,0.34093,17308,1,0,28119,1700,769,35988,418,7709,35419
FORMULA Philosophers-COL-000010-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EF((AG((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))) + AG(((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))&&((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !(((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))&&((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1)))))))] != FALSE)
(forward)formula 10,0,0.3498,17836,1,0,28417,1702,826,36362,422,7742,36079
FORMULA Philosophers-COL-000010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(EF((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))) U (AG((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))) * (((((((((((((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))||(((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1))))))
=> equivalent forward existential formula: [((FwdU(Init,E(TRUE U (((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1))))) * (((((((((((((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))||((u1.think_3>=1)&&(u1.fork_2>=1)))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))||(((((((((((i4.u6.think_7<1)||(i4.u6.fork_7<1))&&((i2.u3.think_9<1)||(i2.u3.fork_9<1)))&&((i4.u5.think_6<1)||(i4.u5.fork_6<1)))&&((i2.u7.think_8<1)||(i2.u7.fork_8<1)))&&((u0.think_0<1)||(u0.fork_0<1)))&&((u0.think_1<1)||(u1.fork_1<1)))&&((u1.think_2<1)||(u1.fork_2<1)))&&((u1.think_3<1)||(i3.u2.fork_3<1)))&&((i3.u2.think_4<1)||(i3.u4.fork_4<1)))&&((i3.u4.think_5<1)||(i4.u5.fork_5<1))))) * !(E(TRUE U !((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1)))))))] != FALSE
(forward)formula 11,0,0.352163,17836,1,0,28417,1702,826,36362,422,7742,36079
FORMULA Philosophers-COL-000010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((((((((((((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))||((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))||((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1)))))] = FALSE
(forward)formula 12,0,0.355662,17836,1,0,28417,1702,839,36362,422,7742,36079
FORMULA Philosophers-COL-000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(AF((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((((((i4.u6.think_7>=1)&&(i4.u6.fork_7>=1))||((i2.u3.think_9>=1)&&(i2.u3.fork_9>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i2.u7.fork_8>=1)))||((u0.think_0>=1)&&(u0.fork_0>=1)))||((u0.think_1>=1)&&(u1.fork_1>=1)))||((u1.think_2>=1)&&(u1.fork_2>=1)))||((u1.think_3>=1)&&(i3.u2.fork_3>=1)))||((i3.u2.think_4>=1)&&(i3.u4.fork_4>=1)))||((i3.u4.think_5>=1)&&(i4.u5.fork_5>=1)))))] = FALSE
(forward)formula 13,0,0.361526,17836,1,0,28974,1709,843,37020,422,7783,36970
FORMULA Philosophers-COL-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AG(EF((((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1))))) * EF((AG(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))) * EG((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((((((((((u1.fork_1>=1)&&(u0.catch1_1>=1))||((i4.u5.fork_5>=1)&&(i3.u4.catch1_5>=1)))||((i2.u3.fork_9>=1)&&(i2.u3.catch1_9>=1)))||((i3.u2.fork_3>=1)&&(u1.catch1_3>=1)))||((i4.u6.fork_7>=1)&&(i4.u6.catch1_7>=1)))||((u0.fork_0>=1)&&(u0.catch1_0>=1)))||((u1.fork_2>=1)&&(u1.catch1_2>=1)))||((i3.u4.fork_4>=1)&&(i3.u2.catch1_4>=1)))||((i4.u5.fork_6>=1)&&(i4.u5.catch1_6>=1)))||((i2.u7.fork_8>=1)&&(i2.u7.catch1_8>=1))))))] = FALSE * [(Init * !(E(TRUE U (!(E(TRUE U !(((((((((((i2.u3.eat_9>=1)||(i2.u7.eat_8>=1))||(u0.eat_1>=1))||(u0.eat_0>=1))||(u1.eat_3>=1))||(u1.eat_2>=1))||(i3.u4.eat_5>=1))||(i3.u2.eat_4>=1))||(i4.u6.eat_7>=1))||(i4.u5.eat_6>=1))))) * EG((((((((((((u1.think_3>=1)&&(u1.fork_2>=1))||((u0.think_0>=1)&&(i2.u3.fork_9>=1)))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((i3.u4.think_5>=1)&&(i3.u4.fork_4>=1)))||((u1.think_2>=1)&&(u1.fork_1>=1)))||((i3.u2.think_4>=1)&&(i3.u2.fork_3>=1)))||((i4.u5.think_6>=1)&&(i4.u5.fork_5>=1)))||((i4.u6.think_7>=1)&&(i4.u5.fork_6>=1)))||((i2.u7.think_8>=1)&&(i4.u6.fork_7>=1)))||((i2.u3.think_9>=1)&&(i2.u7.fork_8>=1))))))))] = FALSE)
(forward)formula 14,0,0.36885,18100,1,0,29428,1710,847,37713,422,7870,37602
FORMULA Philosophers-COL-000010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1589780472769

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Philosophers-COL-000010"
export BK_EXAMINATION="CTLFireability"
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 Philosophers-COL-000010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961389700012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;