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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.960 3972.00 10102.00 69.30 TFTFFFFFTTTFTTTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.7K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-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 1589780467494

[2020-05-18 05:41:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 05:41:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 05:41:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-18 05:41:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2020-05-18 05:41:10] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-05-18 05:41:10] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 17 ms.
[2020-05-18 05:41:10] [INFO ] Computed order based on color domains.
[2020-05-18 05:41:10] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 14 ms.
[2020-05-18 05:41:10] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Incomplete random walk after 100000 steps, including 2833 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 05:41:10] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-18 05:41:10] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-18 05:41:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 30 ms
[2020-05-18 05:41:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 6 ms
FORMULA Philosophers-COL-000005-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 05:41:10] [INFO ] Applying decomposition
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 6 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/graph9134603165266817551.txt, -o, /tmp/graph9134603165266817551.bin, -w, /tmp/graph9134603165266817551.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/graph9134603165266817551.bin, -l, -1, -v, -w, /tmp/graph9134603165266817551.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 05:41:10] [INFO ] Decomposing Gal with order
[2020-05-18 05:41:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-18 05:41:10] [INFO ] Removed a total of 5 redundant transitions.
[2020-05-18 05:41:10] [INFO ] Flatten gal took : 56 ms
[2020-05-18 05:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2020-05-18 05:41:10] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 1 ms
[2020-05-18 05:41:10] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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 10 CTL formulae.
built 6 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,243,0.012553,4320,34,29,144,87,64,98,51,131,0


Converting to forward existential form...Done !
original formula: (!(AF((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1)))) * !(EG((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1)))))
=> equivalent forward existential formula: ([(Init * !(EG(!((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))))] = FALSE * [FwdG(Init,(((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=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
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.03493,5088,1,0,1158,241,181,954,185,342,2351
FORMULA Philosophers-COL-000005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1)))))))) * !(FALSE))] = FALSE
(forward)formula 1,0,0.035745,5088,1,0,1176,241,181,982,187,345,2413
FORMULA Philosophers-COL-000005-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))] != FALSE
(forward)formula 2,1,0.038881,5088,1,0,1615,243,184,1355,187,370,3380
FORMULA Philosophers-COL-000005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AF((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))] = FALSE
(forward)formula 3,0,0.040435,5352,1,0,1689,243,184,1462,187,370,3587
FORMULA Philosophers-COL-000005-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EF(((((((u1.think_0<1)||(u0.fork_0<1))&&((u2.think_4<1)||(u1.fork_4<1)))&&((u0.think_1<1)||(u0.fork_1<1)))&&((u4.think_3<1)||(u4.fork_3<1)))&&((u3.think_2<1)||(u3.fork_2<1)))) U !(EG(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1))))))))) * !(E(!(!(EG(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1)))))) U (!(E(TRUE U ((((((u1.think_0<1)||(u0.fork_0<1))&&((u2.think_4<1)||(u1.fork_4<1)))&&((u0.think_1<1)||(u0.fork_1<1)))&&((u4.think_3<1)||(u4.fork_3<1)))&&((u3.think_2<1)||(u3.fork_2<1))))) * !(!(EG(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=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 4,0,0.054747,5616,1,0,1866,244,327,1700,208,396,4275
FORMULA Philosophers-COL-000005-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E(((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1))) U ((((((u3.fork_2>=1)&&(u4.catch2_3>=1))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_4>=1)&&(u1.catch2_0>=1)))||((u0.fork_1>=1)&&(u3.catch2_2>=1)))||((u4.fork_3>=1)&&(u2.catch2_4>=1)))) * (EF(((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1)))) + AG(((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1))))))
=> equivalent forward existential formula: ([(Init * !(E(((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1))) U ((((((u3.fork_2>=1)&&(u4.catch2_3>=1))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_4>=1)&&(u1.catch2_0>=1)))||((u0.fork_1>=1)&&(u3.catch2_2>=1)))||((u4.fork_3>=1)&&(u2.catch2_4>=1))))))] = FALSE * [(FwdU((Init * !(E(TRUE U ((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1)))))),TRUE) * !(((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1)))))] = FALSE)
(forward)formula 5,1,0.062888,5616,1,0,2442,249,382,2313,216,409,5451
FORMULA Philosophers-COL-000005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AX((((((((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1)))||(u1.eat_0>=1))||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !((((((((((((u2.think_4>=1)&&(u4.fork_3>=1))||((u0.think_1>=1)&&(u0.fork_0>=1)))||((u4.think_3>=1)&&(u3.fork_2>=1)))||((u3.think_2>=1)&&(u0.fork_1>=1)))||((u1.think_0>=1)&&(u1.fork_4>=1)))||(u1.eat_0>=1))||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))] = FALSE
(forward)formula 6,1,0.064976,5880,1,0,2490,254,395,2393,218,419,5494
FORMULA Philosophers-COL-000005-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1)) U ((((((u4.fork_3>=1)&&(u4.catch1_3>=1))||((u1.fork_4>=1)&&(u2.catch1_4>=1)))||((u0.fork_0>=1)&&(u1.catch1_0>=1)))||((u0.fork_1>=1)&&(u0.catch1_1>=1)))||((u3.fork_2>=1)&&(u3.catch1_2>=1))))) * (!(AG(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1))))) + EX(EG((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1))) * ((((((u4.fork_3>=1)&&(u4.catch1_3>=1))||((u1.fork_4>=1)&&(u2.catch1_4>=1)))||((u0.fork_0>=1)&&(u1.catch1_0>=1)))||((u0.fork_1>=1)&&(u0.catch1_1>=1)))||((u3.fork_2>=1)&&(u3.catch1_2>=1))))] = FALSE * [((Init * !(EX(EG((((((u1.eat_0>=1)||(u0.eat_1>=1))||(u3.eat_2>=1))||(u4.eat_3>=1))||(u2.eat_4>=1)))))) * !(E(TRUE U !(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1)))))))] = FALSE)
(forward)formula 7,1,0.06817,6144,1,0,2507,254,429,2421,222,421,5571
FORMULA Philosophers-COL-000005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((((((u3.fork_2>=1)&&(u4.catch2_3>=1))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_4>=1)&&(u1.catch2_0>=1)))||((u0.fork_1>=1)&&(u3.catch2_2>=1)))||((u4.fork_3>=1)&&(u2.catch2_4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((u3.fork_2>=1)&&(u4.catch2_3>=1))||((u0.fork_0>=1)&&(u0.catch2_1>=1)))||((u1.fork_4>=1)&&(u1.catch2_0>=1)))||((u0.fork_1>=1)&&(u3.catch2_2>=1)))||((u4.fork_3>=1)&&(u2.catch2_4>=1))))] != FALSE
(forward)formula 8,1,0.06913,6144,1,0,2508,254,429,2443,222,421,5571
FORMULA Philosophers-COL-000005-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((EF(((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1)))) + ((((((u1.think_0<1)||(u0.fork_0<1))&&((u2.think_4<1)||(u1.fork_4<1)))&&((u0.think_1<1)||(u0.fork_1<1)))&&((u4.think_3<1)||(u4.fork_3<1)))&&((u3.think_2<1)||(u3.fork_2<1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((((((u1.think_0<1)||(u0.fork_0<1))&&((u2.think_4<1)||(u1.fork_4<1)))&&((u0.think_1<1)||(u0.fork_1<1)))&&((u4.think_3<1)||(u4.fork_3<1)))&&((u3.think_2<1)||(u3.fork_2<1))))) * !(E(TRUE U ((((((u1.think_0>=1)&&(u0.fork_0>=1))||((u2.think_4>=1)&&(u1.fork_4>=1)))||((u0.think_1>=1)&&(u0.fork_1>=1)))||((u4.think_3>=1)&&(u4.fork_3>=1)))||((u3.think_2>=1)&&(u3.fork_2>=1))))))] = FALSE
(forward)formula 9,1,0.071483,6144,1,0,2538,255,430,2509,222,425,5672
FORMULA Philosophers-COL-000005-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589780471466

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-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-4028"
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 r126-tajo-158961389700004"
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" = "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 ;