fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r197-oct2-155272231500797
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools.M for Philosophers-PT-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
380.730 4626.00 6714.00 77.90 FTFTFFFFFFFTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r197-oct2-155272231500797.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstoolsm
Input is Philosophers-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-oct2-155272231500797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 6.6K Feb 12 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 12 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 8 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 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 4.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 41K 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-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 1553693422632

Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59049,0.012619,4596,2,240,5,1124,6,0,253,766,0


Converting to forward existential form...Done !
original formula: AF(!(EF(!((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.039228,6380,1,0,8,7844,19,5,1379,3519,10
FORMULA Philosophers-PT-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EG(!(EF((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))))) + E(!(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))) U !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U (((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))] != FALSE + [(FwdU(Init,!(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1)))) * !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 1,1,0.057189,7160,1,0,13,10921,30,8,1543,6934,16
FORMULA Philosophers-PT-000010-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))||(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))) U ((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))) + AG((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))) + !(E(TRUE U !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))))))) * !(E(!(((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))) + !(E(TRUE U !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))))))) U (!(((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))||(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1))))) * !(((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))) + !(E(TRUE U !((((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))))))))] != FALSE
Using saturation style SCC detection
(forward)formula 2,0,2.15263,84072,1,0,85,409178,38,64,1697,625395,71
FORMULA Philosophers-PT-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EG(!((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1))))) + AG((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))&&(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1))))) + !(E(TRUE U !((((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))))))))] != FALSE
(forward)formula 3,1,2.21805,86152,1,0,111,418277,44,89,1746,641511,99
FORMULA Philosophers-PT-000010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(((((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))||(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))||(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))||(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))))] = FALSE
(forward)formula 4,0,2.22766,86680,1,0,113,418787,46,91,1776,642518,100
FORMULA Philosophers-PT-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(AG(AF(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1)))))))))] != FALSE
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 5,0,2.40963,89584,1,0,114,434303,53,92,1897,655178,105
FORMULA Philosophers-PT-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(EG(AG((((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !((((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))))))] != FALSE
(forward)formula 6,0,2.41599,89836,1,0,115,434629,58,92,1906,655509,108
FORMULA Philosophers-PT-000010-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AF((((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))&&(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/50
(forward)formula 7,0,2.56238,94852,1,0,118,459710,66,95,1914,698465,112
FORMULA Philosophers-PT-000010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF((((Catch1_10>=1)&&(Fork_10>=1)) * AX(((Fork_10>=1)&&(Catch2_1>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((Catch1_10>=1)&&(Fork_10>=1))) * !(EX(!(((Fork_10>=1)&&(Catch2_1>=1))))))] != FALSE
(forward)formula 8,0,2.57067,95380,1,0,122,461592,69,98,1914,700090,115
FORMULA Philosophers-PT-000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG((EF(((Fork_1>=1)&&(Catch2_2>=1))) + ((Fork_10>=1)&&(Think_1>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((Fork_10>=1)&&(Think_1>=1)))) * !(E(TRUE U ((Fork_1>=1)&&(Catch2_2>=1)))))] = FALSE
(forward)formula 9,0,2.58283,95908,1,0,125,463932,72,101,1914,702401,119
FORMULA Philosophers-PT-000010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(((Catch2_10>=1)&&(Fork_9>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((Catch2_10>=1)&&(Fork_9>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 43/0/7
(forward)formula 10,0,2.5898,95908,1,0,126,464901,80,104,1969,703899,123
FORMULA Philosophers-PT-000010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(EX(A((Eat_2>=1) U (Eat_5>=1))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((Eat_5>=1))))) * !(E(!((Eat_5>=1)) U (!((Eat_2>=1)) * !((Eat_5>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 47/0/3
Hit Full ! (commute/partial/dont) 47/0/3
(forward)formula 11,1,2.59659,96172,1,0,130,465669,93,108,1995,704798,130
FORMULA Philosophers-PT-000010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(!(EX(((Catch1_10>=1)&&(Fork_10>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((Catch1_10>=1)&&(Fork_10>=1)))))] != FALSE
(forward)formula 12,0,2.60309,96436,1,0,132,467286,96,110,1995,706313,131
FORMULA Philosophers-PT-000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (!((AX((((Catch2_9>=1)&&(Fork_8>=1))&&((Think_8>=1)&&(Fork_7>=1)))) + AF((Eat_7>=1)))) * A(((((Fork_3>=1)&&(Catch1_3>=1))||((Catch1_1>=1)&&(Fork_1>=1)))||(!((Catch1_1>=1)&&(Fork_1>=1)))) U (Eat_8>=1)))
=> equivalent forward existential formula: [(((Init * !((!(EX(!((((Catch2_9>=1)&&(Fork_8>=1))&&((Think_8>=1)&&(Fork_7>=1)))))) + !(EG(!((Eat_7>=1))))))) * !(EG(!((Eat_8>=1))))) * !(E(!((Eat_8>=1)) U (!(((((Fork_3>=1)&&(Catch1_3>=1))||((Catch1_1>=1)&&(Fork_1>=1)))||(!((Catch1_1>=1)&&(Fork_1>=1))))) * !((Eat_8>=1))))))] != FALSE
Hit Full ! (commute/partial/dont) 47/0/3
Hit Full ! (commute/partial/dont) 47/0/3
(forward)formula 13,0,2.61903,97228,1,0,143,469269,120,121,2051,708597,143
FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: FALSE
=> equivalent forward existential formula: [(Init * FALSE)] != FALSE
(forward)formula 14,0,2.61907,97228,1,0,143,469269,120,121,2051,708597,143
FORMULA Philosophers-PT-000010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: TRUE
=> equivalent forward existential formula: [(Init * TRUE)] != FALSE
(forward)formula 15,1,2.61908,97228,1,0,143,469269,120,121,2051,708597,143
FORMULA Philosophers-PT-000010-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1553693427258

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 27, 2019 1:30:24 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 30 ms
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
Mar 27, 2019 1:30:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.instantiate.CTLSimplifier simplifyTemporal
INFO: Initial state reduction rules for CTL removed 2 formulas.
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 places.
Mar 27, 2019 1:30:24 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 50 transitions.
Mar 27, 2019 1:30:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
Mar 27, 2019 1:30:24 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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-000010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsm"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstoolsm"
echo " Input is Philosophers-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 r197-oct2-155272231500797"
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" = "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 ;