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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.4K Feb 12 04:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 04:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 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.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.7K 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-000005-CTLFireability-00
FORMULA_NAME Philosophers-COL-000005-CTLFireability-01
FORMULA_NAME Philosophers-COL-000005-CTLFireability-02
FORMULA_NAME Philosophers-COL-000005-CTLFireability-03
FORMULA_NAME Philosophers-COL-000005-CTLFireability-04
FORMULA_NAME Philosophers-COL-000005-CTLFireability-05
FORMULA_NAME Philosophers-COL-000005-CTLFireability-06
FORMULA_NAME Philosophers-COL-000005-CTLFireability-07
FORMULA_NAME Philosophers-COL-000005-CTLFireability-08
FORMULA_NAME Philosophers-COL-000005-CTLFireability-09
FORMULA_NAME Philosophers-COL-000005-CTLFireability-10
FORMULA_NAME Philosophers-COL-000005-CTLFireability-11
FORMULA_NAME Philosophers-COL-000005-CTLFireability-12
FORMULA_NAME Philosophers-COL-000005-CTLFireability-13
FORMULA_NAME Philosophers-COL-000005-CTLFireability-14
FORMULA_NAME Philosophers-COL-000005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552947497681

22:18:44.831 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
22:18:44.840 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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.016631,4376,2,112,5,435,6,0,128,296,0


Converting to forward existential form...Done !
original formula: (AG(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))) U ((((((think_0>=1)&&(fork_4>=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))))) + 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_0>=1)&&(fork_4>=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))))) U AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !(!((E(!(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=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_0>=1)&&(fork_4>=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)))))) * !(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))))) + EG(!(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))))))))),TRUE),!(((((((think_0>=1)&&(fork_4>=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_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_0>=1)&&(fork_4>=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))))))] = FALSE * [FwdG(FwdU((Init * !(!((E(!(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=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_0>=1)&&(fork_4>=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)))))) * !(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))))) + EG(!(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))))))))),TRUE),!(((((((think_0>=1)&&(fork_4>=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)))))] = 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/42/25
(forward)formula 0,0,0.057408,6416,1,0,34,7711,37,28,817,7271,37
FORMULA Philosophers-COL-000005-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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))) U (((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1))) + !((E(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=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)))) * !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))) + EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))))))] = FALSE
Hit Full ! (commute/partial/dont) 10/60/15
(forward)formula 1,0,0.075249,6944,1,0,51,8988,45,44,838,9390,56
FORMULA Philosophers-COL-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!((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_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))))&&((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))||((((((think_0>=1)&&(fork_4>=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)))))) + EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))
=> equivalent forward existential formula: ([(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))))&&((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))||((((((think_0>=1)&&(fork_4>=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_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))))] != FALSE + [FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 10/60/15
(forward)formula 2,1,0.082434,7208,1,0,53,9555,53,45,927,10095,61
FORMULA Philosophers-COL-000005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((AG(AX((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * (((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))&&(((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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)))))||(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) + AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(!(EX(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))))) * (((((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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)))||((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))&&(((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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)))))||(((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))),!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] = FALSE
(forward)formula 3,0,0.092479,7472,1,0,55,9953,58,47,976,10674,65
FORMULA Philosophers-COL-000005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] = FALSE
(forward)formula 4,0,0.093064,7472,1,0,55,9953,58,47,976,10674,65
FORMULA Philosophers-COL-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] = FALSE
(forward)formula 5,0,0.093605,7472,1,0,55,9953,58,47,976,10674,65
FORMULA Philosophers-COL-000005-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)) + AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) + !(A(!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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))))))
=> equivalent forward existential formula: [FwdG(((Init * !(!(!((E(!(((((((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)))) U (!(!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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)))))) + 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)))))))))) * !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))),!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/42/25
Hit Full ! (commute/partial/dont) 0/42/25
(forward)formula 6,0,0.110007,7736,1,0,60,12022,68,52,1019,12786,72
FORMULA Philosophers-COL-000005-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !((AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))) * (((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)) * AF(((((((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_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)))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))&&(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE + ([((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)))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))&&(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))))))) * !((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE + [FwdG((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)))&&((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))&&(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))&&((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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)))))] != FALSE))
(forward)formula 7,1,0.11063,7736,1,0,60,12022,68,52,1019,12786,72
FORMULA Philosophers-COL-000005-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))))] != FALSE
(forward)formula 8,1,0.111204,7736,1,0,60,12022,68,52,1019,12786,72
FORMULA Philosophers-COL-000005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((!(AF((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))) * (AX(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) + EF(((((((think_0>=1)&&(fork_4>=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)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(EG(!((((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))))) * (!(EX(!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))) + E(TRUE U ((((((think_0>=1)&&(fork_4>=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)))))))] != FALSE
(forward)formula 9,1,0.126887,8000,1,0,73,13800,72,65,1023,15737,90
FORMULA Philosophers-COL-000005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) U ((!((((((think_0>=1)&&(fork_4>=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))))||(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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_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))) + AG(!(((((((think_0>=1)&&(fork_4>=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)))))) * ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))
=> equivalent forward existential formula: ([(Init * !(E(!(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))) U ((!((((((think_0>=1)&&(fork_4>=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))))||(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=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))))))))] = FALSE * ([(FwdU((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))))),TRUE) * ((((((think_0>=1)&&(fork_4>=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))))] = FALSE * [(Init * !(((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))))] = FALSE))
(forward)formula 10,0,0.12816,8000,1,0,74,13802,72,65,1023,15739,91
FORMULA Philosophers-COL-000005-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1))
=> equivalent forward existential formula: [(Init * (((((eat_0>=1)||(eat_1>=1))||(eat_2>=1))||(eat_3>=1))||(eat_4>=1)))] != FALSE
(forward)formula 11,0,0.128696,8000,1,0,75,13802,72,65,1023,15739,92
FORMULA Philosophers-COL-000005-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((((((think_0>=1)&&(fork_4>=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))) * EF(EX((((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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)))))))
=> equivalent forward existential formula: [(EY(FwdU((Init * ((((((think_0>=1)&&(fork_4>=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)))),TRUE)) * (((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=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)))))] != FALSE
(forward)formula 12,1,0.133283,8264,1,0,77,13906,73,66,1024,15885,95
FORMULA Philosophers-COL-000005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1)))
=> equivalent forward existential formula: [(Init * ((((((fork_0>=1)&&(catch1_0>=1))||((fork_1>=1)&&(catch1_1>=1)))||((fork_2>=1)&&(catch1_2>=1)))||((fork_3>=1)&&(catch1_3>=1)))||((fork_4>=1)&&(catch1_4>=1))))] != FALSE
(forward)formula 13,0,0.13434,8264,1,0,78,13913,73,66,1024,15885,96
FORMULA Philosophers-COL-000005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!((((((((think_0>=1)&&(fork_4>=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))) + EX(((((((think_0>=1)&&(fork_4>=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)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!((((((((think_0>=1)&&(fork_4>=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))) + EX(((((((think_0>=1)&&(fork_4>=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))))))))] = FALSE
(forward)formula 14,0,0.142683,8264,1,0,86,14974,76,78,1024,18261,109
FORMULA Philosophers-COL-000005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1)))
=> equivalent forward existential formula: [(Init * ((((((catch2_0>=1)&&(fork_4>=1))||((catch2_1>=1)&&(fork_0>=1)))||((catch2_2>=1)&&(fork_1>=1)))||((catch2_3>=1)&&(fork_2>=1)))||((catch2_4>=1)&&(fork_3>=1))))] != FALSE
(forward)formula 15,0,0.143854,8264,1,0,87,14974,76,78,1024,18261,110
FORMULA Philosophers-COL-000005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1552947526104

--------------------
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 18, 2019 10:18:20 PM 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 18, 2019 10:18:20 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 18, 2019 10:18:20 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 25064 ms
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Mar 18, 2019 10:18:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 3 ms
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 8 ms
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_0 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_1 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_2 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_3 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to think_4 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_0 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_1 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_2 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_3 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to fork_4 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_0 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_1 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_2 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_3 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch1_4 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_0 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_1 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_2 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_3 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to catch2_4 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_0 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_1 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_2 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_3 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.CompositeBuilder$Partition getIndex
INFO: Could not find partition element corresponding to eat_4 in partition

Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.application.MccTranslator applyOrder
WARNING: Could not apply decomposition. Using flat GAL structure.
java.lang.ArrayIndexOutOfBoundsException: -1
at org.eclipse.emf.common.util.BasicEList.get(BasicEList.java:348)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:439)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:145)
at fr.lip6.move.gal.application.MccTranslator.applyOrder(MccTranslator.java:129)
at fr.lip6.move.gal.application.MccTranslator.flattenSpec(MccTranslator.java:156)
at fr.lip6.move.gal.application.Application.start(Application.java:218)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:40)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:137)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:107)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:400)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:498)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:595)
at org.eclipse.equinox.launcher.Main.run(Main.java:1501)
at org.eclipse.equinox.launcher.Main.main(Main.java:1474)
Mar 18, 2019 10:18:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
Mar 18, 2019 10:18:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
Mar 18, 2019 10:18:45 PM 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-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-COL-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-155272231300671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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