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 236K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
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 r143-qhx2-152673584400060
=====================================================================

--------------------
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 1527992191289


BK_STOP 1527992219114

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-PT-02 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 150, 'Memory': 107.3, 'Tool': 'lola'}, {'Time': 359, 'Memory': 105.98, 'Tool': 'lola'}, {'Time': 734, 'Memory': 101.68, 'Tool': 'gspn'}, {'Time': 1902, 'Memory': 1960.52, 'Tool': 'marcie'}, {'Time': 2116, 'Memory': 2206, 'Tool': 'marcie'}, {'Time': 2516, 'Memory': 162.15, 'Tool': 'gspn'}, {'Time': 4754, 'Memory': 247.34, 'Tool': 'itstools'}, {'Time': 4823, 'Memory': 244.73, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 31.69333333333333x far from the best tool lola.
CTLFireability itstools QuasiCertifProtocol-PT-02...
Jun 03, 2018 2:16:52 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, CTLFireability]
Jun 03, 2018 2:16:52 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 03, 2018 2:16:53 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 83 ms
Jun 03, 2018 2:16:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 86 places.
Jun 03, 2018 2:16:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 56 transitions.
Jun 03, 2018 2:16:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 57 ms
Jun 03, 2018 2:16:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 70 ms
Jun 03, 2018 2:16:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/CTLFireability.pnml.gal : 3 ms
Jun 03, 2018 2:16:54 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /mcc-data/CTLFireability.ctl : 14 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /mcc-data/CTLFireability.pnml.gal, -t, CGAL, -ctl, /mcc-data/CTLFireability.ctl], workingDir=/mcc-data]

its-ctl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /mcc-data/CTLFireability.pnml.gal -t CGAL -ctl /mcc-data/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,1029,0.200721,5940,2,2408,5,6946,6,0,365,5498,0


Converting to forward existential form...Done !
original formula: ((a4>=1) + AF((((!(a4>=1))||((a4>=1)||(a5>=1)))&&(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))||(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))||(((s4_1>=1)||(s4_0>=1))||(s4_2>=1)))))))
=> equivalent forward existential formula: [FwdG((Init * !((a4>=1))),!((((!(a4>=1))||((a4>=1)||(a5>=1)))&&(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))||(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))||(((s4_1>=1)||(s4_0>=1))||(s4_2>=1)))))))] = FALSE
Hit Full ! (commute/partial/dont) 13/0/43
(forward)formula 0,0,0.97138,17468,1,0,40,47055,21,4,1995,27161,38
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !((AF((((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))&&(a3>=1)))) * !(AG(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))&&(a3>=1)))))] != FALSE + [(Init * !(E(TRUE U !(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))))))] != FALSE)
(forward)formula 1,1,1.01071,17996,1,0,40,47487,24,6,2084,29633,41
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AF((((!(Astart>=1))&&(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&(a2>=1))) * EF(((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1)))))) * A((((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=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)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))))))
=> equivalent forward existential formula: ([FwdG(Init,!((((!(Astart>=1))&&(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&(a2>=1))) * E(TRUE U ((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1)))))))] = FALSE * ([(FwdU(Init,!(((((((((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)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))))) * (!((((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))))) * !(((((((((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)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))))))] = FALSE * [FwdG(Init,!(((((((((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)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))||(!((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))))))] = FALSE))
dead was empty
Reverse transition relation is NOT exact ! Due to transitions malS6_1, malS6_0, malS5_0, malS6_2, malC1_0, malC1_2, malC1_1, malS3_1, malS3_2, malS4_2, malS3_0, malS4_0, malS4_1, malS5_1, malS5_2, malA5, malA3, malS1_1, malS1_2, malS2_2, malS1_0, malS2_0, malS2_1, malA1, malA2, malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/26/56
(forward)formula 2,0,1.35713,23896,1,0,180,67093,155,66,2669,51310,163
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((((((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1)) * AG((Astart>=1))) + (EX(((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))) * (a5>=1))) + !(AF(((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1)))))) + !((!(AX(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) + (((!(((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))||(!(a4>=1))) * EX(((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))))))
=> equivalent forward existential formula: ([((((Init * !(!((!(!(EX(!(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))))) + (((!(((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))||(!(a4>=1))) * EX(((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))))))) * !(!(!(EG(!(((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1))))))))) * !((EX(((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))) * (a5>=1)))) * !(((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))))] = FALSE * [(FwdU((((Init * !(!((!(!(EX(!(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))))) + (((!(((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))||(!(a4>=1))) * EX(((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))))))) * !(!(!(EG(!(((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1))))))))) * !((EX(((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))) * (a5>=1)))),TRUE) * !((Astart>=1)))] = FALSE)
(forward)formula 3,1,1.92034,29176,1,0,271,113085,170,120,2702,95439,261
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (A(EG((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))) U AF(((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1)))) * ((a2>=1)||((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))))
=> equivalent forward existential formula: [(((Init * ((a2>=1)||((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) * !(EG(!(!(EG(!(((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1))))))))) * !(E(!(!(EG(!(((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1)))))) U (!(EG((((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))) * !(!(EG(!(((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1))))))))))] != FALSE
(forward)formula 4,0,2.13386,31552,1,0,319,123955,183,173,2713,112594,353
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EF((AF(((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1)))) + ((a4>=1)||(a1>=1)))) * A(((((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1)))&&((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1))))&&(!((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1))))) U AF(((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))))
=> equivalent forward existential formula: [(((Init * E(TRUE U (!(EG(!(((((malicious_reservoir>=1)&&(s4_2>=1))||((s4_0>=1)&&(malicious_reservoir>=1)))||((s4_1>=1)&&(malicious_reservoir>=1)))))) + ((a4>=1)||(a1>=1))))) * !(EG(!(!(EG(!(((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))))))))) * !(E(!(!(EG(!(((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))))) U (!(((((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1)))&&((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1))))&&(!((((s3_1>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s3_2>=1)))||((s3_0>=1)&&(malicious_reservoir>=1)))))) * !(!(EG(!(((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1)))))))))))] != FALSE
(forward)formula 5,0,2.1989,32080,1,0,394,127305,194,229,2735,117152,452
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((((((((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))||((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))&&(!((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) * EF(((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))) * !(AF((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))))) + EX(((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))&&((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))||(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))))) + ((AX(((a2>=1)||((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1))))) + EX((((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1))||((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))) + AF((((s6_1>=1)||(s6_0>=1))||(s6_2>=1)))))
=> equivalent forward existential formula: [FwdG(((Init * !((((((((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))||((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))&&(!((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))) * E(TRUE U ((((s2_2>=1)&&(n3_2>=1))||((s2_1>=1)&&(n3_1>=1)))||((s2_0>=1)&&(n3_0>=1))))) * !(!(EG(!((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))))))) + EX(((((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))&&((((s2_2>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_0>=1)))||((malicious_reservoir>=1)&&(s2_1>=1))))||(((((malicious_reservoir>=1)&&(c1_0>=1))||((malicious_reservoir>=1)&&(c1_2>=1)))||((c1_1>=1)&&(malicious_reservoir>=1)))&&((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))))))) * !((!(EX(!(((a2>=1)||((((s3_2>=1)&&(n5_2>=1))||((s3_1>=1)&&(n5_1>=1)))||((s3_0>=1)&&(n5_0>=1))))))) + EX((((((n2_0>=1)&&(n2_1>=1))&&(n2_2>=1))&&(a1>=1))||((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s5_1>=1)))||((s5_2>=1)&&(malicious_reservoir>=1)))))))),!((((s6_1>=1)||(s6_0>=1))||(s6_2>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 47/18/9
(forward)formula 6,0,2.35436,33904,1,0,447,136898,209,261,2838,127396,513
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(EG(AF(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(((((malicious_reservoir>=1)&&(Sstart_1>=1))||((malicious_reservoir>=1)&&(Sstart_2>=1)))||((malicious_reservoir>=1)&&(Sstart_0>=1)))))))))] = FALSE
(forward)formula 7,0,2.38178,34432,1,0,493,138199,215,299,2838,130124,584
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((!(((s5_2>=1)&&(malicious_reservoir>=1))) * !((((s2_2>=1)&&(n3_2>=1)) + AF(((malicious_reservoir>=1)&&(s2_1>=1)))))) * !(AG(AX((s6_0>=1)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * (!(((s5_2>=1)&&(malicious_reservoir>=1))) * !((((s2_2>=1)&&(n3_2>=1)) + !(EG(!(((malicious_reservoir>=1)&&(s2_1>=1))))))))),TRUE)) * !((s6_0>=1)))] != FALSE
(forward)formula 8,1,2.4232,34960,1,0,548,140797,225,343,2839,133921,663
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (AF((((((s3_1>=1)&&(n5_1>=1))&&(s4_2>=1))||(!((s2_1>=1)&&(n3_1>=1)))) * AG((s4_2>=1)))) + ((s3_2>=1)&&(n5_2>=1)))
=> equivalent forward existential formula: [FwdG((Init * !(((s3_2>=1)&&(n5_2>=1)))),!((((((s3_1>=1)&&(n5_1>=1))&&(s4_2>=1))||(!((s2_1>=1)&&(n3_1>=1)))) * !(E(TRUE U !((s4_2>=1)))))))] = FALSE
(forward)formula 9,0,2.44432,35224,1,0,551,141421,230,345,2841,134831,672
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((a5>=1))
=> equivalent forward existential formula: [FwdG(Init,!((a5>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 53/0/3
(forward)formula 10,0,2.45152,35488,1,0,554,141430,237,348,2855,134848,675
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX(AF(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_1>=1)))||(((malicious_reservoir>=1)&&(s2_0>=1))&&((malicious_reservoir>=1)&&(Sstart_1>=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((((s5_0>=1)&&(malicious_reservoir>=1))||((malicious_reservoir>=1)&&(s2_1>=1)))||(((malicious_reservoir>=1)&&(s2_0>=1))&&((malicious_reservoir>=1)&&(Sstart_1>=1))))))] = FALSE
Hit Full ! (commute/partial/dont) 29/5/27
(forward)formula 11,0,2.47476,35488,1,0,557,142273,245,351,2939,135520,678
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((EF(((a5>=1)||((Sstart_2>=1)&&(n1_2>=1)))) * !(EX(((Sstart_0>=1)&&(n1_0>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((a5>=1)||((Sstart_2>=1)&&(n1_2>=1)))) * !(EX(((Sstart_0>=1)&&(n1_0>=1)))))))] = FALSE
(forward)formula 12,0,2.51998,36016,1,0,599,145528,250,382,2940,139842,713
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EF(((a2>=1)&&((malicious_reservoir>=1)&&(s3_2>=1)))) + AX((AF((a5>=1)) * !((((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1)))))))
=> equivalent forward existential formula: ([FwdG(EY((Init * !(E(TRUE U ((a2>=1)&&((malicious_reservoir>=1)&&(s3_2>=1))))))),!((a5>=1)))] = FALSE * [(EY((Init * !(E(TRUE U ((a2>=1)&&((malicious_reservoir>=1)&&(s3_2>=1))))))) * (((((n7_0_2>=1)&&(Cstart_2>=1))&&(n7_1_2>=1))&&(n7_2_2>=1))||((((n4_0>=1)&&(n4_1>=1))&&(n4_2>=1))&&(a3>=1))))] = FALSE)
Hit Full ! (commute/partial/dont) 53/0/3
(forward)formula 13,0,2.53619,36544,1,0,601,145571,252,385,2945,139980,717
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(AG((a5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((a5>=1))))))] = FALSE
(forward)formula 14,0,2.54597,36544,1,0,603,146268,252,387,2945,140410,722
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((n6_2>=1)&&(n6_1>=1))&&(n6_0>=1))&&(a5>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 50/0/6
(forward)formula 15,0,2.55898,36544,1,0,606,146633,259,390,2970,141080,725
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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="mcc4mcc-structural"
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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 mcc4mcc-structural"
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 r143-qhx2-152673584400060"
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 '' 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 ;