fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r143-qhx2-152673584300010
Last Updated
June 26, 2018

About the Execution of M4M.struct for QuasiCertifProtocol-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
749.460 69720.00 62640.00 1757.90 TFFTFFTTTTTFTTTF 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 204K
-rw-r--r-- 1 mcc users 3.9K 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 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 34K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-qhx2-152673584300010
=====================================================================


--------------------
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-COL-02-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527978247361


BK_STOP 1527978317081

--------------------
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-COL-02 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 144, 'Memory': 106.7, 'Tool': 'lola'}, {'Time': 185, 'Memory': 107.28, 'Tool': 'lola'}, {'Time': 882, 'Memory': 105.95, 'Tool': 'gspn'}, {'Time': 2771, 'Memory': 164.66, 'Tool': 'gspn'}, {'Time': 4377, 'Memory': 278.36, 'Tool': 'itstools'}, {'Time': 4755, 'Memory': 2228.5, 'Tool': 'marcie'}, {'Time': 4792, 'Memory': 2228.89, 'Tool': 'marcie'}, {'Time': 5619, 'Memory': 272.66, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 30.395833333333332x far from the best tool lola.
CTLCardinality itstools QuasiCertifProtocol-COL-02...
Jun 02, 2018 10:24:27 PM 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, CTLCardinality]
Jun 02, 2018 10:24:27 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 02, 2018 10:24:28 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
22:25:08.893 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
22:25:08.899 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 42085 ms
Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 30 places.
Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 26 transitions.
Jun 02, 2018 10:25:09 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 02, 2018 10:25:09 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 34 ms
Jun 02, 2018 10:25:10 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 162 ms
Jun 02, 2018 10:25:11 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/CTLCardinality.pnml.gal : 26 ms
Jun 02, 2018 10:25:11 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /mcc-data/CTLCardinality.ctl : 3 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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /mcc-data/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /mcc-data/CTLCardinality.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.175809,5800,2,1711,5,5403,6,0,394,3514,0


Converting to forward existential form...Done !
original formula: (((a4_0>=1) + EF(((((s4_0+s4_1)+s4_2)>=2)&&(((SstopOK_0+SstopOK_1)+SstopOK_2)>=1)))) + EG((((c1_0+c1_1)+c1_2)<=((n1_0+n1_1)+n1_2))))
=> equivalent forward existential formula: (([(Init * (a4_0>=1))] != FALSE + [(FwdU(Init,TRUE) * ((((s4_0+s4_1)+s4_2)>=2)&&(((SstopOK_0+SstopOK_1)+SstopOK_2)>=1)))] != FALSE) + [FwdG(Init,(((c1_0+c1_1)+c1_2)<=((n1_0+n1_1)+n1_2)))] != FALSE)
Hit Full ! (commute/partial/dont) 31/0/11
(forward)formula 0,1,0.735973,14944,1,0,42,38267,20,4,2038,25296,38
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(E((CstopAbort_0>=1) U (AstopOK_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(E((CstopAbort_0>=1) U (AstopOK_0>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions malC1, malS6, malS5, malS4, malS3, malS2, malS1, malA5, malA3, malA4, malA2, malA1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/12/42
(forward)formula 1,0,1.32272,24108,1,0,218,86047,118,118,2531,84402,199
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((!((((c1_0+c1_1)+c1_2)<=SstopAbort_0)||(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)<=((n6_0+n6_1)+n6_2))))&&((!(((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8)<=((s5_0+s5_1)+s5_2)))||(((s5_0+s5_1)+s5_2)<=a2_0))))
=> equivalent forward existential formula: [FwdG(Init,!(((!((((c1_0+c1_1)+c1_2)<=SstopAbort_0)||(((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)<=((n6_0+n6_1)+n6_2))))&&((!(((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8)<=((s5_0+s5_1)+s5_2)))||(((s5_0+s5_1)+s5_2)<=a2_0)))))] = FALSE
Hit Full ! (commute/partial/dont) 16/0/26
(forward)formula 2,0,1.59502,27012,1,0,219,94272,126,120,2823,93376,202
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((A((((n6_0+n6_1)+n6_2)>=3) U (AstopOK_0<=SstopAbort_0)) + E((((s5_0+s5_1)+s5_2)>=2) U (((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=1))) * EG((((CstopOK_0+CstopOK_1)+CstopOK_2)<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8))))
=> equivalent forward existential formula: [FwdG((Init * (!((E(!((AstopOK_0<=SstopAbort_0)) U (!((((n6_0+n6_1)+n6_2)>=3)) * !((AstopOK_0<=SstopAbort_0)))) + EG(!((AstopOK_0<=SstopAbort_0))))) + E((((s5_0+s5_1)+s5_2)>=2) U (((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8)>=1)))),(((CstopOK_0+CstopOK_1)+CstopOK_2)<=((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8)))] != FALSE
Hit Full ! (commute/partial/dont) 36/0/6
(forward)formula 3,1,1.81703,28860,1,0,299,105317,147,173,3045,109853,314
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(!(EF((Astart_0<=((Sstart_0+Sstart_1)+Sstart_2)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U (Astart_0<=((Sstart_0+Sstart_1)+Sstart_2))))))] = FALSE
(forward)formula 4,0,1.89543,30180,1,0,302,111356,154,177,3128,116534,323
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((A((CstopAbort_0<=((s5_0+s5_1)+s5_2)) U (((n3_0+n3_1)+n3_2)>=2)) * (AX((Astart_0>=2)) + (((a3_0>=1)&&(((n3_0+n3_1)+n3_2)>=2))&&(!(((Cstart_0+Cstart_1)+Cstart_2)>=3))))) + AX(AF((((n1_0+n1_1)+n1_2)<=((c1_0+c1_1)+c1_2)))))
=> equivalent forward existential formula: [FwdG(EY((Init * !((!((E(!((((n3_0+n3_1)+n3_2)>=2)) U (!((CstopAbort_0<=((s5_0+s5_1)+s5_2))) * !((((n3_0+n3_1)+n3_2)>=2)))) + EG(!((((n3_0+n3_1)+n3_2)>=2))))) * (!(EX(!((Astart_0>=2)))) + (((a3_0>=1)&&(((n3_0+n3_1)+n3_2)>=2))&&(!(((Cstart_0+Cstart_1)+Cstart_2)>=3)))))))),!((((n1_0+n1_1)+n1_2)<=((c1_0+c1_1)+c1_2))))] = FALSE
Hit Full ! (commute/partial/dont) 31/0/11
(forward)formula 5,0,2.35838,37936,1,0,459,159901,174,272,3195,167478,513
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((CstopAbort_0>=1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (CstopAbort_0>=1)))] != FALSE
(forward)formula 6,1,2.512,40048,1,0,549,170754,177,339,3195,185415,586
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((((s3_0+s3_1)+s3_2)<=((Cstart_0+Cstart_1)+Cstart_2)))
=> equivalent forward existential formula: [FwdG(Init,(((s3_0+s3_1)+s3_2)<=((Cstart_0+Cstart_1)+Cstart_2)))] != FALSE
(forward)formula 7,1,2.52124,40312,1,0,549,170761,178,339,3215,185430,587
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((Sstart_0+Sstart_1)+Sstart_2)>=3) U EG((((n4_0+n4_1)+n4_2)<=((s2_0+s2_1)+s2_2))))
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((n4_0+n4_1)+n4_2)<=((s2_0+s2_1)+s2_2))))))) * !(E(!(EG((((n4_0+n4_1)+n4_2)<=((s2_0+s2_1)+s2_2)))) U (!((((Sstart_0+Sstart_1)+Sstart_2)>=3)) * !(EG((((n4_0+n4_1)+n4_2)<=((s2_0+s2_1)+s2_2))))))))] != FALSE
(forward)formula 8,1,2.68036,42424,1,0,648,186579,187,402,3248,200820,694
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AstopAbort_0<=((Sstart_0+Sstart_1)+Sstart_2)))
=> equivalent forward existential formula: [FwdG(Init,(AstopAbort_0<=((Sstart_0+Sstart_1)+Sstart_2)))] != FALSE
Hit Full ! (commute/partial/dont) 33/0/9
(forward)formula 9,1,2.75438,43744,1,0,650,189081,194,405,3334,203932,697
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EG(!((((Cstart_0+Cstart_1)+Cstart_2)<=((s3_0+s3_1)+s3_2)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((Cstart_0+Cstart_1)+Cstart_2)<=((s3_0+s3_1)+s3_2))))))] = FALSE
(forward)formula 10,1,2.81482,44536,1,0,686,194875,199,426,3356,209498,735
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((((a5_0<=((s3_0+s3_1)+s3_2))||((((Sstart_0+Sstart_1)+Sstart_2)<=((SstopOK_0+SstopOK_1)+SstopOK_2))&&(((Cstart_0+Cstart_1)+Cstart_2)>=2)))&&(((AstopAbort_0>=1)&&(((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8)<=a4_0))&&(!(((Cstart_0+Cstart_1)+Cstart_2)<=a4_0)))))
=> equivalent forward existential formula: [FwdG(Init,!((((a5_0<=((s3_0+s3_1)+s3_2))||((((Sstart_0+Sstart_1)+Sstart_2)<=((SstopOK_0+SstopOK_1)+SstopOK_2))&&(((Cstart_0+Cstart_1)+Cstart_2)>=2)))&&(((AstopAbort_0>=1)&&(((((((((n8_0+n8_1)+n8_2)+n8_3)+n8_4)+n8_5)+n8_6)+n8_7)+n8_8)<=a4_0))&&(!(((Cstart_0+Cstart_1)+Cstart_2)<=a4_0))))))] = FALSE
Hit Full ! (commute/partial/dont) 14/0/28
(forward)formula 11,0,3.09438,47416,1,0,688,201417,207,429,3526,216484,738
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(AG((((s5_0+s5_1)+s5_2)>=2))) + EG(((!(((n3_0+n3_1)+n3_2)>=3))&&((((s4_0+s4_1)+s4_2)<=a2_0)||(((n5_0+n5_1)+n5_2)>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((((s5_0+s5_1)+s5_2)>=2)))))] != FALSE + [FwdG(Init,((!(((n3_0+n3_1)+n3_2)>=3))&&((((s4_0+s4_1)+s4_2)<=a2_0)||(((n5_0+n5_1)+n5_2)>=1))))] != FALSE)
Hit Full ! (commute/partial/dont) 28/3/14
(forward)formula 12,1,3.13709,47944,1,0,697,203623,215,436,3631,218502,749
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((A((((n4_0+n4_1)+n4_2)<=SstopAbort_0) U (a5_0>=3)) * AX(((((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8)>=3)&&(((c1_0+c1_1)+c1_2)<=((s5_0+s5_1)+s5_2))))) + (EG(((((Sstart_0+Sstart_1)+Sstart_2)<=((s2_0+s2_1)+s2_2))||(((n3_0+n3_1)+n3_2)<=((n4_0+n4_1)+n4_2)))) + E((((n2_0+n2_1)+n2_2)>=2) U (((s4_0+s4_1)+s4_2)>=3))))
=> equivalent forward existential formula: (([(FwdU((Init * !((EG(((((Sstart_0+Sstart_1)+Sstart_2)<=((s2_0+s2_1)+s2_2))||(((n3_0+n3_1)+n3_2)<=((n4_0+n4_1)+n4_2)))) + E((((n2_0+n2_1)+n2_2)>=2) U (((s4_0+s4_1)+s4_2)>=3))))),!((a5_0>=3))) * (!((((n4_0+n4_1)+n4_2)<=SstopAbort_0)) * !((a5_0>=3))))] = FALSE * [FwdG((Init * !((EG(((((Sstart_0+Sstart_1)+Sstart_2)<=((s2_0+s2_1)+s2_2))||(((n3_0+n3_1)+n3_2)<=((n4_0+n4_1)+n4_2)))) + E((((n2_0+n2_1)+n2_2)>=2) U (((s4_0+s4_1)+s4_2)>=3))))),!((a5_0>=3)))] = FALSE) * [(EY((Init * !((EG(((((Sstart_0+Sstart_1)+Sstart_2)<=((s2_0+s2_1)+s2_2))||(((n3_0+n3_1)+n3_2)<=((n4_0+n4_1)+n4_2)))) + E((((n2_0+n2_1)+n2_2)>=2) U (((s4_0+s4_1)+s4_2)>=3)))))) * !(((((((((((n9_0+n9_1)+n9_2)+n9_3)+n9_4)+n9_5)+n9_6)+n9_7)+n9_8)>=3)&&(((c1_0+c1_1)+c1_2)<=((s5_0+s5_1)+s5_2)))))] = FALSE)
(forward)formula 13,1,3.34747,50056,1,0,710,210634,229,443,3778,224654,769
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AF(!(((((n2_0+n2_1)+n2_2)>=3)||(((SstopOK_0+SstopOK_1)+SstopOK_2)<=((n5_0+n5_1)+n5_2))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(((((n2_0+n2_1)+n2_2)>=3)||(((SstopOK_0+SstopOK_1)+SstopOK_2)<=((n5_0+n5_1)+n5_2))))))] != FALSE
Hit Full ! (commute/partial/dont) 31/0/11
(forward)formula 14,1,3.40096,50848,1,0,711,212138,236,446,3882,226400,772
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(((!(((CstopOK_0+CstopOK_1)+CstopOK_2)<=AstopAbort_0))&&((a2_0<=CstopAbort_0)||(SstopAbort_0<=((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8))))) + AF((((CstopAbort_0>=3)||(((n5_0+n5_1)+n5_2)>=1))&&((((n4_0+n4_1)+n4_2)<=a2_0)&&(a5_0>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(((!(((CstopOK_0+CstopOK_1)+CstopOK_2)<=AstopAbort_0))&&((a2_0<=CstopAbort_0)||(SstopAbort_0<=((((((((n7_0+n7_1)+n7_2)+n7_3)+n7_4)+n7_5)+n7_6)+n7_7)+n7_8))))))),!((((CstopAbort_0>=3)||(((n5_0+n5_1)+n5_2)>=1))&&((((n4_0+n4_1)+n4_2)<=a2_0)&&(a5_0>=1)))))] = FALSE
Hit Full ! (commute/partial/dont) 28/0/14
(forward)formula 15,0,3.47193,51640,1,0,719,213791,245,453,4043,227721,780
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-COL-02"
export BK_EXAMINATION="CTLCardinality"
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-COL-02.tgz
mv QuasiCertifProtocol-COL-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-COL-02, examination is CTLCardinality"
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-152673584300010"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;