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.r210-tajo-159033476500996.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 ShieldRVt-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476500996
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.7K May 14 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.0K May 13 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:30 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 60K 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 ShieldRVt-PT-005B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590630689802

[2020-05-28 01:51:31] [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-28 01:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:51:31] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-28 01:51:31] [INFO ] Transformed 253 places.
[2020-05-28 01:51:31] [INFO ] Transformed 253 transitions.
[2020-05-28 01:51:31] [INFO ] Found NUPN structural information;
[2020-05-28 01:51:31] [INFO ] Parsed PT model containing 253 places and 253 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Incomplete random walk after 100000 steps, including 7 resets, run finished after 183 ms. (steps per millisecond=546 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 253 rows 253 cols
[2020-05-28 01:51:31] [INFO ] Computed 21 place invariants in 10 ms
[2020-05-28 01:51:32] [INFO ] [Real]Absence check using 21 positive place invariants in 34 ms returned sat
[2020-05-28 01:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:32] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 29 places in 118 ms
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 23 places in 65 ms
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 38 places in 53 ms
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 24 places in 48 ms
[2020-05-28 01:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 341 ms
[2020-05-28 01:51:32] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-28 01:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:32] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-05-28 01:51:32] [INFO ] Deduced a trap composed of 26 places in 56 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 28 places in 39 ms
[2020-05-28 01:51:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 399 ms
[2020-05-28 01:51:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:51:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 110 ms returned sat
[2020-05-28 01:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:33] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 26 places in 106 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-05-28 01:51:33] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-05-28 01:51:34] [INFO ] Deduced a trap composed of 27 places in 57 ms
[2020-05-28 01:51:34] [INFO ] Deduced a trap composed of 26 places in 53 ms
[2020-05-28 01:51:34] [INFO ] Deduced a trap composed of 32 places in 47 ms
[2020-05-28 01:51:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 716 ms
[2020-05-28 01:51:34] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 16 ms.
[2020-05-28 01:51:35] [INFO ] Added : 228 causal constraints over 46 iterations in 1094 ms. Result :unsat
[2020-05-28 01:51:35] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2020-05-28 01:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:35] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-05-28 01:51:35] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-05-28 01:51:35] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-05-28 01:51:35] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-05-28 01:51:35] [INFO ] Deduced a trap composed of 30 places in 67 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 21 places in 57 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-05-28 01:51:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 522 ms
[2020-05-28 01:51:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:51:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 158 ms returned sat
[2020-05-28 01:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:36] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 26 places in 90 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 29 places in 91 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 24 places in 57 ms
[2020-05-28 01:51:36] [INFO ] Deduced a trap composed of 25 places in 57 ms
[2020-05-28 01:51:37] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-05-28 01:51:37] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-05-28 01:51:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 591 ms
[2020-05-28 01:51:37] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 22 ms.
[2020-05-28 01:51:37] [INFO ] Added : 243 causal constraints over 50 iterations in 844 ms. Result :sat
[2020-05-28 01:51:38] [INFO ] [Real]Absence check using 21 positive place invariants in 30 ms returned sat
[2020-05-28 01:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:38] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-28 01:51:38] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-05-28 01:51:38] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-05-28 01:51:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2020-05-28 01:51:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:51:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 156 ms returned sat
[2020-05-28 01:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:51:38] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-05-28 01:51:38] [INFO ] Deduced a trap composed of 21 places in 80 ms
[2020-05-28 01:51:39] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-05-28 01:51:39] [INFO ] Deduced a trap composed of 22 places in 67 ms
[2020-05-28 01:51:39] [INFO ] Deduced a trap composed of 28 places in 52 ms
[2020-05-28 01:51:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 342 ms
[2020-05-28 01:51:39] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 19 ms.
[2020-05-28 01:51:40] [INFO ] Added : 244 causal constraints over 49 iterations in 1068 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-28 01:51:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 01:51:40] [INFO ] Flatten gal took : 60 ms
[2020-05-28 01:51:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 01:51:40] [INFO ] Flatten gal took : 22 ms
FORMULA ShieldRVt-PT-005B-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:51:40] [INFO ] Applying decomposition
[2020-05-28 01:51:40] [INFO ] Flatten gal took : 17 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/graph10473492913206242114.txt, -o, /tmp/graph10473492913206242114.bin, -w, /tmp/graph10473492913206242114.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/graph10473492913206242114.bin, -l, -1, -v, -w, /tmp/graph10473492913206242114.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:51:40] [INFO ] Decomposing Gal with order
[2020-05-28 01:51:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:51:40] [INFO ] Removed a total of 30 redundant transitions.
[2020-05-28 01:51:40] [INFO ] Flatten gal took : 58 ms
[2020-05-28 01:51:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-28 01:51:40] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
[2020-05-28 01:51:40] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 14 CTL formulae.
built 35 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 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,6.72758e+19,1.90987,44244,1141,30,68879,224,451,147473,38,528,0


Converting to forward existential form...Done !
original formula: !(AG(EF((i6.u34.p91==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (i6.u34.p91==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t228, i0.t221, i0.u7.t226, i0.u9.t222, i0.u9.t229, i1.t212, i1.u11.t216, i1.u11.t218, i2.i0.u2.t230, i2.i2.t188, i2.i2.t195, i2.i2.u20.t189, i2.i2.u20.t196, i2.i2.u21.t193, i3.t207, i3.t200, i3.u14.t201, i3.u14.t208, i3.u15.t205, i4.t182, i4.t175, i4.u25.t176, i4.u25.t183, i4.u28.t180, i5.i1.t166, i5.i1.u32.t170, i5.i1.u32.t172, i6.t161, i6.t154, i6.u34.t155, i6.u34.t162, i6.u37.t159, i7.t149, i7.t142, i7.u39.t147, i7.u41.t143, i7.u41.t150, i9.t136, i9.t129, i9.u48.t130, i9.u48.t137, i9.u49.t134, i10.t120, i10.u52.t124, i10.u52.t126, i11.t115, i11.t108, i11.u56.t109, i11.u56.t116, i11.u57.t113, i12.t103, i12.t96, i12.u61.t97, i12.u61.t104, i12.u62.t101, i13.t90, i13.t83, i13.u67.t84, i13.u67.t91, i13.u68.t88, i14.t74, i14.u72.t78, i14.u72.t80, i15.t69, i15.t62, i15.u73.t63, i15.u73.t70, i15.u74.t67, i16.t57, i16.t50, i16.u78.t55, i16.u81.t51, i16.u81.t58, i17.t44, i17.t37, i17.u88.t38, i17.u88.t45, i17.u89.t42, i18.t28, i18.u92.t32, i18.u92.t34, i19.t23, i19.t16, i19.u93.t17, i19.u93.t24, i19.u95.t21, i20.t11, i20.t4, i20.u100.t5, i20.u100.t12, i20.u101.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
(forward)formula 0,1,33.3969,858320,1,0,1.2745e+06,372,2739,3.23045e+06,176,742,1682339
FORMULA ShieldRVt-PT-005B-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF((((i14.u72.p176==1)||(i15.u76.p187==1))&&((i11.u56.p133==1)||(i10.u52.p124==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i14.u72.p176==1)||(i15.u76.p187==1))&&((i11.u56.p133==1)||(i10.u52.p124==1))))))] = FALSE
(forward)formula 1,0,85.3254,2111364,1,0,3.00111e+06,408,2752,8.17246e+06,178,802,4012878
FORMULA ShieldRVt-PT-005B-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AG(EF(((i6.u34.p84==1)||(i9.u45.p110==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i6.u34.p84==1)||(i9.u45.p110==1)))))] != FALSE
(forward)formula 2,1,121.653,2230164,1,0,3.18413e+06,408,1362,8.60742e+06,101,802,1220515
FORMULA ShieldRVt-PT-005B-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2020-05-28 01:57:48] [INFO ] Applying decomposition
[2020-05-28 01:57:48] [INFO ] Flatten gal took : 21 ms
[2020-05-28 01:57:48] [INFO ] Decomposing Gal with order
[2020-05-28 01:57:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:57:48] [INFO ] Flatten gal took : 22 ms
[2020-05-28 01:57:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:57:48] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-28 01:57:48] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 11 CTL formulae.
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 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,6.72758e+19,16.9057,460668,905,228,750108,597,157,3.66783e+06,93,6524,0


Converting to forward existential form...Done !
original formula: (AF(((((i0.i0.i0.i1.u19.p101==1)||(i0.i1.i0.i0.u30.p167==1))&&(i0.i0.i0.i0.i1.u12.p48!=1)) + AF((i0.i1.u33.p199==1)))) * EF((i0.i0.i1.i0.i0.u24.p124==1)))
=> equivalent forward existential formula: ([FwdG(Init,!(((((i0.i0.i0.i1.u19.p101==1)||(i0.i1.i0.i0.u30.p167==1))&&(i0.i0.i0.i0.i1.u12.p48!=1)) + !(EG(!((i0.i1.u33.p199==1)))))))] = FALSE * [(Init * !(E(TRUE U (i0.i0.i1.i0.i0.u24.p124==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.u5.t230, i0.i0.i0.i0.i1.u12.t188, i0.i0.i0.i0.i1.u12.t189, i0.i0.i0.i0.i1.u12.t193, i0.i0.i0.i0.i1.u12.t195, i0.i0.i0.i0.i1.u12.t196, i0.i0.i0.i0.i1.i0.u11.t200, i0.i0.i0.i0.i1.i0.u11.t201, i0.i0.i0.i0.i1.i0.u11.t205, i0.i0.i0.i0.i1.i0.u11.t207, i0.i0.i0.i0.i1.i0.u11.t208, i0.i0.i0.i0.i1.i0.i0.u9.t221, i0.i0.i0.i0.i1.i0.i0.u9.t222, i0.i0.i0.i0.i1.i0.i0.u9.t226, i0.i0.i0.i0.i1.i0.i0.u9.t228, i0.i0.i0.i0.i1.i0.i0.u9.t229, i0.i0.i0.i0.i1.i0.i0.u10.t212, i0.i0.i0.i0.i1.i0.i0.u10.t216, i0.i0.i0.i0.i1.i0.i0.u10.t218, i0.i0.i0.i1.u19.t142, i0.i0.i0.i1.u19.t143, i0.i0.i0.i1.u19.t147, i0.i0.i0.i1.u19.t149, i0.i0.i0.i1.u19.t150, i0.i0.i0.i1.i0.u18.t154, i0.i0.i0.i1.i0.u18.t155, i0.i0.i0.i1.i0.u18.t159, i0.i0.i0.i1.i0.u18.t161, i0.i0.i0.i1.i0.u18.t162, i0.i0.i0.i1.i0.i0.u16.t175, i0.i0.i0.i1.i0.i0.u16.t176, i0.i0.i0.i1.i0.i0.u16.t180, i0.i0.i0.i1.i0.i0.u16.t182, i0.i0.i0.i1.i0.i0.u16.t183, i0.i0.i0.i1.i0.i0.u17.t166, i0.i0.i0.i1.i0.i0.u17.t170, i0.i0.i0.i1.i0.i0.u17.t172, i0.i0.i1.u26.t96, i0.i0.i1.u26.t97, i0.i0.i1.u26.t101, i0.i0.i1.u26.t103, i0.i0.i1.u26.t104, i0.i0.i1.i0.u25.t108, i0.i0.i1.i0.u25.t109, i0.i0.i1.i0.u25.t113, i0.i0.i1.i0.u25.t115, i0.i0.i1.i0.u25.t116, i0.i0.i1.i0.i0.u23.t129, i0.i0.i1.i0.i0.u23.t130, i0.i0.i1.i0.i0.u23.t134, i0.i0.i1.i0.i0.u23.t136, i0.i0.i1.i0.i0.u23.t137, i0.i0.i1.i0.i0.u24.t120, i0.i0.i1.i0.i0.u24.t124, i0.i0.i1.i0.i0.u24.t126, i0.i1.u33.t50, i0.i1.u33.t51, i0.i1.u33.t55, i0.i1.u33.t57, i0.i1.u33.t58, i0.i1.i0.u32.t62, i0.i1.i0.u32.t63, i0.i1.i0.u32.t67, i0.i1.i0.u32.t69, i0.i1.i0.u32.t70, i0.i1.i0.i0.u30.t83, i0.i1.i0.i0.u30.t84, i0.i1.i0.i0.u30.t88, i0.i1.i0.i0.u30.t90, i0.i1.i0.i0.u30.t91, i0.i1.i0.i0.u31.t74, i0.i1.i0.i0.u31.t78, i0.i1.i0.i0.u31.t80, i1.u40.t4, i1.u40.t5, i1.u40.t9, i1.u40.t11, i1.u40.t12, i1.i0.u39.t16, i1.i0.u39.t17, i1.i0.u39.t21, i1.i0.u39.t23, i1.i0.u39.t24, i1.i0.i0.u37.t37, i1.i0.i0.u37.t38, i1.i0.i0.u37.t42, i1.i0.i0.u37.t44, i1.i0.i0.u37.t45, i1.i0.i0.u38.t28, i1.i0.i0.u38.t32, i1.i0.i0.u38.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
Detected timeout of ITS tools.
[2020-05-28 02:17:51] [INFO ] Flatten gal took : 22 ms
[2020-05-28 02:17:51] [INFO ] Input system was already deterministic with 253 transitions.
[2020-05-28 02:17:51] [INFO ] Transformed 253 places.
[2020-05-28 02:17:51] [INFO ] Transformed 253 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-28 02:17:51] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-28 02:17:51] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 10 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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.72758e+19,1.75757,64976,2,13647,5,205785,6,0,1267,355748,0


Converting to forward existential form...Done !
original formula: (AF(((((p101==1)||(p167==1))&&(p48!=1)) + AF((p199==1)))) * EF((p124==1)))
=> equivalent forward existential formula: ([FwdG(Init,!(((((p101==1)||(p167==1))&&(p48!=1)) + !(EG(!((p199==1)))))))] = FALSE * [(Init * !(E(TRUE U (p124==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t9, t11, t12, t16, t17, t21, t23, t24, t28, t32, t34, t37, t38, t42, t44, t45, t50, t51, t55, t57, t58, t62, t63, t67, t69, t70, t74, t78, t80, t83, t84, t88, t90, t91, t96, t97, t101, t103, t104, t108, t109, t113, t115, t116, t120, t124, t126, t129, t130, t134, t136, t137, t142, t143, t147, t149, t150, t154, t155, t159, t161, t162, t166, t170, t172, t175, t176, t180, t182, t183, t188, t189, t193, t195, t196, t200, t201, t205, t207, t208, t212, t216, t218, t221, t222, t226, t228, t229, t230, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
Detected timeout of ITS tools.

BK_STOP 1590633477813

--------------------
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="ShieldRVt-PT-005B"
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 ShieldRVt-PT-005B, 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 r210-tajo-159033476500996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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