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.r227-oct2-159033546100076.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 SmartHome-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.7K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 68K May 12 20:42 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 SmartHome-PT-10-CTLFireability-00
FORMULA_NAME SmartHome-PT-10-CTLFireability-01
FORMULA_NAME SmartHome-PT-10-CTLFireability-02
FORMULA_NAME SmartHome-PT-10-CTLFireability-03
FORMULA_NAME SmartHome-PT-10-CTLFireability-04
FORMULA_NAME SmartHome-PT-10-CTLFireability-05
FORMULA_NAME SmartHome-PT-10-CTLFireability-06
FORMULA_NAME SmartHome-PT-10-CTLFireability-07
FORMULA_NAME SmartHome-PT-10-CTLFireability-08
FORMULA_NAME SmartHome-PT-10-CTLFireability-09
FORMULA_NAME SmartHome-PT-10-CTLFireability-10
FORMULA_NAME SmartHome-PT-10-CTLFireability-11
FORMULA_NAME SmartHome-PT-10-CTLFireability-12
FORMULA_NAME SmartHome-PT-10-CTLFireability-13
FORMULA_NAME SmartHome-PT-10-CTLFireability-14
FORMULA_NAME SmartHome-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590483737546

[2020-05-26 09:02:19] [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-26 09:02:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:02:19] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-05-26 09:02:19] [INFO ] Transformed 273 places.
[2020-05-26 09:02:19] [INFO ] Transformed 308 transitions.
[2020-05-26 09:02:19] [INFO ] Found NUPN structural information;
[2020-05-26 09:02:19] [INFO ] Parsed PT model containing 273 places and 308 transitions in 93 ms.
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 45 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Incomplete random walk after 100000 steps, including 650 resets, run finished after 154 ms. (steps per millisecond=649 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 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 263 rows 233 cols
[2020-05-26 09:02:20] [INFO ] Computed 12 place invariants in 8 ms
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:20] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-05-26 09:02:20] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-05-26 09:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2020-05-26 09:02:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 454 ms returned sat
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:21] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2020-05-26 09:02:22] [INFO ] Deduced a trap composed of 34 places in 454 ms
[2020-05-26 09:02:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2020-05-26 09:02:22] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 36 ms.
[2020-05-26 09:02:24] [INFO ] Added : 259 causal constraints over 52 iterations in 1919 ms. Result :sat
[2020-05-26 09:02:24] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-05-26 09:02:24] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-26 09:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:25] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2020-05-26 09:02:26] [INFO ] Deduced a trap composed of 44 places in 1492 ms
[2020-05-26 09:02:27] [INFO ] Deduced a trap composed of 52 places in 1318 ms
[2020-05-26 09:02:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2882 ms
[2020-05-26 09:02:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 990 ms returned sat
[2020-05-26 09:02:29] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 11 ms returned sat
[2020-05-26 09:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:29] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2020-05-26 09:02:32] [INFO ] Deduced a trap composed of 44 places in 2352 ms
[2020-05-26 09:02:34] [INFO ] Deduced a trap composed of 52 places in 2022 ms
[2020-05-26 09:02:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4430 ms
[2020-05-26 09:02:34] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 28 ms.
[2020-05-26 09:02:35] [INFO ] Added : 253 causal constraints over 51 iterations in 1823 ms. Result :sat
[2020-05-26 09:02:36] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-26 09:02:36] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-26 09:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:36] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2020-05-26 09:02:37] [INFO ] Deduced a trap composed of 44 places in 1263 ms
[2020-05-26 09:02:38] [INFO ] Deduced a trap composed of 73 places in 373 ms
[2020-05-26 09:02:38] [INFO ] Deduced a trap composed of 32 places in 131 ms
[2020-05-26 09:02:38] [INFO ] Deduced a trap composed of 41 places in 51 ms
[2020-05-26 09:02:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1934 ms
[2020-05-26 09:02:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 432 ms returned sat
[2020-05-26 09:02:38] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:39] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-05-26 09:02:39] [INFO ] Deduced a trap composed of 44 places in 96 ms
[2020-05-26 09:02:39] [INFO ] Deduced a trap composed of 32 places in 113 ms
[2020-05-26 09:02:39] [INFO ] Deduced a trap composed of 73 places in 54 ms
[2020-05-26 09:02:39] [INFO ] Deduced a trap composed of 48 places in 59 ms
[2020-05-26 09:02:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 371 ms
[2020-05-26 09:02:39] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 27 ms.
[2020-05-26 09:02:40] [INFO ] Added : 262 causal constraints over 53 iterations in 1441 ms. Result :sat
[2020-05-26 09:02:41] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2020-05-26 09:02:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2020-05-26 09:02:41] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:02:41] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:41] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-05-26 09:02:42] [INFO ] Deduced a trap composed of 47 places in 736 ms
[2020-05-26 09:02:44] [INFO ] Deduced a trap composed of 50 places in 1908 ms
[2020-05-26 09:02:46] [INFO ] Deduced a trap composed of 58 places in 2018 ms
[2020-05-26 09:02:47] [INFO ] Deduced a trap composed of 74 places in 1780 ms
[2020-05-26 09:02:49] [INFO ] Deduced a trap composed of 74 places in 1756 ms
[2020-05-26 09:02:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8330 ms
[2020-05-26 09:02:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 805 ms returned sat
[2020-05-26 09:02:50] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 8 ms returned sat
[2020-05-26 09:02:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:51] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2020-05-26 09:02:52] [INFO ] Deduced a trap composed of 45 places in 1385 ms
[2020-05-26 09:02:54] [INFO ] Deduced a trap composed of 72 places in 1401 ms
[2020-05-26 09:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2831 ms
[2020-05-26 09:02:54] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 34 ms.
[2020-05-26 09:02:56] [INFO ] Added : 261 causal constraints over 53 iterations in 2238 ms. Result :sat
[2020-05-26 09:02:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-26 09:02:57] [INFO ] Flatten gal took : 184 ms
[2020-05-26 09:02:57] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-26 09:02:57] [INFO ] Flatten gal took : 42 ms
FORMULA SmartHome-PT-10-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:02:57] [INFO ] Applying decomposition
[2020-05-26 09:02:57] [INFO ] Flatten gal took : 43 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/graph4190994571702889221.txt, -o, /tmp/graph4190994571702889221.bin, -w, /tmp/graph4190994571702889221.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/graph4190994571702889221.bin, -l, -1, -v, -w, /tmp/graph4190994571702889221.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:02:57] [INFO ] Decomposing Gal with order
[2020-05-26 09:02:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:02:57] [INFO ] Removed a total of 44 redundant transitions.
[2020-05-26 09:02:58] [INFO ] Flatten gal took : 209 ms
[2020-05-26 09:02:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 20 ms.
[2020-05-26 09:02:58] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 22 ms
[2020-05-26 09:02:58] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 14 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 12 CTL formulae.
built 27 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 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.30089e+11,0.715526,13880,1510,160,18728,1589,561,30040,105,4487,0


Converting to forward existential form...Done !
original formula: E(((EF((i12.i1.u69.p218==1)) + (i10.i1.u57.p190==1)) + (i4.u25.p83==1)) U EX(((i5.i0.u18.p89==1)||(i6.i1.u48.p124==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,((E(TRUE U (i12.i1.u69.p218==1)) + (i10.i1.u57.p190==1)) + (i4.u25.p83==1)))) * ((i5.i0.u18.p89==1)||(i6.i1.u48.p124==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t22, t114, i0.u1.t273, i0.u1.t274, i0.u1.t275, i0.u1.t276, i0.u1.t277, i0.u1.t278, i0.u74.t14, i0.u74.t15, i0.u74.t16, i3.t222, i3.i0.t227, i3.i0.u15.t223, i3.i0.u15.t224, i3.i0.u15.t270, i3.i0.u77.t1, i3.i0.u77.t2, i5.t211, i5.t186, i5.i0.u18.t187, i5.i0.u18.t215, i5.i0.u75.t13, i7.t150, i7.i0.t154, i7.i0.u30.t151, i7.i0.u30.t179, i8.i0.t139, i8.i0.t141, i8.i0.u38.t115, i8.i0.u38.t143, i11.t59, i11.i0.t64, i11.i0.u60.t60, i11.i0.u60.t107, i12.i0.t47, i12.i0.t49, i12.i0.u64.t23, i12.i0.u64.t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/217/40/257
(forward)formula 0,1,24.3608,470392,1,0,953180,3382,3354,1.57832e+06,527,13939,967095
FORMULA SmartHome-PT-10-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(EF((i2.i0.u10.p43==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i2.i0.u10.p43==1))))] != FALSE
(forward)formula 1,1,24.4949,475672,1,0,965887,3477,3357,1.59586e+06,527,14234,991437
FORMULA SmartHome-PT-10-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((i4.u24.p81==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i4.u24.p81==1))] != FALSE
(forward)formula 2,1,24.5115,476200,1,0,965897,3477,3358,1.59655e+06,527,14234,992268
FORMULA SmartHome-PT-10-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((i3.i0.u15.p57==1)&&(i13.u78.p272==1))&&(i6.i1.u47.p153==1))&&(i9.i0.u52.p180==1))||(((i2.i0.u11.p47==1)&&(i8.i1.u43.p140==1))&&(i5.i1.u20.p70!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((i3.i0.u15.p57==1)&&(i13.u78.p272==1))&&(i6.i1.u47.p153==1))&&(i9.i0.u52.p180==1))||(((i2.i0.u11.p47==1)&&(i8.i1.u43.p140==1))&&(i5.i1.u20.p70!=1))))] != FALSE
(forward)formula 3,1,24.5153,476200,1,0,966209,3477,3389,1.59704e+06,530,14234,993110
FORMULA SmartHome-PT-10-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(((i12.i0.u64.p230==1)&&(i0.u74.p235==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i12.i0.u64.p230==1)&&(i0.u74.p235==1))))))] != FALSE
(forward)formula 4,1,24.6432,479368,1,0,973089,3530,3416,1.61172e+06,531,14813,1001337
FORMULA SmartHome-PT-10-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((((i8.i0.u38.p151==1)&&(i10.i0.u58.p192==1)) * AG((i12.i1.u70.p219==1))) * !(AG((i7.i2.u29.p123==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (((i8.i0.u38.p151==1)&&(i10.i0.u58.p192==1)) * !(E(TRUE U !((i12.i1.u70.p219==1)))))),TRUE) * !((i7.i2.u29.p123==1)))] != FALSE
(forward)formula 5,0,24.6891,479896,1,0,973573,3530,3432,1.61228e+06,532,14813,1002472
FORMULA SmartHome-PT-10-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((!(EF((i10.i1.u56.p188==1))) * (i12.i1.u69.p218!=1)) * ((i12.i0.u64.p230!=1)||(i13.u78.p269!=1))) * ((i11.i0.u60.p198!=1)||(i12.i0.u65.p208==1))))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * ((i11.i0.u60.p198!=1)||(i12.i0.u65.p208==1))) * ((i12.i0.u64.p230!=1)||(i13.u78.p269!=1))) * (i12.i1.u69.p218!=1)) * !(E(TRUE U (i10.i1.u56.p188==1))))] != FALSE
(forward)formula 6,1,24.7888,480952,1,0,975391,3559,3450,1.61669e+06,534,14975,1006451
FORMULA SmartHome-PT-10-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AX(FALSE) + (AF((i9.i1.u51.p176==1)) * ((i0.u1.p5!=1)||(i5.i1.u19.p69==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE + [((FwdU(Init,TRUE) * ((i0.u1.p5!=1)||(i5.i1.u19.p69==1))) * !(EG(!((i9.i1.u51.p176==1)))))] != FALSE)
(forward)formula 7,1,24.8029,480952,1,0,975696,3565,3450,1.61733e+06,534,14996,1006665
FORMULA SmartHome-PT-10-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX((EX((i7.i2.u29.p93==1)) + ((i10.i0.u58.p170!=1)&&(i8.i0.u38.p125!=1)))) * ((A((i2.i1.u9.p42==1) U (i0.u1.p7==1)) + EF(((i5.i0.u18.p64==1)&&(i9.i1.u50.p175==1)))) + AX(AF((i12.i1.u71.p221==1)))))
=> equivalent forward existential formula: ([((EY(Init) * !(((i10.i0.u58.p170!=1)&&(i8.i0.u38.p125!=1)))) * !(EX((i7.i2.u29.p93==1))))] = FALSE * [FwdG(EY((Init * !((!((E(!((i0.u1.p7==1)) U (!((i2.i1.u9.p42==1)) * !((i0.u1.p7==1)))) + EG(!((i0.u1.p7==1))))) + E(TRUE U ((i5.i0.u18.p64==1)&&(i9.i1.u50.p175==1))))))),!((i12.i1.u71.p221==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
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
(forward)formula 8,1,26.3454,514124,1,0,1.04394e+06,3785,3653,1.73345e+06,556,15996,1112098
FORMULA SmartHome-PT-10-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((!(EG(((i12.i1.u72.p223==1)||((i3.i0.u15.p57==1)&&(i11.i0.u79.p249==1))))) * (AG((i5.i1.u20.p70==1)) + EG((i2.i1.u13.p51==1)))) + ((!(EX((i8.i0.u38.p150==1))) * !(AX((i8.i0.u38.p151==1)))) * EF((i8.i0.u39.p129==1))))
=> equivalent forward existential formula: (([(EY((Init * !((!(EG(((i12.i1.u72.p223==1)||((i3.i0.u15.p57==1)&&(i11.i0.u79.p249==1))))) * (!(E(TRUE U !((i5.i1.u20.p70==1)))) + EG((i2.i1.u13.p51==1))))))) * (i8.i0.u38.p150==1))] = FALSE * [((Init * !((!(EG(((i12.i1.u72.p223==1)||((i3.i0.u15.p57==1)&&(i11.i0.u79.p249==1))))) * (!(E(TRUE U !((i5.i1.u20.p70==1)))) + EG((i2.i1.u13.p51==1)))))) * !(EX(!((i8.i0.u38.p151==1)))))] = FALSE) * [((Init * !((!(EG(((i12.i1.u72.p223==1)||((i3.i0.u15.p57==1)&&(i11.i0.u79.p249==1))))) * (!(E(TRUE U !((i5.i1.u20.p70==1)))) + EG((i2.i1.u13.p51==1)))))) * !(E(TRUE U (i8.i0.u39.p129==1))))] = FALSE)
(forward)formula 9,1,26.9018,529436,1,0,1.07647e+06,3804,3695,1.78401e+06,557,16287,1169678
FORMULA SmartHome-PT-10-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EF(((i9.i0.u53.p172==1)&&((i5.i0.u18.p89==1)||(i2.i0.u10.p44==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((i9.i0.u53.p172==1)&&((i5.i0.u18.p89==1)||(i2.i0.u10.p44==1))))))] = FALSE
(forward)formula 10,1,27.1556,536564,1,0,1.09255e+06,3939,3700,1.8126e+06,557,16682,1200979
FORMULA SmartHome-PT-10-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 11,1,27.3464,542900,1,0,1.10526e+06,4838,4242,1.83189e+06,595,19467,1236510
FORMULA SmartHome-PT-10-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590483806291

--------------------
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="SmartHome-PT-10"
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 SmartHome-PT-10, 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 r227-oct2-159033546100076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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