fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902545900220
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15775.200 3600000.00 3616082.00 13974.10 TTTTFF?????????F normal

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.r051-ebro-158902545900220.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 DES-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 2.7K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:16 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.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 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 69K 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 DES-PT-02b-CTLFireability-00
FORMULA_NAME DES-PT-02b-CTLFireability-01
FORMULA_NAME DES-PT-02b-CTLFireability-02
FORMULA_NAME DES-PT-02b-CTLFireability-03
FORMULA_NAME DES-PT-02b-CTLFireability-04
FORMULA_NAME DES-PT-02b-CTLFireability-05
FORMULA_NAME DES-PT-02b-CTLFireability-06
FORMULA_NAME DES-PT-02b-CTLFireability-07
FORMULA_NAME DES-PT-02b-CTLFireability-08
FORMULA_NAME DES-PT-02b-CTLFireability-09
FORMULA_NAME DES-PT-02b-CTLFireability-10
FORMULA_NAME DES-PT-02b-CTLFireability-11
FORMULA_NAME DES-PT-02b-CTLFireability-12
FORMULA_NAME DES-PT-02b-CTLFireability-13
FORMULA_NAME DES-PT-02b-CTLFireability-14
FORMULA_NAME DES-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589528860772

[2020-05-15 07:47:43] [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-15 07:47:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 07:47:44] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2020-05-15 07:47:44] [INFO ] Transformed 288 places.
[2020-05-15 07:47:44] [INFO ] Transformed 239 transitions.
[2020-05-15 07:47:44] [INFO ] Found NUPN structural information;
[2020-05-15 07:47:44] [INFO ] Parsed PT model containing 288 places and 239 transitions in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 66 ms.
Incomplete random walk after 100000 steps, including 865 resets, run finished after 488 ms. (steps per millisecond=204 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 239 rows 288 cols
[2020-05-15 07:47:44] [INFO ] Computed 65 place invariants in 33 ms
[2020-05-15 07:47:45] [INFO ] [Real]Absence check using 39 positive place invariants in 73 ms returned sat
[2020-05-15 07:47:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2020-05-15 07:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 07:47:45] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2020-05-15 07:47:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 07:47:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-05-15 07:47:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 07:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 07:47:46] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2020-05-15 07:47:46] [INFO ] Deduced a trap composed of 8 places in 252 ms
[2020-05-15 07:47:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 314 ms
[2020-05-15 07:47:46] [INFO ] [Real]Absence check using 39 positive place invariants in 123 ms returned sat
[2020-05-15 07:47:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned sat
[2020-05-15 07:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 07:47:47] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2020-05-15 07:47:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 07:47:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-05-15 07:47:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 07:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 07:47:48] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2020-05-15 07:47:48] [INFO ] Deduced a trap composed of 23 places in 157 ms
[2020-05-15 07:47:48] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-05-15 07:47:48] [INFO ] Deduced a trap composed of 36 places in 169 ms
[2020-05-15 07:47:48] [INFO ] Deduced a trap composed of 24 places in 120 ms
[2020-05-15 07:47:48] [INFO ] Deduced a trap composed of 29 places in 132 ms
[2020-05-15 07:47:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 866 ms
[2020-05-15 07:47:49] [INFO ] Computed and/alt/rep : 238/430/238 causal constraints in 29 ms.
[2020-05-15 07:47:50] [INFO ] Added : 230 causal constraints over 46 iterations in 1923 ms. Result :sat
[2020-05-15 07:47:51] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-15 07:47:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 07:47:51] [INFO ] Flatten gal took : 119 ms
[2020-05-15 07:47:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 07:47:51] [INFO ] Flatten gal took : 45 ms
FORMULA DES-PT-02b-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 07:47:51] [INFO ] Applying decomposition
[2020-05-15 07:47:51] [INFO ] Flatten gal took : 40 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/graph2891922454243409999.txt, -o, /tmp/graph2891922454243409999.bin, -w, /tmp/graph2891922454243409999.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/graph2891922454243409999.bin, -l, -1, -v, -w, /tmp/graph2891922454243409999.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 07:47:51] [INFO ] Decomposing Gal with order
[2020-05-15 07:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 07:47:52] [INFO ] Removed a total of 36 redundant transitions.
[2020-05-15 07:47:52] [INFO ] Flatten gal took : 105 ms
[2020-05-15 07:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2020-05-15 07:47:52] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 19 ms
[2020-05-15 07:47:52] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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 15 CTL formulae.
built 30 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 25 ordering constraints for composite.
built 20 ordering constraints for composite.
built 34 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 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,7.10209e+18,1.68968,36180,4221,96,74254,897,692,88501,96,3117,0


Converting to forward existential form...Done !
original formula: AG(AF((i2.u13.p37!=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((i2.u13.p37!=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
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
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
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
(forward)formula 0,1,296.701,2687860,1,0,6.80019e+06,1387,2884,6.22079e+06,368,5175,6221475
FORMULA DES-PT-02b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((i12.u81.p256==1))
=> equivalent forward existential formula: [FwdG(Init,!((i12.u81.p256==1)))] = FALSE
(forward)formula 1,1,297.346,2702908,1,0,6.85019e+06,1390,2939,6.24098e+06,368,5220,6276930
FORMULA DES-PT-02b-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((((i9.u85.p254==1) + EX((i6.u27.p89==1))) + (i7.u24.p81!=1)))
=> equivalent forward existential formula: [FwdG(Init,(((i9.u85.p254==1) + EX((i6.u27.p89==1))) + (i7.u24.p81!=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t58, t99, t154, i0.u43.t83, i0.u44.t80, i1.u48.t78, i1.u87.t23, i1.u87.t25, i1.u87.t27, i2.t160, i2.u12.t156, i2.u12.t158, i3.u14.t139, i3.u14.t144, i3.u14.t146, i3.u14.t149, i3.u14.t151, i3.u14.t153, i3.u17.t141, i4.u20.t126, i4.u20.t128, i4.u20.t130, i5.t121, i5.u22.t123, i6.t166, i6.u10.t162, i6.u10.t164, i6.u26.t112, i6.u29.t111, i6.u29.t117, i7.t109, i7.u25.t118, i7.u35.t102, i8.u39.t90, i8.u39.t92, i8.u39.t94, i8.u39.t96, i8.u39.t98, i9.u80.t33, i9.u80.t36, i9.u80.t38, i10.t56, i10.t54, i10.u71.t52, i10.u79.t41, i10.u53.t76, i10.u70.t55, i10.u69.t57, i10.u68.t59, i11.t66, i11.i0.t62, i11.i0.t64, i11.i0.i0.u66.t63, i11.i0.i1.u65.t65, i11.i0.i2.t60, i11.i0.i2.u67.t61, i11.i1.i0.u63.t68, i11.i1.i1.u64.t67, i12.u18.t133, i12.u18.t135, i12.u18.t137, i13.u90.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/175/62/237
(forward)formula 2,1,527.155,2783324,1,0,7.06602e+06,1409,1455,6.51067e+06,181,5360,3226647
FORMULA DES-PT-02b-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((((i12.u19.p62==1)||((i6.u27.p85==1)&&(i7.u32.p106==1)))||(((i2.u12.p35==1)&&(i13.u3.p10==1))&&(i13.u90.p280==1)))&&(i11.i0.i2.u67.p201==1))&&(i11.i0.i3.u74.p231==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((i12.u19.p62==1)||((i6.u27.p85==1)&&(i7.u32.p106==1)))||(((i2.u12.p35==1)&&(i13.u3.p10==1))&&(i13.u90.p280==1)))&&(i11.i0.i2.u67.p201==1))&&(i11.i0.i3.u74.p231==1)))] != FALSE
(forward)formula 3,1,527.183,2783324,1,0,7.06602e+06,1409,1499,6.51067e+06,184,5360,3228353
FORMULA DES-PT-02b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AF((i12.u19.p62==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((i12.u19.p62==1)))] = FALSE
(forward)formula 4,0,656.618,2780592,1,0,7.06602e+06,1409,2224,6.79175e+06,246,5360,5052459
FORMULA DES-PT-02b-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((i2.u13.p34==1)&&(i2.u38.p112==1))) + AG(((((i0.u1.p7!=1)||(i0.u45.p139!=1))||(i8.u41.p127!=1))||(i5.u23.p75==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(((i2.u13.p34==1)&&(i2.u38.p112==1))))),TRUE) * !(((((i0.u1.p7!=1)||(i0.u45.p139!=1))||(i8.u41.p127!=1))||(i5.u23.p75==1))))] = FALSE
(forward)formula 5,0,658.278,2792468,1,0,7.07899e+06,1409,2591,6.9202e+06,262,5360,5162056
FORMULA DES-PT-02b-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-15 08:07:54] [INFO ] Applying decomposition
[2020-05-15 08:07:54] [INFO ] Flatten gal took : 45 ms
[2020-05-15 08:07:54] [INFO ] Decomposing Gal with order
[2020-05-15 08:07:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:07:54] [INFO ] Removed a total of 26 redundant transitions.
[2020-05-15 08:07:54] [INFO ] Flatten gal took : 53 ms
[2020-05-15 08:07:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 35 ms.
[2020-05-15 08:07:54] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 13 ms
[2020-05-15 08:07:54] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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 9 CTL formulae.
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 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,7.10209e+18,85.8077,1390696,65124,453,1.76643e+06,2388,642,1.27326e+07,175,15552,0


Converting to forward existential form...Done !
original formula: A(EF(((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u57.p166!=1)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u72.p191!=1))) U (i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p205==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p205==1))))) * !(E(!((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p205==1)) U (!(E(TRUE U ((i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u57.p166!=1)||(i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u72.p191!=1)))) * !((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.p205==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i1.i0.i0.u20.t121, i1.i0.i0.u20.t123, i1.i0.i0.i0.u19.t126, i1.i0.i0.i0.u19.t128, i1.i0.i0.i0.u19.t130, i1.i0.i0.i0.i0.u18.t133, i1.i0.i0.i0.i0.u18.t135, i1.i0.i0.i0.i0.u18.t137, i1.i0.i0.i0.i0.i0.u17.t139, i1.i0.i0.i0.i0.i0.u17.t141, i1.i0.i0.i0.i0.i0.u17.t144, i1.i0.i0.i0.i0.i0.u17.t146, i1.i0.i0.i0.i0.i0.u17.t149, i1.i0.i0.i0.i0.i0.u17.t151, i1.i0.i0.i0.i0.i0.u17.t153, i1.i0.i0.i0.i0.i0.i0.t154, i1.i0.i0.i0.i0.i0.i0.u15.t162, i1.i0.i0.i0.i0.i0.i0.u15.t164, i1.i0.i0.i0.i0.i0.i0.u15.t166, i1.i0.i0.i0.i0.i0.i0.u16.t156, i1.i0.i0.i0.i0.i0.i0.u16.t158, i1.i0.i0.i0.i0.i0.i0.u16.t160, i1.i0.i1.u35.t83, i1.i0.i1.i0.u23.t118, i1.i0.i1.i0.i1.i0.t99, i1.i0.i1.i0.i1.i0.u26.t111, i1.i0.i1.i0.i1.i0.u26.t112, i1.i0.i1.i0.i1.i0.u26.t117, i1.i0.i1.i0.i1.i0.i1.u133.t102, i1.i0.i1.i0.i1.i0.i1.u133.t109, i1.i0.i1.i0.i1.i1.u134.t90, i1.i0.i1.i0.i1.i1.u134.t92, i1.i0.i1.i0.i1.i1.u134.t94, i1.i0.i1.i0.i1.i1.u134.t96, i1.i0.i1.i0.i1.i1.u134.t98, i1.i1.i0.i0.u137.t80, i1.i1.i0.i1.u103.t23, i1.i1.i0.i1.u103.t25, i1.i1.i0.i1.u103.t27, i1.i1.i0.i1.i0.i0.i0.u140.t78, i1.i1.i0.i1.i0.i0.i1.u97.t41, i1.i1.i0.i1.i0.i0.i1.i0.i0.i0.u146.t76, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.t54, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.u79.t55, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.t56, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.t57, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.t58, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.u77.t59, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.t60, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.u76.t61, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.t62, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.u75.t63, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.t64, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.u74.t65, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.t66, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u72.t68, i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.i0.i0.i0.i0.i0.u73.t67, i1.i1.i0.i1.i0.i0.i1.i0.i1.u109.t52, i1.i1.i0.i1.i0.i1.u119.t33, i1.i1.i0.i1.i0.i1.u119.t36, i1.i1.i0.i1.i0.i1.u119.t38, i1.i1.i1.u118.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/152/62/214
Detected timeout of ITS tools.
[2020-05-15 08:28:00] [INFO ] Flatten gal took : 1378 ms
[2020-05-15 08:28:01] [INFO ] Input system was already deterministic with 239 transitions.
[2020-05-15 08:28:01] [INFO ] Transformed 288 places.
[2020-05-15 08:28:01] [INFO ] Transformed 239 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-15 08:28:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-15 08:28:31] [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, --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 9 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,7.10209e+18,18.1316,296124,2,156948,5,1.2512e+06,6,0,1384,1.20477e+06,0


Converting to forward existential form...Done !
original formula: A(EF(((p166!=1)||(p191!=1))) U (p205==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p205==1))))) * !(E(!((p205==1)) U (!(E(TRUE U ((p166!=1)||(p191!=1)))) * !((p205==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t25, t27, t33, t36, t38, t41, t52, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t76, t78, t80, t83, t90, t92, t94, t96, t98, t99, t102, t109, t111, t112, t117, t118, t121, t123, t126, t128, t130, t133, t135, t137, t139, t141, t144, t146, t149, t151, t153, t154, t156, t158, t160, t162, t164, t166, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/177/62/239

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DES-PT-02b"
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 DES-PT-02b, 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 r051-ebro-158902545900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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