Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231400680.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
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 r197-oct2-155272231400680
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.3K Feb 12 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 8 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.9K Mar 10 17:31 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 1553684493246

11:02:08.197 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
11:02:08.208 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
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.036733,4720,2,240,5,1124,6,0,253,766,0


Converting to forward existential form...Done !
original formula: AF(!(EF(!((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.103016,6436,1,0,8,7844,19,5,1380,3519,10
FORMULA Philosophers-COL-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(!(EF((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))) + E(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))) U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U (((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))] != FALSE + [(FwdU(Init,!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))) * !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 1,1,0.184003,7212,1,0,13,10887,30,8,1544,6935,16
FORMULA Philosophers-COL-000010-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))||(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))) U ((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))) + AG((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))) + !(E(TRUE U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))))))) * !(E(!(((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))) + !(E(TRUE U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))))) U (!(((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))||(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1))))) * !(((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))) + !(E(TRUE U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 2,0,2.79616,84216,1,0,85,409144,38,64,1698,626028,71
FORMULA Philosophers-COL-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(!((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1))))) + AG((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))&&(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1))))) + !(E(TRUE U !((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))))))))] != FALSE
(forward)formula 3,1,2.9145,86264,1,0,111,418243,44,89,1747,642077,99
FORMULA Philosophers-COL-000010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))||(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))||(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))||(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))))] = FALSE
(forward)formula 4,0,2.92331,86728,1,0,113,418722,46,91,1777,643085,100
FORMULA Philosophers-COL-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AG(AF(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))))))] != FALSE
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 5,0,3.19119,89632,1,0,114,434238,53,92,1898,655745,105
FORMULA Philosophers-COL-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EG(AG((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))))))] != FALSE
(forward)formula 6,0,3.22151,89896,1,0,115,434564,58,92,1907,656076,108
FORMULA Philosophers-COL-000010-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/50
(forward)formula 7,0,3.42359,94912,1,0,118,459645,66,95,1915,699031,112
FORMULA Philosophers-COL-000010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(EG(!((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 0/201/50
(forward)formula 8,0,3.47873,96232,1,0,118,466288,72,96,1982,708624,115
FORMULA Philosophers-COL-000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(AG((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))))) * E(AF(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))) U ((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(E(TRUE U !((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1))))))))),!(EG(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))) * ((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))] != FALSE
(forward)formula 9,0,3.50761,96752,1,0,122,466584,78,97,1983,709297,119
FORMULA Philosophers-COL-000010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((E(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))) U (((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))) * AX(((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))||(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))))) * (EF(!((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))))) * AF((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))))
=> equivalent forward existential formula: (([(Init * !(E(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))) U (((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&(((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))))] = FALSE * [(EY(Init) * !(((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))||(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1))))))] = FALSE) * ([(Init * !(E(TRUE U !((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))))))] = FALSE * [FwdG(Init,!((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))))] = FALSE))
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 10,1,3.61641,97808,1,0,126,472903,83,102,2003,716523,124
FORMULA Philosophers-COL-000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))) U AG(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))) * !(E(TRUE U !(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))))))] != FALSE
(forward)formula 11,0,3.64039,98072,1,0,126,472919,83,102,2003,716547,126
FORMULA Philosophers-COL-000010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(AG((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))) * EF((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(E(TRUE U !((((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1)))))))),TRUE) * (((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))] != FALSE
(forward)formula 12,0,3.6612,98336,1,0,128,473040,83,102,2003,716665,127
FORMULA Philosophers-COL-000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG(!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 13,0,3.69484,98336,1,0,128,474103,89,103,2017,717948,130
FORMULA Philosophers-COL-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF((((((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))||(!(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))&&(((((((((((think_0>=1)&&(fork_9>=1))||((think_1>=1)&&(fork_0>=1)))||((think_2>=1)&&(fork_1>=1)))||((think_3>=1)&&(fork_2>=1)))||((think_4>=1)&&(fork_3>=1)))||((think_5>=1)&&(fork_4>=1)))||((think_6>=1)&&(fork_5>=1)))||((think_7>=1)&&(fork_6>=1)))||((think_8>=1)&&(fork_7>=1)))||((think_9>=1)&&(fork_8>=1))))||(!(((((((((((fork_9>=1)&&(catch2_0>=1))||((fork_0>=1)&&(catch2_1>=1)))||((fork_1>=1)&&(catch2_2>=1)))||((fork_2>=1)&&(catch2_3>=1)))||((fork_3>=1)&&(catch2_4>=1)))||((fork_4>=1)&&(catch2_5>=1)))||((fork_5>=1)&&(catch2_6>=1)))||((fork_6>=1)&&(catch2_7>=1)))||((fork_7>=1)&&(catch2_8>=1)))||((fork_8>=1)&&(catch2_9>=1)))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/50
(forward)formula 14,1,3.85493,100448,1,0,129,486236,97,104,2049,734715,134
FORMULA Philosophers-COL-000010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))||((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))) + A((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1))) U ((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))||((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))),!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))) * (!((((((((((((think_0>=1)&&(fork_0>=1))||((think_1>=1)&&(fork_1>=1)))||((think_2>=1)&&(fork_2>=1)))||((think_3>=1)&&(fork_3>=1)))||((think_4>=1)&&(fork_4>=1)))||((think_5>=1)&&(fork_5>=1)))||((think_6>=1)&&(fork_6>=1)))||((think_7>=1)&&(fork_7>=1)))||((think_8>=1)&&(fork_8>=1)))||((think_9>=1)&&(fork_9>=1)))) * !(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))] = FALSE * [FwdG((FwdU(Init,TRUE) * !((((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))&&((((((((((((catch1_0>=1)&&(fork_0>=1))||((catch1_1>=1)&&(fork_1>=1)))||((catch1_2>=1)&&(fork_2>=1)))||((catch1_3>=1)&&(fork_3>=1)))||((catch1_4>=1)&&(fork_4>=1)))||((catch1_5>=1)&&(fork_5>=1)))||((catch1_6>=1)&&(fork_6>=1)))||((catch1_7>=1)&&(fork_7>=1)))||((catch1_8>=1)&&(fork_8>=1)))||((catch1_9>=1)&&(fork_9>=1)))||((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1)))))),!(((((((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||(eat_5>=1))||(eat_6>=1))||(eat_7>=1))||(eat_8>=1))||(eat_9>=1))))] = FALSE)
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 15,0,3.87414,100712,1,0,129,486262,99,106,2052,734905,137
FORMULA Philosophers-COL-000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1553684537314

--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 11:01:41 AM fr.lip6.move.gal.application.Application start
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]
Mar 27, 2019 11:01:41 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 11:01:41 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 27944 ms
Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 27, 2019 11:02:09 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 27, 2019 11:02:09 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 2 ms
Mar 27, 2019 11:02:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 90 ms
Mar 27, 2019 11:02:11 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 27, 2019 11:02:11 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 places.
Mar 27, 2019 11:02:11 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 transitions.
Mar 27, 2019 11:02:12 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
Mar 27, 2019 11:02:12 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms

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="itstoolsm"
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-3954"
echo " Executing tool itstoolsm"
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 r197-oct2-155272231400680"
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" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLFireability" = "UpperBounds" ] ; 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
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 ;