About the Execution of ITS-Tools for Philosophers-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15746.270 | 3335.00 | 7559.00 | 103.10 | FFFFFFTTTFTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
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 r116-csrt-152666475800767
=====================================================================
--------------------
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 1527198032660
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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,59049,0.018913,4460,2,258,5,1041,6,0,253,736,0
Converting to forward existential form...Done !
original formula: AG(EX(AF((((((((((((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))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((((((((((((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)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/198/50
(forward)formula 0,0,0.203969,12352,1,0,14,45777,20,7,1357,38797,10
FORMULA Philosophers-PT-000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(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))))&&(((((((((((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))))&&((((((((((((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))))||((((((((((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: [(FwdU(Init,TRUE) * (((!(((((((((((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))))&&(((((((((((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))))&&((((((((((((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))))||((((((((((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
(forward)formula 1,0,0.235778,13288,1,0,16,47570,21,8,1435,41111,11
FORMULA Philosophers-PT-000010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(EF(!((((((((((((((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)))||(((((((((((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))))&&(((((((((((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) * !((((((((((((((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)))||(((((((((((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))))&&(((((((((((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 2,0,0.259767,13552,1,0,19,48631,23,10,1467,42892,12
FORMULA Philosophers-PT-000010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG((!(EX((((((((((((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))))) + A((((((((((((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))) 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: [(EY((FwdU(Init,TRUE) * !(!((E(!((((((((((((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_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)))))) + EG(!((((((((((((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_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
Hit Full ! (commute/partial/dont) 0/198/50
Hit Full ! (commute/partial/dont) 0/198/50
(forward)formula 3,0,0.421835,17164,1,0,26,74022,36,14,1588,62453,20
FORMULA Philosophers-PT-000010-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((((((((((((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)))) * 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))))))
=> equivalent forward existential formula: ([(Init * !((((((((((((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 * ([(Init * (((((((((((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))))] = FALSE * [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))))] = FALSE))
Hit Full ! (commute/partial/dont) 20/270/30
(forward)formula 4,0,0.452516,17956,1,0,29,78016,45,16,1738,66873,25
FORMULA Philosophers-PT-000010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(AX((((((((((((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: [(EY(FwdU(Init,TRUE)) * !((((((((((((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
(forward)formula 5,0,0.463579,18220,1,0,30,78308,45,17,1746,67665,27
FORMULA Philosophers-PT-000010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (EX((((((((((((((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))) + AX((((((((((((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)))))) * 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: [(FwdU((Init * EX((((((((((((((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))) + !(EX(!((((((((((((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))))))))),TRUE) * !((((((((((((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
(forward)formula 6,1,0.514384,18748,1,0,35,81150,47,20,1822,73827,32
FORMULA Philosophers-PT-000010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(!(((((((((((((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)))&&(((((((((((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))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((((((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)))&&(((((((((((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))))))] != FALSE
(forward)formula 7,1,0.545871,19476,1,0,38,82444,49,22,1870,76582,33
FORMULA Philosophers-PT-000010-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: ((((Fork_10>=1)&&(Think_10>=1)) + (AX(((Think_3>=1)&&(Fork_2>=1))) * E((Eat_5>=1) U ((Fork_10>=1)&&(Catch2_1>=1))))) * AG(!(AG(((Think_10>=1)&&(Fork_9>=1))))))
=> equivalent forward existential formula: (([(EY((Init * !(((Fork_10>=1)&&(Think_10>=1))))) * !(((Think_3>=1)&&(Fork_2>=1))))] = FALSE * [((Init * !(((Fork_10>=1)&&(Think_10>=1)))) * !(E((Eat_5>=1) U ((Fork_10>=1)&&(Catch2_1>=1)))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U !(((Think_10>=1)&&(Fork_9>=1))))))] = FALSE)
Hit Full ! (commute/partial/dont) 47/0/3
(forward)formula 8,1,0.561367,19740,1,0,45,84158,67,24,1942,78177,42
FORMULA Philosophers-PT-000010-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (!(EF(EG((Eat_10>=1)))) * !(((Fork_10>=1)&&(Catch2_1>=1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(Eat_10>=1))] = FALSE * [(Init * ((Fork_10>=1)&&(Catch2_1>=1)))] = FALSE)
Hit Full ! (commute/partial/dont) 47/0/3
(forward)formula 9,0,0.562755,19740,1,0,47,84187,74,25,1959,78185,47
FORMULA Philosophers-PT-000010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: E(!(((Catch1_8>=1)&&(Fork_8>=1))) U AX(((Think_8>=1)&&(Fork_7>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(((Catch1_8>=1)&&(Fork_8>=1)))) * !(EX(!(((Think_8>=1)&&(Fork_7>=1))))))] != FALSE
Hit Full ! (commute/partial/dont) 43/0/7
(forward)formula 10,1,0.56922,19740,1,0,51,84890,84,27,1984,78949,52
FORMULA Philosophers-PT-000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: ((A(!(((Fork_6>=1)&&(Catch1_6>=1))) U ((Fork_10>=1)&&(Catch2_1>=1))) + AG(((Fork_5>=1)&&(Think_5>=1)))) + AG(!(AG(((Fork_10>=1)&&(Catch2_1>=1))))))
=> equivalent forward existential formula: [(FwdU((Init * !((!((E(!(((Fork_10>=1)&&(Catch2_1>=1))) U (!(!(((Fork_6>=1)&&(Catch1_6>=1)))) * !(((Fork_10>=1)&&(Catch2_1>=1))))) + EG(!(((Fork_10>=1)&&(Catch2_1>=1)))))) + !(E(TRUE U !(((Fork_5>=1)&&(Think_5>=1)))))))),TRUE) * !(E(TRUE U !(((Fork_10>=1)&&(Catch2_1>=1))))))] = FALSE
(forward)formula 11,1,0.572144,19740,1,0,52,85082,85,27,1984,79127,55
FORMULA Philosophers-PT-000010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(AX(((Think_3>=1)&&(Fork_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((Think_3>=1)&&(Fork_2>=1))))))] != FALSE
(forward)formula 12,1,0.582597,20004,1,0,54,86608,85,29,1984,80688,57
FORMULA Philosophers-PT-000010-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E(!(AX(((Fork_10>=1)&&(Think_10>=1)))) U AG((Eat_5>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(((Fork_10>=1)&&(Think_10>=1))))))) * !(E(TRUE U !((Eat_5>=1)))))] != FALSE
(forward)formula 13,0,0.584051,20004,1,0,55,86722,86,29,1984,80697,60
FORMULA Philosophers-PT-000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EX(((EG(((Fork_9>=1)&&(Think_9>=1))) * EF(((Catch2_9>=1)&&(Fork_8>=1)))) * (Eat_2>=1)))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * (Eat_2>=1)) * EG(((Fork_9>=1)&&(Think_9>=1)))),TRUE) * ((Catch2_9>=1)&&(Fork_8>=1)))] != FALSE
(forward)formula 14,0,0.587207,20268,1,0,60,86889,95,31,1987,80946,64
FORMULA Philosophers-PT-000010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((Catch1_1>=1)&&(Fork_1>=1))
=> equivalent forward existential formula: [(Init * ((Catch1_1>=1)&&(Fork_1>=1)))] != FALSE
(forward)formula 15,0,0.587905,20268,1,0,61,86909,96,31,1987,80946,65
FORMULA Philosophers-PT-000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1527198035995
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /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 -consoleLog -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
May 24, 2018 9:40:34 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]
May 24, 2018 9:40:34 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 24, 2018 9:40:34 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
May 24, 2018 9:40:34 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
May 24, 2018 9:40:34 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
May 24, 2018 9:40:34 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 11 ms
May 24, 2018 9:40:35 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
May 24, 2018 9:40:35 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
May 24, 2018 9:40:35 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-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
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
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 r116-csrt-152666475800767"
echo "====================================================================="
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 '
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 ;