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.r107-oct2-155272231500788.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 itstools
Input is Philosophers-PT-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231500788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.3K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 8 03:49 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.4K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 21K 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-PT-000005-CTLFireability-00
FORMULA_NAME Philosophers-PT-000005-CTLFireability-01
FORMULA_NAME Philosophers-PT-000005-CTLFireability-02
FORMULA_NAME Philosophers-PT-000005-CTLFireability-03
FORMULA_NAME Philosophers-PT-000005-CTLFireability-04
FORMULA_NAME Philosophers-PT-000005-CTLFireability-05
FORMULA_NAME Philosophers-PT-000005-CTLFireability-06
FORMULA_NAME Philosophers-PT-000005-CTLFireability-07
FORMULA_NAME Philosophers-PT-000005-CTLFireability-08
FORMULA_NAME Philosophers-PT-000005-CTLFireability-09
FORMULA_NAME Philosophers-PT-000005-CTLFireability-10
FORMULA_NAME Philosophers-PT-000005-CTLFireability-11
FORMULA_NAME Philosophers-PT-000005-CTLFireability-12
FORMULA_NAME Philosophers-PT-000005-CTLFireability-13
FORMULA_NAME Philosophers-PT-000005-CTLFireability-14
FORMULA_NAME Philosophers-PT-000005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552955755516

Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/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.201903111103/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 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,243,0.020461,4452,2,112,5,435,6,0,128,296,0


Converting to forward existential form...Done !
original formula: (AG(A(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))) U ((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))) + A((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||(!((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))) U AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !(!((E(!(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))) U (!((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||(!((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))) * !(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))))) + EG(!(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))))))))),TRUE),!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))) * (!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) * !(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))] = FALSE * [FwdG(FwdU((Init * !(!((E(!(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))) U (!((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||(!((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))) * !(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))))) + EG(!(!(EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))))))))),TRUE),!(((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/60/15
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 0/41/25
(forward)formula 0,0,0.057425,6496,1,0,34,7660,37,28,822,7230,37
FORMULA Philosophers-PT-000005-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1))) + A(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))) U (((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1))) + !((E(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))) U (!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) * !((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))) + EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))))))] = FALSE
Hit Full ! (commute/partial/dont) 10/60/15
(forward)formula 1,0,0.074835,7024,1,0,51,8940,45,44,843,9353,56
FORMULA Philosophers-PT-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!((AX(!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))) + (((!((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))&&((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))))||((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))))) + EG(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))
=> equivalent forward existential formula: ([(EY((Init * !((((!((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))&&((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))))||((((((Fork_1>=1)&&(Think_2>=1))||((Fork_5>=1)&&(Think_1>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_4>=1)&&(Think_5>=1))))))) * ((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))] != FALSE + [FwdG(Init,!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 10/60/15
(forward)formula 2,1,0.081768,7288,1,0,53,9507,53,45,932,10058,61
FORMULA Philosophers-PT-000005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((AG(AX((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))) * (((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))))&&(((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))||(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))) + AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(!(EX(!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))))) * (((((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))||(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))))&&(((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))||(((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))))),!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] = FALSE
(forward)formula 3,0,0.091703,7552,1,0,55,9905,58,47,981,10637,65
FORMULA Philosophers-PT-000005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] = FALSE
(forward)formula 4,0,0.092674,7552,1,0,55,9905,58,47,981,10637,65
FORMULA Philosophers-PT-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] = FALSE
(forward)formula 5,0,0.093528,7552,1,0,55,9905,58,47,981,10637,65
FORMULA Philosophers-PT-000005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)) + AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))) + !(A(!(((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))) U ((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))))
=> equivalent forward existential formula: [FwdG(((Init * !(!(!((E(!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))) U (!(!(((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1))))) * !(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))) + EG(!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))))))) * !((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)))),!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/42/25
Hit Full ! (commute/partial/dont) 0/42/25
(forward)formula 6,0,0.110592,7816,1,0,60,11834,68,52,1024,12715,72
FORMULA Philosophers-PT-000005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((AF((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))) * (((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1)) * AF(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1))))) + !(((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))&&((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1))))&&(((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))&&((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] != FALSE + ([((Init * !(!(((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))&&((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1))))&&(((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))&&((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))))))) * !((((((Eat_4>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_1>=1))||(Eat_5>=1))))] != FALSE + [FwdG((Init * !(!(((((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))&&((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1))))&&(((((((Catch1_1>=1)&&(Fork_1>=1))||((Catch1_2>=1)&&(Fork_2>=1)))||((Fork_5>=1)&&(Catch1_5>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Catch1_4>=1)&&(Fork_4>=1)))&&((((((Fork_5>=1)&&(Catch2_1>=1))||((Catch2_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))))))),!(((((((Think_2>=1)&&(Fork_2>=1))||((Fork_3>=1)&&(Think_3>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Fork_4>=1)&&(Think_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))))] != FALSE))
(forward)formula 7,1,0.111382,7816,1,0,60,11834,68,52,1024,12715,72
FORMULA Philosophers-PT-000005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((Think_4>=1)&&(Fork_3>=1))
=> equivalent forward existential formula: [(Init * ((Think_4>=1)&&(Fork_3>=1)))] != FALSE
(forward)formula 8,1,0.111851,7816,1,0,61,11837,69,52,1024,12715,73
FORMULA Philosophers-PT-000005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(((Fork_1>=1)&&(Think_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((Fork_1>=1)&&(Think_2>=1))))] = FALSE
(forward)formula 9,1,0.112396,7816,1,0,62,11879,76,53,1026,12731,74
FORMULA Philosophers-PT-000005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((Catch1_1>=1)&&(Fork_1>=1))
=> equivalent forward existential formula: [(Init * ((Catch1_1>=1)&&(Fork_1>=1)))] != FALSE
(forward)formula 10,0,0.112861,7816,1,0,63,11888,77,53,1026,12731,75
FORMULA Philosophers-PT-000005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(((((!(Eat_5>=1))||(((Fork_4>=1)&&(Think_4>=1))||((Fork_5>=1)&&(Catch2_1>=1)))) * AX(((Fork_4>=1)&&(Think_4>=1)))) * (((Think_1>=1)&&(Fork_1>=1))&&((Catch2_4>=1)&&(Fork_3>=1)))))
=> equivalent forward existential formula: (([(EY(Init) * !(((!(Eat_5>=1))||(((Fork_4>=1)&&(Think_4>=1))||((Fork_5>=1)&&(Catch2_1>=1))))))] = FALSE * [(EY(EY(Init)) * !(((Fork_4>=1)&&(Think_4>=1))))] = FALSE) * [(EY(Init) * !((((Think_1>=1)&&(Fork_1>=1))&&((Catch2_4>=1)&&(Fork_3>=1)))))] = FALSE)
(forward)formula 11,0,0.113892,7816,1,0,67,11938,79,55,1031,12847,76
FORMULA Philosophers-PT-000005-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG((EX((((Fork_5>=1)&&(Think_5>=1))||((Fork_5>=1)&&(Think_1>=1)))) * !(((Fork_2>=1)&&(Think_3>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(EX((((Fork_5>=1)&&(Think_5>=1))||((Fork_5>=1)&&(Think_1>=1)))) * !(((Fork_2>=1)&&(Think_3>=1)))))] != FALSE
(forward)formula 12,0,0.11884,7816,1,0,72,12300,85,58,1032,13229,79
FORMULA Philosophers-PT-000005-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AG((!(((Fork_5>=1)&&(Think_1>=1))) * EF(((Fork_3>=1)&&(Think_3>=1))))) + (AG(((((Fork_1>=1)&&(Think_2>=1))&&((Fork_5>=1)&&(Catch1_5>=1)))&&(!((Fork_2>=1)&&(Think_3>=1))))) * AF((((Eat_1>=1)||((Fork_2>=1)&&(Catch2_3>=1)))||(((Fork_3>=1)&&(Think_3>=1))&&((Catch2_4>=1)&&(Fork_3>=1)))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(TRUE U !((!(((Fork_5>=1)&&(Think_1>=1))) * E(TRUE U ((Fork_3>=1)&&(Think_3>=1))))))))),TRUE) * !(((((Fork_1>=1)&&(Think_2>=1))&&((Fork_5>=1)&&(Catch1_5>=1)))&&(!((Fork_2>=1)&&(Think_3>=1))))))] = FALSE * [FwdG((Init * !(!(E(TRUE U !((!(((Fork_5>=1)&&(Think_1>=1))) * E(TRUE U ((Fork_3>=1)&&(Think_3>=1))))))))),!((((Eat_1>=1)||((Fork_2>=1)&&(Catch2_3>=1)))||(((Fork_3>=1)&&(Think_3>=1))&&((Catch2_4>=1)&&(Fork_3>=1))))))] = FALSE)
Hit Full ! (commute/partial/dont) 10/12/15
(forward)formula 13,0,0.124486,7816,1,0,77,12904,96,63,1077,14205,89
FORMULA Philosophers-PT-000005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E(AX((((Catch1_1>=1)&&(Fork_1>=1))||(Eat_2>=1))) U (((Catch2_4>=1)&&(Fork_3>=1))||((Fork_1>=1)&&(Think_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((((Catch1_1>=1)&&(Fork_1>=1))||(Eat_2>=1)))))) * (((Catch2_4>=1)&&(Fork_3>=1))||((Fork_1>=1)&&(Think_2>=1))))] != FALSE
(forward)formula 14,1,0.129254,8080,1,0,82,13414,103,66,1080,14636,95
FORMULA Philosophers-PT-000005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !((AF(((Catch1_1>=1)&&(Fork_1>=1))) + AG(((Fork_4>=1)&&(Think_5>=1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((Catch1_1>=1)&&(Fork_1>=1))))))),TRUE) * !(((Fork_4>=1)&&(Think_5>=1))))] != FALSE
Hit Full ! (commute/partial/dont) 18/0/7
(forward)formula 15,1,0.133529,8080,1,0,89,14233,113,71,1111,15521,101
FORMULA Philosophers-PT-000005-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1552955758549

--------------------
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/ -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/ -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 19, 2019 12:35:57 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/, -smt]
Mar 19, 2019 12:35:57 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 12:35:57 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 33 ms
Mar 19, 2019 12:35:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
Mar 19, 2019 12:35:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
Mar 19, 2019 12:35:57 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
Mar 19, 2019 12:35:58 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 28 ms
Mar 19, 2019 12:35:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
Mar 19, 2019 12:35:58 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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-PT-000005"
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-3954"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000005, 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 r107-oct2-155272231500788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 ;