Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800524.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 Parking-PT-208, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.9K Apr 11 23:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 11 23:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 22:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 22:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 07:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 07:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 9 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 9 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-CTLFireability-00
FORMULA_NAME Parking-PT-208-CTLFireability-01
FORMULA_NAME Parking-PT-208-CTLFireability-02
FORMULA_NAME Parking-PT-208-CTLFireability-03
FORMULA_NAME Parking-PT-208-CTLFireability-04
FORMULA_NAME Parking-PT-208-CTLFireability-05
FORMULA_NAME Parking-PT-208-CTLFireability-06
FORMULA_NAME Parking-PT-208-CTLFireability-07
FORMULA_NAME Parking-PT-208-CTLFireability-08
FORMULA_NAME Parking-PT-208-CTLFireability-09
FORMULA_NAME Parking-PT-208-CTLFireability-10
FORMULA_NAME Parking-PT-208-CTLFireability-11
FORMULA_NAME Parking-PT-208-CTLFireability-12
FORMULA_NAME Parking-PT-208-CTLFireability-13
FORMULA_NAME Parking-PT-208-CTLFireability-14
FORMULA_NAME Parking-PT-208-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590000680667

[2020-05-20 18:51:22] [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-20 18:51:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:22] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-05-20 18:51:22] [INFO ] Transformed 137 places.
[2020-05-20 18:51:22] [INFO ] Transformed 201 transitions.
[2020-05-20 18:51:22] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:22] [INFO ] Parsed PT model containing 137 places and 201 transitions in 111 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Incomplete random walk after 100000 steps, including 2915 resets, run finished after 271 ms. (steps per millisecond=369 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 117 rows 137 cols
[2020-05-20 18:51:23] [INFO ] Computed 34 place invariants in 8 ms
[2020-05-20 18:51:23] [INFO ] [Real]Absence check using 32 positive place invariants in 34 ms returned sat
[2020-05-20 18:51:23] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:23] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-20 18:51:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-05-20 18:51:23] [INFO ] [Real]Added 26 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:23] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 13 ms.
[2020-05-20 18:51:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:23] [INFO ] [Nat]Absence check using 32 positive place invariants in 109 ms returned sat
[2020-05-20 18:51:23] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 6 ms returned sat
[2020-05-20 18:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:24] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-05-20 18:51:24] [INFO ] [Nat]Added 26 Read/Feed constraints in 9 ms returned sat
[2020-05-20 18:51:24] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 23 ms.
[2020-05-20 18:51:24] [INFO ] Added : 107 causal constraints over 22 iterations in 587 ms. Result :sat
[2020-05-20 18:51:24] [INFO ] [Real]Absence check using 32 positive place invariants in 33 ms returned sat
[2020-05-20 18:51:24] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Real]Added 26 Read/Feed constraints in 8 ms returned sat
[2020-05-20 18:51:25] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 19 ms.
[2020-05-20 18:51:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 36 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:25] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 18:51:25] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-05-20 18:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2020-05-20 18:51:25] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 8 ms.
[2020-05-20 18:51:25] [INFO ] Added : 110 causal constraints over 22 iterations in 397 ms. Result :sat
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned unsat
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:26] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Real]Added 26 Read/Feed constraints in 5 ms returned sat
[2020-05-20 18:51:26] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 13 ms.
[2020-05-20 18:51:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using 32 positive place invariants in 36 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2020-05-20 18:51:26] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints in 7 ms.
[2020-05-20 18:51:26] [INFO ] Added : 106 causal constraints over 22 iterations in 256 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-20 18:51:27] [INFO ] Flatten gal took : 87 ms
[2020-05-20 18:51:27] [INFO ] Flatten gal took : 18 ms
[2020-05-20 18:51:27] [INFO ] Applying decomposition
[2020-05-20 18:51:27] [INFO ] Flatten gal took : 28 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/graph8130732804269332190.txt, -o, /tmp/graph8130732804269332190.bin, -w, /tmp/graph8130732804269332190.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/graph8130732804269332190.bin, -l, -1, -v, -w, /tmp/graph8130732804269332190.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:51:27] [INFO ] Decomposing Gal with order
[2020-05-20 18:51:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:51:27] [INFO ] Removed a total of 4 redundant transitions.
[2020-05-20 18:51:27] [INFO ] Flatten gal took : 67 ms
[2020-05-20 18:51:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2020-05-20 18:51:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 19 ms
[2020-05-20 18:51: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 16 CTL formulae.
built 22 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 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,4.5676e+09,0.070787,6216,186,166,2298,2672,361,2690,100,3901,0


Converting to forward existential form...Done !
original formula: !(E((i4.u15.p48!=1) U (((i0.u2.p6==1)&&(i0.u10.p22==1))||(i10.u35.p114==1))))
=> equivalent forward existential formula: [(FwdU(Init,(i4.u15.p48!=1)) * (((i0.u2.p6==1)&&(i0.u10.p22==1))||(i10.u35.p114==1)))] = FALSE
(forward)formula 0,0,0.128925,7920,1,0,6554,2672,690,7377,196,4014,12302
FORMULA Parking-PT-208-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EG(((((i10.u35.p114!=1)||(i0.u2.p6!=1))&&(i1.i0.u11.p32!=1))&&(i4.u13.p41!=1))))
=> equivalent forward existential formula: [FwdG(Init,((((i10.u35.p114!=1)||(i0.u2.p6!=1))&&(i1.i0.u11.p32!=1))&&(i4.u13.p41!=1)))] = 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
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
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
(forward)formula 1,0,0.472369,22440,1,0,38436,3491,1297,48829,529,8347,61633
FORMULA Parking-PT-208-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((i4.u21.p26==1)&&(i4.u21.p69==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i4.u21.p26==1)&&(i4.u21.p69==1)))] != FALSE
(forward)formula 2,1,0.473972,22968,1,0,38462,3491,1308,48857,532,8351,61689
FORMULA Parking-PT-208-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AG(((((i4.u13.p40==1)&&(i7.i0.u29.p86==1))&&(i7.i0.u38.p124==1))||((i7.i1.u25.p78==1)&&(i7.i1.u37.p122==1)))) + EF(AG(((i9.i1.u1.p3==1)&&(i9.i0.u18.p59==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(E(TRUE U !(((i9.i1.u1.p3==1)&&(i9.i0.u18.p59==1)))))))),TRUE) * !(((((i4.u13.p40==1)&&(i7.i0.u29.p86==1))&&(i7.i0.u38.p124==1))||((i7.i1.u25.p78==1)&&(i7.i1.u37.p122==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t169, t170, t197, t198, t199, i2.t196, i4.u21.t62, i4.u21.t64, i6.t171, i6.i0.t168, i10.u42.t4, i10.u42.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/105/12/117
(forward)formula 3,0,0.536522,24024,1,0,42373,3724,2195,52700,689,9141,71953
FORMULA Parking-PT-208-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(((((i2.u20.p44==1)&&(i2.u20.p65==1))&&(i5.u24.p76==1))&&(i5.u31.p97==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((i2.u20.p44==1)&&(i2.u20.p65==1))&&(i5.u24.p76==1))&&(i5.u31.p97==1)))] != FALSE
(forward)formula 4,0,0.546697,24552,1,0,44408,3724,2244,53689,692,9145,74937
FORMULA Parking-PT-208-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EF((((i3.u5.p12==1)&&(i10.u35.p114==1))&&((i1.i0.u4.p29!=1)||(i2.u20.p66!=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((i3.u5.p12==1)&&(i10.u35.p114==1))&&((i1.i0.u4.p29!=1)||(i2.u20.p66!=1))))))] = FALSE
(forward)formula 5,1,0.835048,33792,1,0,61814,4018,2256,92625,693,10303,102448
FORMULA Parking-PT-208-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((i10.u33.p106==1)||((i4.u15.p47==1)&&(i4.u21.p70==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((i10.u33.p106==1)||((i4.u15.p47==1)&&(i4.u21.p70==1)))))] = FALSE
(forward)formula 6,0,0.883872,35640,1,0,66387,4020,2276,97444,694,10350,109592
FORMULA Parking-PT-208-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((EG(((i1.i0.u11.p32==1)||((i8.u22.p71==1)&&(i8.u39.p126==1)))) + EX((i0.u2.p6==1))) + ((i4.u15.p48!=1)&&((i2.u8.p18!=1)||(i2.u14.p46!=1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((i4.u15.p48!=1)&&((i2.u8.p18!=1)||(i2.u14.p46!=1))))) * !(EX((i0.u2.p6==1)))) * !(EG(((i1.i0.u11.p32==1)||((i8.u22.p71==1)&&(i8.u39.p126==1))))))] = FALSE
(forward)formula 7,0,1.61255,58344,1,0,106952,4323,2312,183499,694,12499,152515
FORMULA Parking-PT-208-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EG((((i2.u20.p44==1)&&(i2.u20.p65==1))||(i0.u2.p6==1))) * EF((i10.u35.p114!=1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EG((((i2.u20.p44==1)&&(i2.u20.p65==1))||(i0.u2.p6==1)))),TRUE) * (i10.u35.p114!=1))] != FALSE
(forward)formula 8,1,2.1646,75504,1,0,140902,4359,2325,243079,694,13409,175729
FORMULA Parking-PT-208-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((((i10.u42.p91==1)&&(i10.u42.p136==1))||((((i10.u42.p92==1)&&(i10.u42.p135==1))&&(i5.u24.p95==1))&&(i6.i0.u41.p132==1))) * AX((i4.u15.p49==1)))) * (!(AX(((i10.u33.p106==1)||(i0.u10.p24==1)))) + !(AX((i10.u35.p114!=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((i10.u42.p91==1)&&(i10.u42.p136==1))||((((i10.u42.p92==1)&&(i10.u42.p135==1))&&(i5.u24.p95==1))&&(i6.i0.u41.p132==1))) * !(EX(!((i4.u15.p49==1)))))))] = FALSE * [((Init * !(!(!(EX(!((i10.u35.p114!=1))))))) * !(EX(!(((i10.u33.p106==1)||(i0.u10.p24==1))))))] = FALSE)
(forward)formula 9,0,2.1754,76296,1,0,141684,4369,2354,244323,697,13453,176917
FORMULA Parking-PT-208-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((i0.u2.p6==1)||(i6.i0.u28.p83!=1))||(i6.i0.u41.p129!=1))||(i1.i0.u4.p10==1))||((((i4.u13.p40==1)&&(i10.u42.p133==1))&&((i10.u42.p91!=1)||(i10.u42.p136!=1)))&&((i6.i0.u28.p84!=1)||((i6.i0.u41.p130==1)&&(i6.i0.u41.p131==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((i0.u2.p6==1)||(i6.i0.u28.p83!=1))||(i6.i0.u41.p129!=1))||(i1.i0.u4.p10==1))||((((i4.u13.p40==1)&&(i10.u42.p133==1))&&((i10.u42.p91!=1)||(i10.u42.p136!=1)))&&((i6.i0.u28.p84!=1)||((i6.i0.u41.p130==1)&&(i6.i0.u41.p131==1)))))))] = FALSE
(forward)formula 10,0,2.17884,76296,1,0,141792,4375,2415,244617,707,13488,177106
FORMULA Parking-PT-208-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AX(((i1.i0.u4.p10!=1)&&(i10.u35.p115!=1)))) * EF(((i1.i1.u12.p37==1)&&(i2.u20.p66==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(((i1.i0.u4.p10!=1)&&(i10.u35.p115!=1))))))),TRUE) * ((i1.i1.u12.p37==1)&&(i2.u20.p66==1)))] != FALSE
(forward)formula 11,1,2.18316,76296,1,0,142313,4375,2425,245371,707,13489,177664
FORMULA Parking-PT-208-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(!(EF((((i10.u33.p105==1)&&(i10.u42.p136==1))||(i5.u31.p98==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U (((i10.u33.p105==1)&&(i10.u42.p136==1))||(i5.u31.p98==1)))))] != FALSE
(forward)formula 12,0,2.19498,76824,1,0,143206,4410,2435,246893,707,13648,179467
FORMULA Parking-PT-208-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AX(((i7.i1.u25.p78==1)&&(i10.u33.p106==1))) * !(EF((i10.u33.p106==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(((i7.i1.u25.p78==1)&&(i10.u33.p106==1)))))) * !(E(TRUE U (i10.u33.p106==1))))] != FALSE
(forward)formula 13,1,2.2064,77088,1,0,143870,4410,2438,248053,707,13652,180740
FORMULA Parking-PT-208-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((i4.u13.p40!=1)||(i3.u3.p8!=1)) U EX((i10.u35.p114==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,((i4.u13.p40!=1)||(i3.u3.p8!=1)))) * (i10.u35.p114==1))] != FALSE
(forward)formula 14,1,2.28,80256,1,0,151674,4410,2465,262746,707,13697,191177
FORMULA Parking-PT-208-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((((((i6.i0.u41.p94==1)&&(i6.i0.u41.p131==1)) * EG((i7.i1.u27.p82==1))) * AG((i10.u33.p106==1))) * (((i4.u13.p40==1)||((i8.u22.p72==1)&&(i8.u30.p89==1)))||((i9.i1.u36.p119==1)&&(i6.i0.u41.p132==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((((i6.i0.u41.p94==1)&&(i6.i0.u41.p131==1)) * EG((i7.i1.u27.p82==1))) * !(E(TRUE U !((i10.u33.p106==1))))) * (((i4.u13.p40==1)||((i8.u22.p72==1)&&(i8.u30.p89==1)))||((i9.i1.u36.p119==1)&&(i6.i0.u41.p132==1))))))] = FALSE
(forward)formula 15,0,2.28246,80784,1,0,151695,4410,2486,262779,707,13697,191295
FORMULA Parking-PT-208-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590000690224

--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r111-csrt-158961257800524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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