Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390900780.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r126-tajo-158961390900780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.8K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K Mar 24 05:37 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 1589857644459

[2020-05-19 03:07:26] [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, -timeout, 3600]
[2020-05-19 03:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 03:07:26] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-05-19 03:07:26] [INFO ] Transformed 86 places.
[2020-05-19 03:07:26] [INFO ] Transformed 56 transitions.
[2020-05-19 03:07:26] [INFO ] Parsed PT model containing 86 places and 56 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Incomplete random walk after 100000 steps, including 16427 resets, run finished after 344 ms. (steps per millisecond=290 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0]
// Phase 1: matrix 56 rows 86 cols
[2020-05-19 03:07:26] [INFO ] Computed 31 place invariants in 7 ms
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-19 03:07:26] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:26] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-05-19 03:07:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 03:07:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:27] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2020-05-19 03:07:27] [INFO ] Added : 22 causal constraints over 5 iterations in 30 ms. Result :sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:27] [INFO ] Added : 16 causal constraints over 4 iterations in 23 ms. Result :sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:27] [INFO ] Added : 14 causal constraints over 3 iterations in 17 ms. Result :sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2020-05-19 03:07:27] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2020-05-19 03:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 03:07:27] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-19 03:07:27] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2020-05-19 03:07:27] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-19 03:07:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 03:07:27] [INFO ] Flatten gal took : 29 ms
[2020-05-19 03:07:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 03:07:27] [INFO ] Flatten gal took : 9 ms
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 03:07:27] [INFO ] Applying decomposition
[2020-05-19 03:07:27] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10502474320711502585.txt, -o, /tmp/graph10502474320711502585.bin, -w, /tmp/graph10502474320711502585.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10502474320711502585.bin, -l, -1, -v, -w, /tmp/graph10502474320711502585.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 03:07:27] [INFO ] Decomposing Gal with order
[2020-05-19 03:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 03:07:27] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-19 03:07:27] [INFO ] Flatten gal took : 29 ms
[2020-05-19 03:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2020-05-19 03:07:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-19 03:07:27] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 13 CTL formulae.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
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.033058,5860,571,105,2481,204,277,4116,60,563,0


Converting to forward existential form...Done !
original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.098306,9676,1,0,8286,1003,952,17507,272,3279,24274
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1))||((u0.s3_0>=1)&&(i4.i1.u20.n5_0>=1)))||((i6.i1.u17.s3_1>=1)&&(i4.i1.u15.n5_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1))||((u0.s3_0>=1)&&(i4.i1.u20.n5_0>=1)))||((i6.i1.u17.s3_1>=1)&&(i4.i1.u15.n5_1>=1)))))] = FALSE
(forward)formula 1,0,0.102098,9940,1,0,8774,1003,996,17870,272,3280,25926
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(AF((i4.i0.u7.a2>=1))) * EF(((((((i4.i0.u7.a1>=1)||(i4.i0.u7.a4>=1))||(i4.i0.u7.a3<1))||(i6.i1.u14.n4_1<1))||(i5.u18.n4_2<1))||(i4.i0.u16.n4_0<1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!((i4.i0.u7.a2>=1)))] = FALSE * [(Init * !(E(TRUE U ((((((i4.i0.u7.a1>=1)||(i4.i0.u7.a4>=1))||(i4.i0.u7.a3<1))||(i6.i1.u14.n4_1<1))||(i5.u18.n4_2<1))||(i4.i0.u16.n4_0<1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions malS6_1, malS5_0, malS6_2, malC1_0, malC1_2, malC1_1, malS3_1, malS3_2, malS1_1, malS2_2, u0.malS3_0, u0.malS1_0, u0.malS2_0, i4.i0.u7.malA5, i4.i0.u7.malA3, i4.i0.u7.malA1, i4.i0.u7.malA2, i4.i0.u7.malA4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/18/48
(forward)formula 2,0,0.124641,10732,1,0,10438,1036,1506,21083,380,3419,34694
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(EG(((((u0.malicious_reservoir<1)||(i6.i0.u3.Sstart_1<1))&&((u0.malicious_reservoir<1)||(u0.Sstart_0<1)))&&((u0.malicious_reservoir<1)||(i5.u11.Sstart_2<1))))) + EG(((((i4.i0.u7.a1>=1)&&(i6.i0.u12.n2_0>=1))&&(i6.i0.u3.n2_1>=1))&&(i5.u11.n2_2>=1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),((((u0.malicious_reservoir<1)||(i6.i0.u3.Sstart_1<1))&&((u0.malicious_reservoir<1)||(u0.Sstart_0<1)))&&((u0.malicious_reservoir<1)||(i5.u11.Sstart_2<1))))] != FALSE + [FwdG(Init,((((i4.i0.u7.a1>=1)&&(i6.i0.u12.n2_0>=1))&&(i6.i0.u3.n2_1>=1))&&(i5.u11.n2_2>=1)))] != FALSE)
(forward)formula 3,1,0.126621,10732,1,0,10570,1036,1536,21217,383,3419,35489
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((((i4.i0.u7.a1>=1)&&(i6.i0.u12.n2_0>=1))&&(i6.i0.u3.n2_1>=1))&&(i5.u11.n2_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((i4.i0.u7.a1>=1)&&(i6.i0.u12.n2_0>=1))&&(i6.i0.u3.n2_1>=1))&&(i5.u11.n2_2>=1))))] = FALSE
(forward)formula 4,0,0.128326,10996,1,0,10754,1036,1564,21364,383,3419,36039
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(EG((((i1.u4.s4_0>=1)||(i2.u5.s4_2>=1))||(i3.u6.s4_1>=1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((((i1.u4.s4_0>=1)||(i2.u5.s4_2>=1))||(i3.u6.s4_1>=1)))))] = FALSE
(forward)formula 5,0,0.12994,10996,1,0,10801,1038,1581,21448,383,3421,36709
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(EG(AF(((u0.malicious_reservoir>=1)&&(i6.i1.u17.s2_1>=1))))) * !(AF((((i2.u2.s6_2<1)&&(u0.malicious_reservoir>=1))&&(i2.u5.s5_2>=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(!(((u0.malicious_reservoir>=1)&&(i6.i1.u17.s2_1>=1))))))] = FALSE * [(Init * !(EG(!((((i2.u2.s6_2<1)&&(u0.malicious_reservoir>=1))&&(i2.u5.s5_2>=1))))))] = FALSE)
dead was empty
(forward)formula 6,1,0.179103,12844,1,0,14635,1069,1632,26921,384,3572,45049
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 7,1,0.181149,12844,1,0,14635,1069,1632,26921,384,3572,45049
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((((u0.malicious_reservoir>=1)&&(i2.u5.s5_2>=1))||(u0.malicious_reservoir<1))||(i3.u6.s4_1<1))) * EX((((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1)) + AF(((u0.malicious_reservoir>=1)&&(i2.u5.s4_2>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((u0.malicious_reservoir>=1)&&(i2.u5.s5_2>=1))||(u0.malicious_reservoir<1))||(i3.u6.s4_1<1))))] = FALSE * [(Init * !(EX((((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1)) + !(EG(!(((u0.malicious_reservoir>=1)&&(i2.u5.s4_2>=1)))))))))] = FALSE)
(forward)formula 8,0,0.22771,13372,1,0,15702,1070,1651,27970,384,3574,47974
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1))) * !(AG(((i4.i0.u7.a4>=1)||((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1))))] = FALSE * [(Init * !(E(TRUE U !(((i4.i0.u7.a4>=1)||((u0.malicious_reservoir>=1)&&(i1.u9.c1_2>=1)))))))] = FALSE)
(forward)formula 9,0,0.256667,14164,1,0,16718,1070,1681,29192,384,3586,51288
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1)) + (EG(((((i3.u6.n7_1_0>=1)&&(i2.u5.n7_2_0>=1))&&(i1.u4.n7_0_0>=1))&&(i2.u10.Cstart_0>=1))) * (((u0.malicious_reservoir<1)||(u0.s2_0<1))||((((u0.malicious_reservoir>=1)&&(i1.u1.s6_0>=1))&&(i6.i0.u3.Sstart_1>=1))&&(i6.i0.u13.n1_1>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1)) + (EG(((((i3.u6.n7_1_0>=1)&&(i2.u5.n7_2_0>=1))&&(i1.u4.n7_0_0>=1))&&(i2.u10.Cstart_0>=1))) * (((u0.malicious_reservoir<1)||(u0.s2_0<1))||((((u0.malicious_reservoir>=1)&&(i1.u1.s6_0>=1))&&(i6.i0.u3.Sstart_1>=1))&&(i6.i0.u13.n1_1>=1)))))))] = FALSE
(forward)formula 10,0,0.265579,14428,1,0,16896,1070,1725,29419,385,3586,52340
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1))) * AF(((i5.u11.Sstart_2>=1)&&(i5.u11.n1_2>=1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i5.u18.s3_2>=1)&&(i4.i1.u21.n5_2>=1)))))] = FALSE * [FwdG(Init,!(((i5.u11.Sstart_2>=1)&&(i5.u11.n1_2>=1))))] = FALSE)
(forward)formula 11,0,0.273783,14692,1,0,16918,1070,1748,29446,387,3586,52480
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((((i4.i0.u7.a1<1)||(u0.malicious_reservoir<1))||(i3.u6.s5_1<1)) + AG(((i5.u11.s2_2>=1)&&(i5.u18.n3_2>=1)))) U ((u0.malicious_reservoir>=1)&&(i1.u4.s5_0>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((u0.malicious_reservoir>=1)&&(i1.u4.s5_0>=1)))))) * !(E(!(((u0.malicious_reservoir>=1)&&(i1.u4.s5_0>=1))) U (!(((((i4.i0.u7.a1<1)||(u0.malicious_reservoir<1))||(i3.u6.s5_1<1)) + !(E(TRUE U !(((i5.u11.s2_2>=1)&&(i5.u18.n3_2>=1))))))) * !(((u0.malicious_reservoir>=1)&&(i1.u4.s5_0>=1)))))))] != FALSE
(forward)formula 12,0,0.31874,15220,1,0,18585,1078,1787,31570,387,3611,56872
FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589857648359

--------------------
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 -timeout 3600
+ 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r126-tajo-158961390900780"
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" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;