Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972913600068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-015015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913600068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K Mar 24 05:38 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589873031393

[2020-05-19 07:23:53] [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 07:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 07:23:53] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2020-05-19 07:23:53] [INFO ] Transformed 79 places.
[2020-05-19 07:23:53] [INFO ] Transformed 63 transitions.
[2020-05-19 07:23:53] [INFO ] Parsed PT model containing 79 places and 63 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100006 steps, including 0 resets, run finished after 121 ms. (steps per millisecond=826 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-05-19 07:23:53] [INFO ] Computed 32 place invariants in 3 ms
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using 32 positive place invariants in 120 ms returned sat
[2020-05-19 07:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-05-19 07:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:23:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 35 ms returned sat
[2020-05-19 07:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2020-05-19 07:23:54] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 21 ms.
[2020-05-19 07:23:54] [INFO ] Added : 34 causal constraints over 7 iterations in 139 ms. Result :sat
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-05-19 07:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-19 07:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:23:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 25 ms returned sat
[2020-05-19 07:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:54] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-19 07:23:54] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 6 ms.
[2020-05-19 07:23:54] [INFO ] Added : 35 causal constraints over 7 iterations in 61 ms. Result :sat
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using 32 positive place invariants in 21 ms returned sat
[2020-05-19 07:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:54] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-19 07:23:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:23:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 31 ms returned sat
[2020-05-19 07:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:55] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-05-19 07:23:55] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 8 ms.
[2020-05-19 07:23:55] [INFO ] Added : 47 causal constraints over 10 iterations in 72 ms. Result :sat
[2020-05-19 07:23:55] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-05-19 07:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:55] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-19 07:23:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 07:23:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2020-05-19 07:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 07:23:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-05-19 07:23:55] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 8 ms.
[2020-05-19 07:23:55] [INFO ] Added : 30 causal constraints over 6 iterations in 46 ms. Result :sat
[2020-05-19 07:23:55] [INFO ] Flatten gal took : 37 ms
[2020-05-19 07:23:55] [INFO ] Flatten gal took : 9 ms
[2020-05-19 07:23:55] [INFO ] Applying decomposition
[2020-05-19 07:23:55] [INFO ] Flatten gal took : 34 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/graph5951324973135589807.txt, -o, /tmp/graph5951324973135589807.bin, -w, /tmp/graph5951324973135589807.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/graph5951324973135589807.bin, -l, -1, -v, -w, /tmp/graph5951324973135589807.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 07:23:55] [INFO ] Decomposing Gal with order
[2020-05-19 07:23:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 07:23:55] [INFO ] Flatten gal took : 54 ms
[2020-05-19 07:23:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-19 07:23:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-19 07:23:55] [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 16 CTL formulae.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 ordering constraints for composite.
built 3 ordering constraints for composite.
built 2 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,1.95522e+42,45.4968,325188,182,34,348403,20369,127,1.28713e+06,39,167270,0


Converting to forward existential form...Done !
original formula: AG((((i12.u29.p58<1)||(i12.u30.p59<1))||(i12.u31.p61<1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i12.u29.p58<1)||(i12.u30.p59<1))||(i12.u31.p61<1))))] = FALSE
(forward)formula 0,0,45.5016,325188,1,0,348403,20369,142,1.28713e+06,44,167270,57
FORMULA n0-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG(EF(((((i5.u12.p23>=1)&&(i5.u13.p24>=1))&&(i6.u14.p26>=1))||(i10.u25.p47>=1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((((i5.u12.p23>=1)&&(i5.u13.p24>=1))&&(i6.u14.p26>=1))||(i10.u25.p47>=1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 1,0,79.1886,331116,1,0,356728,22079,664,1.33828e+06,185,178514,293747
FORMULA n0-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((!(A((i8.u20.p39>=1) U (i9.u22.p42>=1))) * AG((i4.u11.p19>=1))) * (A((((i0.u0.p>=1)&&(i15.u37.p73>=1))&&(i15.u38.p74>=1)) U (((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i8.u21.p41>=1))) + EF((((i9.u22.p43>=1)&&(i9.u23.p44>=1))&&(i10.u24.p46>=1)))))
=> equivalent forward existential formula: (([((Init * !(EG(!((i9.u22.p42>=1))))) * !(E(!((i9.u22.p42>=1)) U (!((i8.u20.p39>=1)) * !((i9.u22.p42>=1))))))] = FALSE * [(FwdU(Init,TRUE) * !((i4.u11.p19>=1)))] = FALSE) * ([(FwdU((Init * !(E(TRUE U (((i9.u22.p43>=1)&&(i9.u23.p44>=1))&&(i10.u24.p46>=1))))),!((((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i8.u21.p41>=1)))) * (!((((i0.u0.p>=1)&&(i15.u37.p73>=1))&&(i15.u38.p74>=1))) * !((((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i8.u21.p41>=1)))))] = FALSE * [FwdG((Init * !(E(TRUE U (((i9.u22.p43>=1)&&(i9.u23.p44>=1))&&(i10.u24.p46>=1))))),!((((i8.u19.p38>=1)&&(i8.u20.p39>=1))&&(i8.u21.p41>=1))))] = FALSE))
(forward)formula 2,0,79.1977,331908,1,0,357775,22079,719,1.33929e+06,185,178520,295024
FORMULA n0-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1)))] != FALSE
(forward)formula 3,1,79.1986,331908,1,0,357872,22079,732,1.33947e+06,185,178520,295138
FORMULA n0-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((((i9.u23.p44>=1) + EG((i15.u38.p74>=1))) + ((i11.u28.p55<1)&&(i11.u27.p52<1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((i11.u28.p55<1)&&(i11.u27.p52<1)))) * !((i9.u23.p44>=1))) * !(EG((i15.u38.p74>=1))))] = FALSE
(forward)formula 4,0,79.1999,331908,1,0,358044,22079,753,1.33964e+06,185,178522,295227
FORMULA n0-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(AF(((i4.u11.p19>=1)||(((i14.u35.p68>=1)&&(i14.u36.p69>=1))&&(i14.u34.p71>=1))))) + E(EX((i12.u30.p60>=1)) U ((i8.u20.p39<1)&&(i4.u11.p19<1))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(EX((i12.u30.p60>=1)) U ((i8.u20.p39<1)&&(i4.u11.p19<1))))),TRUE),!(((i4.u11.p19>=1)||(((i14.u35.p68>=1)&&(i14.u36.p69>=1))&&(i14.u34.p71>=1)))))] = FALSE
(forward)formula 5,1,79.2037,332172,1,0,358421,22083,777,1.34024e+06,185,178532,295790
FORMULA n0-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((((((i6.u16.p29>=1)&&(i6.u15.p28>=1))&&(i6.u14.p31>=1))&&(i1.u2.p2<1))||(((i8.u19.p37>=1)&&(i15.u38.p75>=1))&&(i10.u26.p49>=1))) U EF(((i1.u2.p2>=1)||(((i1.u2.p3>=1)&&(i1.u3.p4>=1))&&(i2.u4.p6>=1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(((((i6.u16.p29>=1)&&(i6.u15.p28>=1))&&(i6.u14.p31>=1))&&(i1.u2.p2<1))||(((i8.u19.p37>=1)&&(i15.u38.p75>=1))&&(i10.u26.p49>=1)))),TRUE) * ((i1.u2.p2>=1)||(((i1.u2.p3>=1)&&(i1.u3.p4>=1))&&(i2.u4.p6>=1))))] != FALSE
(forward)formula 6,1,79.2068,332172,1,0,358835,22083,822,1.34068e+06,185,178532,296166
FORMULA n0-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((i7.u18.p34>=1)||(i9.u23.p44>=1)) U (EG((i4.u10.p17>=1)) * (i7.u18.p35<1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,((i7.u18.p34>=1)||(i9.u23.p44>=1))) * (i7.u18.p35<1)),(i4.u10.p17>=1))] != FALSE
(forward)formula 7,1,148.835,917992,1,0,967715,24246,887,3.09004e+06,185,205744,769211
FORMULA n0-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AG((((i6.u15.p28<1)||(i6.u16.p29<1))||(i6.u14.p31<1))) + AG((i7.u18.p34>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((((i6.u15.p28<1)||(i6.u16.p29<1))||(i6.u14.p31<1))))) + !(E(TRUE U !((i7.u18.p34>=1)))))))] = FALSE
(forward)formula 8,0,148.842,918256,1,0,968167,24253,898,3.09042e+06,185,205756,770537
FORMULA n0-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i3.u7.p12>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i3.u7.p12>=1))] != FALSE
(forward)formula 9,1,148.842,918256,1,0,968270,24253,899,3.0905e+06,185,205756,770627
FORMULA n0-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(EX((i10.u26.p50>=1))) * (EF(((((i12.u29.p58>=1)&&(i12.u30.p59>=1))&&(i12.u31.p61>=1))&&(i14.u35.p67>=1))) + AG(((((i3.u8.p15>=1)&&(i11.u27.p53>=1))&&(i11.u28.p54>=1))&&(i12.u31.p56>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX((i10.u26.p50>=1))))] = FALSE * [(FwdU((Init * !(E(TRUE U ((((i12.u29.p58>=1)&&(i12.u30.p59>=1))&&(i12.u31.p61>=1))&&(i14.u35.p67>=1))))),TRUE) * !(((((i3.u8.p15>=1)&&(i11.u27.p53>=1))&&(i11.u28.p54>=1))&&(i12.u31.p56>=1))))] = FALSE)
(forward)formula 10,1,148.852,918784,1,0,969418,24253,922,3.0914e+06,185,205756,772256
FORMULA n0-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(AG((((i5.u12.p23>=1)&&(i5.u13.p24>=1))&&(i6.u14.p26>=1)))) U (AX((i12.u29.p57>=1)) * ((((i2.u5.p8>=1)&&(i2.u6.p9>=1))&&(i2.u4.p11>=1))||((((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1))&&(i7.u17.p32>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,!(!(E(TRUE U !((((i5.u12.p23>=1)&&(i5.u13.p24>=1))&&(i6.u14.p26>=1))))))) * ((((i2.u5.p8>=1)&&(i2.u6.p9>=1))&&(i2.u4.p11>=1))||((((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1))&&(i7.u17.p32>=1)))) * !(EX(!((i12.u29.p57>=1)))))] != FALSE
(forward)formula 11,1,148.857,919048,1,0,969916,24253,938,3.092e+06,185,205756,772812
FORMULA n0-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG((i10.u25.p47<1)) + AX(((i4.u11.p19<1)&&(((i12.u29.p58<1)||(i12.u30.p59<1))||(i12.u31.p61<1)))))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !((i10.u25.p47<1))))))) * !(((i4.u11.p19<1)&&(((i12.u29.p58<1)||(i12.u30.p59<1))||(i12.u31.p61<1)))))] = FALSE
(forward)formula 12,0,148.86,919048,1,0,970216,24253,942,3.09236e+06,185,205757,773361
FORMULA n0-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((A((i11.u27.p52>=1) U (((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i8.u21.p36>=1))) + (i1.u3.p4>=1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !((i1.u3.p4>=1))),!((((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i8.u21.p36>=1)))) * (!((i11.u27.p52>=1)) * !((((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i8.u21.p36>=1)))))] = FALSE * [FwdG((FwdU(Init,TRUE) * !((i1.u3.p4>=1))),!((((i7.u17.p33>=1)&&(i7.u18.p34>=1))&&(i8.u21.p36>=1))))] = FALSE)
(forward)formula 13,0,148.872,919312,1,0,971343,24253,976,3.09388e+06,185,205760,774872
FORMULA n0-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1))) + AF(((((((i9.u22.p43>=1)&&(i9.u23.p44>=1))&&(i10.u24.p46>=1))&&(i1.u2.p3>=1))&&(i1.u3.p4>=1))&&(i2.u4.p6>=1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((i6.u15.p28>=1)&&(i6.u16.p29>=1))&&(i6.u14.p31>=1))))),!(((((((i9.u22.p43>=1)&&(i9.u23.p44>=1))&&(i10.u24.p46>=1))&&(i1.u2.p3>=1))&&(i1.u3.p4>=1))&&(i2.u4.p6>=1))))] = FALSE
(forward)formula 14,1,148.873,919576,1,0,971471,24253,995,3.09394e+06,185,205760,774984
FORMULA n0-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(!(EG((i11.u28.p54<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i11.u28.p54<1))] = FALSE
(forward)formula 15,0,148.875,919576,1,0,971669,24253,1015,3.09407e+06,185,205760,775353
FORMULA n0-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589873184953

--------------------
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="RefineWMG-PT-015015"
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 RefineWMG-PT-015015, 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 r156-oct2-158972913600068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015015.tgz
mv RefineWMG-PT-015015 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 ;