About the Execution of ITS-Tools.M for QuasiCertifProtocol-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
339.040 | 3122.00 | 5596.00 | 66.20 | FFTFFTFTFFTTTTFT | 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.r204-oct2-155274856700257.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 QuasiCertifProtocol-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-155274856700257
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.5K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.9K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 55K 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 QuasiCertifProtocol-PT-02-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1554175321957
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,1029,0.043499,6712,2,2637,5,8043,6,0,365,5957,0
Converting to forward existential form...Done !
original formula: A(!(EG(((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1))))) U A(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1))) U ((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))) U (!(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1)))) * !(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))))) + EG(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1))))))))))) * !(E(!(!((E(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))) U (!(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1)))) * !(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))))) + EG(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))))))) U (!(!(EG(((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1)))))) * !(!((E(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))) U (!(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1)))) * !(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))))) + EG(!(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t45, t46, t47, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
(forward)formula 0,0,0.551844,30624,1,0,264,127184,145,121,2392,97093,260
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AX(EX(AF(((((((n9_2_2>=1)&&(n9_1_2>=1))&&(n9_0_2>=1))&&(c1_2>=1))||((((n9_2_1>=1)&&(n9_1_1>=1))&&(n9_0_1>=1))&&(c1_1>=1)))||((((n9_2_0>=1)&&(n9_1_0>=1))&&(n9_0_0>=1))&&(c1_0>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(((((((n9_2_2>=1)&&(n9_1_2>=1))&&(n9_0_2>=1))&&(c1_2>=1))||((((n9_2_1>=1)&&(n9_1_1>=1))&&(n9_0_1>=1))&&(c1_1>=1)))||((((n9_2_0>=1)&&(n9_1_0>=1))&&(n9_0_0>=1))&&(c1_0>=1)))))))))] = FALSE
(forward)formula 1,0,0.649192,33224,1,0,341,144841,150,163,2413,117083,340
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (((EG(!(((((Sstart_2>=1)&&(n1_2>=1))||((n1_1>=1)&&(Sstart_1>=1)))||((Sstart_0>=1)&&(n1_0>=1))))) + (EG((((s4_1>=1)||(s4_0>=1))||(s4_2>=1))) * EF(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))) * !(AF((((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))||(((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))) + !(AF((((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))
=> equivalent forward existential formula: ([FwdG((Init * (EG(!(((((Sstart_2>=1)&&(n1_2>=1))||((n1_1>=1)&&(Sstart_1>=1)))||((Sstart_0>=1)&&(n1_0>=1))))) + (EG((((s4_1>=1)||(s4_0>=1))||(s4_2>=1))) * E(TRUE U ((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1))))))),!((((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))||(((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))] != FALSE + [FwdG(Init,!((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 47/18/9
(forward)formula 2,1,0.731955,36656,1,0,421,157080,180,208,2585,136669,428
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AF(((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 29/6/27
(forward)formula 3,0,0.737332,37184,1,0,424,157422,188,211,2676,137281,431
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG(AF(((!(a4>=1))&&(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))||((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!(a4>=1))&&(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))||((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))))))] != FALSE
dead was empty
(forward)formula 4,0,0.801885,39560,1,0,472,169142,193,250,2693,153423,506
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG((!(EX(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1))))) + !((((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(((((((n8_0_2>=1)&&(n8_0_0>=1))&&(n8_0_1>=1))&&(s5_0>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((((n8_1_1>=1)&&(n8_1_2>=1))&&(s5_1>=1))&&(n8_1_0>=1))))) + !((((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))] != FALSE
(forward)formula 5,1,0.867476,41924,1,0,524,181031,196,302,2700,172158,557
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: (AG(!(((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))||(a2>=1))&&(a4>=1)))) * AF((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))||((!((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1))))&&((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))&&((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))||(a2>=1))&&(a4>=1)))] = FALSE * [FwdG(Init,!((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))||((!((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1))))&&((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))&&((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1))))))))] = FALSE)
Hit Full ! (commute/partial/dont) 23/0/33
(forward)formula 6,0,0.888774,42980,1,0,526,182362,204,305,2795,173879,560
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (!((EG(!(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) + EG((((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))||(a4>=1))))) * !(AF(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1))))))
=> equivalent forward existential formula: [FwdG((Init * !((EG(!(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) + EG((((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))||(a4>=1)))))),!(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 29/6/27
(forward)formula 7,1,0.922076,44036,1,0,575,186408,220,345,2865,180434,639
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: A(AF(((s2_1>=1)&&(n3_1>=1))) U (((((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((s2_1>=1)&&(n3_1>=1)))||(!(s6_1>=1))) * AG((s6_2>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!((((((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((s2_1>=1)&&(n3_1>=1)))||(!(s6_1>=1))) * !(E(TRUE U !((s6_2>=1))))))))) * !(E(!((((((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((s2_1>=1)&&(n3_1>=1)))||(!(s6_1>=1))) * !(E(TRUE U !((s6_2>=1)))))) U (!(!(EG(!(((s2_1>=1)&&(n3_1>=1)))))) * !((((((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((s2_1>=1)&&(n3_1>=1)))||(!(s6_1>=1))) * !(E(TRUE U !((s6_2>=1))))))))))] != FALSE
(forward)formula 8,0,0.950487,45092,1,0,636,190206,228,385,2868,186059,724
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AF((a3>=1))
=> equivalent forward existential formula: [FwdG(Init,!((a3>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 53/0/3
(forward)formula 9,0,0.952751,45356,1,0,639,190235,236,388,2939,186115,727
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EG(AX(!((((malicious_reservoir>=1)&&(s4_2>=1))&&((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!((((malicious_reservoir>=1)&&(s4_2>=1))&&((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1))))))))] != FALSE
(forward)formula 10,1,0.964536,45620,1,0,639,190352,238,390,2951,187487,730
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EG(!((((((malicious_reservoir>=1)&&(s3_2>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((malicious_reservoir>=1)&&(c1_0>=1))) * EG(((s6_1>=1)&&(malicious_reservoir>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((malicious_reservoir>=1)&&(s3_2>=1))||((((n8_2_2>=1)&&(n8_2_0>=1))&&(n8_2_1>=1))&&(s5_2>=1)))||((malicious_reservoir>=1)&&(c1_0>=1))) * EG(((s6_1>=1)&&(malicious_reservoir>=1))))))] != FALSE
(forward)formula 11,1,0.967403,45884,1,0,640,190352,243,391,2952,187564,731
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EX(EG((((a5>=1)&&((s6_1>=1)&&(malicious_reservoir>=1)))||(!(s4_2>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((a5>=1)&&((s6_1>=1)&&(malicious_reservoir>=1)))||(!(s4_2>=1))))] != FALSE
Hit Full ! (commute/partial/dont) 28/0/28
(forward)formula 12,1,0.977559,46148,1,0,643,191161,250,394,3024,188753,734
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: !(AF((EF(((s5_0>=1)&&(malicious_reservoir>=1))) * ((!((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1)))&&(((s3_0>=1)&&(malicious_reservoir>=1))||((s3_1>=1)&&(n5_1>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((s5_0>=1)&&(malicious_reservoir>=1))) * ((!((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1)))&&(((s3_0>=1)&&(malicious_reservoir>=1))||((s3_1>=1)&&(n5_1>=1)))))))] != FALSE
(forward)formula 13,1,0.995136,46676,1,0,684,192937,255,430,3033,191688,773
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AF((EF((s6_0>=1)) * EG(((Sstart_0>=1)&&(n1_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (s6_0>=1)) * EG(((Sstart_0>=1)&&(n1_0>=1))))))] = FALSE
(forward)formula 14,0,0.995939,46940,1,0,684,192937,260,431,3033,191704,774
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !((A(!(((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))) U (((malicious_reservoir>=1)&&(c1_2>=1))||((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1)))) + EG(EF(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EG(E(TRUE U ((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1)))))),!((((malicious_reservoir>=1)&&(c1_2>=1))||((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1))))) * (!(!(((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1)))) * !((((malicious_reservoir>=1)&&(c1_2>=1))||((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1))))))] != FALSE + [FwdG((Init * !(EG(E(TRUE U ((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1)))))),!((((malicious_reservoir>=1)&&(c1_2>=1))||((((n7_0_1>=1)&&(Cstart_1>=1))&&(n7_1_1>=1))&&(n7_2_1>=1)))))] != FALSE)
Hit Full ! (commute/partial/dont) 29/24/27
Hit Full ! (commute/partial/dont) 29/24/27
(forward)formula 15,1,1.01907,47732,1,0,694,194135,281,440,3124,193496,789
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
BK_STOP 1554175325079
--------------------
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
Apr 02, 2019 3:22:03 AM 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]
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 44 ms
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Apr 02, 2019 3:22:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 56 transitions.
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 86 places.
Apr 02, 2019 3:22:03 AM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 56 transitions.
Apr 02, 2019 3:22:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
Apr 02, 2019 3:22:03 AM 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="QuasiCertifProtocol-PT-02"
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 QuasiCertifProtocol-PT-02, 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 r204-oct2-155274856700257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 '
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 ;