Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389800116.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389800116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 41K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000010-CTLFireability-00
FORMULA_NAME Philosophers-PT-000010-CTLFireability-01
FORMULA_NAME Philosophers-PT-000010-CTLFireability-02
FORMULA_NAME Philosophers-PT-000010-CTLFireability-03
FORMULA_NAME Philosophers-PT-000010-CTLFireability-04
FORMULA_NAME Philosophers-PT-000010-CTLFireability-05
FORMULA_NAME Philosophers-PT-000010-CTLFireability-06
FORMULA_NAME Philosophers-PT-000010-CTLFireability-07
FORMULA_NAME Philosophers-PT-000010-CTLFireability-08
FORMULA_NAME Philosophers-PT-000010-CTLFireability-09
FORMULA_NAME Philosophers-PT-000010-CTLFireability-10
FORMULA_NAME Philosophers-PT-000010-CTLFireability-11
FORMULA_NAME Philosophers-PT-000010-CTLFireability-12
FORMULA_NAME Philosophers-PT-000010-CTLFireability-13
FORMULA_NAME Philosophers-PT-000010-CTLFireability-14
FORMULA_NAME Philosophers-PT-000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589786636085

[2020-05-18 07:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 07:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:23:58] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-05-18 07:23:58] [INFO ] Transformed 50 places.
[2020-05-18 07:23:58] [INFO ] Transformed 50 transitions.
[2020-05-18 07:23:58] [INFO ] Parsed PT model containing 50 places and 50 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Finished random walk after 67 steps, including 1 resets, run visited all 31 properties in 5 ms. (steps per millisecond=13 )
[2020-05-18 07:23:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 07:23:58] [INFO ] Flatten gal took : 31 ms
[2020-05-18 07:23:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-18 07:23:58] [INFO ] Flatten gal took : 11 ms
FORMULA Philosophers-PT-000010-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:23:58] [INFO ] Applying decomposition
[2020-05-18 07:23:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16765409617343200542.txt, -o, /tmp/graph16765409617343200542.bin, -w, /tmp/graph16765409617343200542.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16765409617343200542.bin, -l, -1, -v, -w, /tmp/graph16765409617343200542.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:23:59] [INFO ] Decomposing Gal with order
[2020-05-18 07:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 07:23:59] [INFO ] Removed a total of 10 redundant transitions.
[2020-05-18 07:23:59] [INFO ] Flatten gal took : 31 ms
[2020-05-18 07:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2020-05-18 07:23:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-18 07:23:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59049,0.015927,4556,60,29,370,150,118,274,53,240,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,0.07009,7436,1,0,6740,383,437,7495,204,905,8845
FORMULA Philosophers-PT-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1))))] = FALSE
(forward)formula 1,0,0.083401,8228,1,0,9010,390,445,9217,210,1009,11802
FORMULA Philosophers-PT-000010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1))))] = FALSE
(forward)formula 2,0,0.084661,8492,1,0,9010,390,445,9217,210,1009,11802
FORMULA Philosophers-PT-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EG((((((((((((i1.u8.Think_8<1)||(i1.u8.Fork_8<1))&&((i3.u1.Think_6<1)||(i1.u9.Fork_6<1)))&&((i2.u3.Think_10<1)||(i2.u3.Fork_10<1)))&&((i3.u4.Think_5<1)||(i3.u1.Fork_5<1)))&&((i0.u6.Think_4<1)||(i3.u4.Fork_4<1)))&&((i4.u5.Think_1<1)||(i4.u5.Fork_1<1)))&&((i1.u9.Think_7<1)||(i1.u9.Fork_7<1)))&&((i2.u2.Think_9<1)||(i2.u2.Fork_9<1)))&&((i4.u7.Think_2<1)||(i4.u7.Fork_2<1)))&&((i0.u0.Think_3<1)||(i0.u6.Fork_3<1)))) * (((((((((((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (((((((((((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1)))),(((((((((((i1.u8.Think_8<1)||(i1.u8.Fork_8<1))&&((i3.u1.Think_6<1)||(i1.u9.Fork_6<1)))&&((i2.u3.Think_10<1)||(i2.u3.Fork_10<1)))&&((i3.u4.Think_5<1)||(i3.u1.Fork_5<1)))&&((i0.u6.Think_4<1)||(i3.u4.Fork_4<1)))&&((i4.u5.Think_1<1)||(i4.u5.Fork_1<1)))&&((i1.u9.Think_7<1)||(i1.u9.Fork_7<1)))&&((i2.u2.Think_9<1)||(i2.u2.Fork_9<1)))&&((i4.u7.Think_2<1)||(i4.u7.Fork_2<1)))&&((i0.u0.Think_3<1)||(i0.u6.Fork_3<1))))] != FALSE
(forward)formula 3,1,0.126348,9812,1,0,12745,395,612,13733,221,1098,16992
FORMULA Philosophers-PT-000010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(EG(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((((((((i2.u3.Eat_10>=1)||(i3.u1.Eat_6>=1))||(i4.u5.Eat_1>=1))||(i0.u6.Eat_4>=1))||(i4.u7.Eat_2>=1))||(i3.u4.Eat_5>=1))||(i2.u2.Eat_9>=1))||(i0.u0.Eat_3>=1))||(i1.u9.Eat_7>=1))||(i1.u8.Eat_8>=1)))))] = FALSE
(forward)formula 4,0,0.166588,11132,1,0,15230,419,619,19334,221,1207,20607
FORMULA Philosophers-PT-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(E((((((((((((i1.u9.Fork_7>=1)&&(i1.u9.Catch1_7>=1))||((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1)))||((i3.u1.Fork_5>=1)&&(i3.u4.Catch1_5>=1)))||((i2.u2.Fork_9>=1)&&(i2.u2.Catch1_9>=1)))||((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1)))||((i2.u3.Fork_10>=1)&&(i2.u3.Catch1_10>=1)))||((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1)))||((i1.u8.Fork_8>=1)&&(i1.u8.Catch1_8>=1)))||((i4.u5.Fork_1>=1)&&(i4.u5.Catch1_1>=1)))||((i0.u6.Fork_3>=1)&&(i0.u0.Catch1_3>=1))) U ((((((((((((i1.u9.Fork_7>=1)&&(i1.u9.Catch1_7>=1))||((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1)))||((i3.u1.Fork_5>=1)&&(i3.u4.Catch1_5>=1)))||((i2.u2.Fork_9>=1)&&(i2.u2.Catch1_9>=1)))||((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1)))||((i2.u3.Fork_10>=1)&&(i2.u3.Catch1_10>=1)))||((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1)))||((i1.u8.Fork_8>=1)&&(i1.u8.Catch1_8>=1)))||((i4.u5.Fork_1>=1)&&(i4.u5.Catch1_1>=1)))||((i0.u6.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))&&(((((((((((i0.u6.Fork_3>=1)&&(i0.u6.Catch2_4>=1))||((i3.u1.Fork_5>=1)&&(i3.u1.Catch2_6>=1)))||((i2.u2.Fork_9>=1)&&(i2.u3.Catch2_10>=1)))||((i4.u5.Fork_1>=1)&&(i4.u7.Catch2_2>=1)))||((i1.u9.Fork_6>=1)&&(i1.u9.Catch2_7>=1)))||((i4.u7.Fork_2>=1)&&(i0.u0.Catch2_3>=1)))||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1)))||((i1.u8.Fork_8>=1)&&(i2.u2.Catch2_9>=1)))||((i2.u3.Fork_10>=1)&&(i4.u5.Catch2_1>=1)))||((i1.u9.Fork_7>=1)&&(i1.u8.Catch2_8>=1)))))) * AG((((((((((((((((((((((i1.u8.Think_8>=1)&&(i1.u8.Fork_8>=1))||((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))||((i2.u3.Think_10>=1)&&(i2.u3.Fork_10>=1)))||((i3.u4.Think_5>=1)&&(i3.u1.Fork_5>=1)))||((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1)))||((i4.u5.Think_1>=1)&&(i4.u5.Fork_1>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_7>=1)))||((i2.u2.Think_9>=1)&&(i2.u2.Fork_9>=1)))||((i4.u7.Think_2>=1)&&(i4.u7.Fork_2>=1)))||((i0.u0.Think_3>=1)&&(i0.u6.Fork_3>=1)))||((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1)))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,(((((((((((i1.u9.Fork_7>=1)&&(i1.u9.Catch1_7>=1))||((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1)))||((i3.u1.Fork_5>=1)&&(i3.u4.Catch1_5>=1)))||((i2.u2.Fork_9>=1)&&(i2.u2.Catch1_9>=1)))||((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1)))||((i2.u3.Fork_10>=1)&&(i2.u3.Catch1_10>=1)))||((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1)))||((i1.u8.Fork_8>=1)&&(i1.u8.Catch1_8>=1)))||((i4.u5.Fork_1>=1)&&(i4.u5.Catch1_1>=1)))||((i0.u6.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))) * ((((((((((((i1.u9.Fork_7>=1)&&(i1.u9.Catch1_7>=1))||((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1)))||((i3.u1.Fork_5>=1)&&(i3.u4.Catch1_5>=1)))||((i2.u2.Fork_9>=1)&&(i2.u2.Catch1_9>=1)))||((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1)))||((i2.u3.Fork_10>=1)&&(i2.u3.Catch1_10>=1)))||((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1)))||((i1.u8.Fork_8>=1)&&(i1.u8.Catch1_8>=1)))||((i4.u5.Fork_1>=1)&&(i4.u5.Catch1_1>=1)))||((i0.u6.Fork_3>=1)&&(i0.u0.Catch1_3>=1)))&&(((((((((((i0.u6.Fork_3>=1)&&(i0.u6.Catch2_4>=1))||((i3.u1.Fork_5>=1)&&(i3.u1.Catch2_6>=1)))||((i2.u2.Fork_9>=1)&&(i2.u3.Catch2_10>=1)))||((i4.u5.Fork_1>=1)&&(i4.u7.Catch2_2>=1)))||((i1.u9.Fork_6>=1)&&(i1.u9.Catch2_7>=1)))||((i4.u7.Fork_2>=1)&&(i0.u0.Catch2_3>=1)))||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1)))||((i1.u8.Fork_8>=1)&&(i2.u2.Catch2_9>=1)))||((i2.u3.Fork_10>=1)&&(i4.u5.Catch2_1>=1)))||((i1.u9.Fork_7>=1)&&(i1.u8.Catch2_8>=1)))))] = FALSE * [(FwdU(Init,TRUE) * !((((((((((((((((((((((i1.u8.Think_8>=1)&&(i1.u8.Fork_8>=1))||((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))||((i2.u3.Think_10>=1)&&(i2.u3.Fork_10>=1)))||((i3.u4.Think_5>=1)&&(i3.u1.Fork_5>=1)))||((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1)))||((i4.u5.Think_1>=1)&&(i4.u5.Fork_1>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_7>=1)))||((i2.u2.Think_9>=1)&&(i2.u2.Fork_9>=1)))||((i4.u7.Think_2>=1)&&(i4.u7.Fork_2>=1)))||((i0.u0.Think_3>=1)&&(i0.u6.Fork_3>=1)))||((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1)))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1)))))] = FALSE)
(forward)formula 5,0,0.172787,11660,1,0,15333,420,700,19575,226,1213,20777
FORMULA Philosophers-PT-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((((((((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((((((((i0.u6.Think_4>=1)&&(i0.u6.Fork_3>=1))||((i4.u5.Think_1>=1)&&(i2.u3.Fork_10>=1)))||((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))||((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1)))||((i0.u0.Think_3>=1)&&(i4.u7.Fork_2>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1)))||((i2.u2.Think_9>=1)&&(i1.u8.Fork_8>=1)))||((i2.u3.Think_10>=1)&&(i2.u2.Fork_9>=1)))||((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1)))||((i3.u4.Think_5>=1)&&(i3.u4.Fork_4>=1)))))] = FALSE
(forward)formula 6,0,0.175042,11660,1,0,15369,420,701,19636,226,1214,20778
FORMULA Philosophers-PT-000010-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E((((((((((((i1.u8.Think_8>=1)&&(i1.u8.Fork_8>=1))||((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))||((i2.u3.Think_10>=1)&&(i2.u3.Fork_10>=1)))||((i3.u4.Think_5>=1)&&(i3.u1.Fork_5>=1)))||((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1)))||((i4.u5.Think_1>=1)&&(i4.u5.Fork_1>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_7>=1)))||((i2.u2.Think_9>=1)&&(i2.u2.Fork_9>=1)))||((i4.u7.Think_2>=1)&&(i4.u7.Fork_2>=1)))||((i0.u0.Think_3>=1)&&(i0.u6.Fork_3>=1))) U (((((((((((i0.u6.Think_4<1)||(i0.u6.Fork_3<1))&&((i4.u5.Think_1<1)||(i2.u3.Fork_10<1)))&&((i4.u7.Think_2<1)||(i4.u5.Fork_1<1)))&&((i3.u1.Think_6<1)||(i3.u1.Fork_5<1)))&&((i0.u0.Think_3<1)||(i4.u7.Fork_2<1)))&&((i1.u9.Think_7<1)||(i1.u9.Fork_6<1)))&&((i2.u2.Think_9<1)||(i1.u8.Fork_8<1)))&&((i2.u3.Think_10<1)||(i2.u2.Fork_9<1)))&&((i1.u8.Think_8<1)||(i1.u9.Fork_7<1)))&&((i3.u4.Think_5<1)||(i3.u4.Fork_4<1)))))
=> equivalent forward existential formula: [FwdG(Init,E((((((((((((i1.u8.Think_8>=1)&&(i1.u8.Fork_8>=1))||((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))||((i2.u3.Think_10>=1)&&(i2.u3.Fork_10>=1)))||((i3.u4.Think_5>=1)&&(i3.u1.Fork_5>=1)))||((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1)))||((i4.u5.Think_1>=1)&&(i4.u5.Fork_1>=1)))||((i1.u9.Think_7>=1)&&(i1.u9.Fork_7>=1)))||((i2.u2.Think_9>=1)&&(i2.u2.Fork_9>=1)))||((i4.u7.Think_2>=1)&&(i4.u7.Fork_2>=1)))||((i0.u0.Think_3>=1)&&(i0.u6.Fork_3>=1))) U (((((((((((i0.u6.Think_4<1)||(i0.u6.Fork_3<1))&&((i4.u5.Think_1<1)||(i2.u3.Fork_10<1)))&&((i4.u7.Think_2<1)||(i4.u5.Fork_1<1)))&&((i3.u1.Think_6<1)||(i3.u1.Fork_5<1)))&&((i0.u0.Think_3<1)||(i4.u7.Fork_2<1)))&&((i1.u9.Think_7<1)||(i1.u9.Fork_6<1)))&&((i2.u2.Think_9<1)||(i1.u8.Fork_8<1)))&&((i2.u3.Think_10<1)||(i2.u2.Fork_9<1)))&&((i1.u8.Think_8<1)||(i1.u9.Fork_7<1)))&&((i3.u4.Think_5<1)||(i3.u4.Fork_4<1)))))] != FALSE
(forward)formula 7,1,0.267558,14036,1,0,21637,442,754,29999,228,1308,28509
FORMULA Philosophers-PT-000010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((i3.u1.Eat_6>=1)&&(i0.u6.Think_4>=1))&&(i0.u6.Fork_3>=1))&&(i0.u6.Eat_4>=1)) * EX(((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * ((((i3.u1.Eat_6>=1)&&(i0.u6.Think_4>=1))&&(i0.u6.Fork_3>=1))&&(i0.u6.Eat_4>=1)))) * ((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)))] != FALSE
(forward)formula 8,0,0.268453,14300,1,0,21647,442,765,29999,231,1308,28543
FORMULA Philosophers-PT-000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((!(AG(((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1)))) + (i1.u9.Think_7<1)) + (i1.u9.Fork_7<1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((i1.u9.Fork_7<1))) * !((i1.u9.Think_7<1))) * !(E(TRUE U !(((i3.u4.Fork_4>=1)&&(i0.u6.Catch1_4>=1))))))] = FALSE
(forward)formula 9,1,0.269272,14564,1,0,21663,442,769,30004,231,1308,28612
FORMULA Philosophers-PT-000010-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((i0.u6.Eat_4<1)||((i2.u2.Eat_9<1)&&((i2.u2.Fork_9<1)||(i2.u3.Catch2_10<1)))) U AG(((((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1))&&(i2.u2.Think_9>=1))&&(i2.u2.Fork_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,((i0.u6.Eat_4<1)||((i2.u2.Eat_9<1)&&((i2.u2.Fork_9<1)||(i2.u3.Catch2_10<1))))) * !(E(TRUE U !(((((i1.u8.Think_8>=1)&&(i1.u9.Fork_7>=1))&&(i2.u2.Think_9>=1))&&(i2.u2.Fork_9>=1))))))] != FALSE
(forward)formula 10,0,0.270045,14564,1,0,21681,442,774,30013,231,1308,28653
FORMULA Philosophers-PT-000010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(AG(((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))) * (EF(AG(((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1)))) + EX(((((i3.u1.Fork_5<1)||(i3.u4.Catch1_5<1))&&(i0.u6.Fork_3>=1))&&(i0.u0.Catch1_3>=1)))))
=> equivalent forward existential formula: ([(FwdU((Init * E(TRUE U !(E(TRUE U !(((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1))))))),TRUE) * !(E(TRUE U !(((i4.u7.Fork_2>=1)&&(i4.u7.Catch1_2>=1))))))] != FALSE + [(EY((Init * E(TRUE U !(E(TRUE U !(((i4.u7.Think_2>=1)&&(i4.u5.Fork_1>=1)))))))) * ((((i3.u1.Fork_5<1)||(i3.u4.Catch1_5<1))&&(i0.u6.Fork_3>=1))&&(i0.u0.Catch1_3>=1)))] != FALSE)
(forward)formula 11,0,0.271457,14564,1,0,21694,442,798,30028,234,1308,28734
FORMULA Philosophers-PT-000010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((((i1.u9.Fork_7<1)||(i1.u9.Catch1_7<1))&&((((i3.u4.Think_5<1)||(i3.u4.Fork_4<1))||(i3.u1.Fork_5<1))||(i3.u1.Catch2_6<1))) U AG(((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1))))
=> equivalent forward existential formula: [(FwdU(Init,(((i1.u9.Fork_7<1)||(i1.u9.Catch1_7<1))&&((((i3.u4.Think_5<1)||(i3.u4.Fork_4<1))||(i3.u1.Fork_5<1))||(i3.u1.Catch2_6<1)))) * !(E(TRUE U !(((i1.u9.Think_7>=1)&&(i1.u9.Fork_6>=1))))))] != FALSE
(forward)formula 12,0,0.271993,14564,1,0,21706,442,798,30033,234,1308,28773
FORMULA Philosophers-PT-000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1)) U AF(((i3.u1.Eat_6>=1)||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i3.u1.Eat_6>=1)||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1)))))))))) * !(E(!(!(EG(!(((i3.u1.Eat_6>=1)||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1))))))) U (!(((i3.u1.Think_6>=1)&&(i1.u9.Fork_6>=1))) * !(!(EG(!(((i3.u1.Eat_6>=1)||((i3.u4.Fork_4>=1)&&(i3.u4.Catch2_5>=1)))))))))))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 13,0,0.410012,19316,1,0,34104,456,845,43222,236,1361,38543
FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1))&&((i0.u0.Think_3<1)||(i4.u7.Fork_2<1))) * AF(((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1))))) * !(AX(AG(((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1))))))
=> equivalent forward existential formula: [(FwdU(EY((Init * EX(((((i1.u9.Fork_6>=1)&&(i3.u1.Catch1_6>=1))&&((i0.u0.Think_3<1)||(i4.u7.Fork_2<1))) * !(EG(!(((i3.u1.Think_6>=1)&&(i3.u1.Fork_5>=1))))))))),TRUE) * !(((i0.u6.Think_4>=1)&&(i3.u4.Fork_4>=1))))] != FALSE
(forward)formula 14,0,0.419615,19844,1,0,35300,456,862,44205,236,1372,40383
FORMULA Philosophers-PT-000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589786640018

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tajo-158961389800116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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