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.r021-oct2-158897699100467.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 BusinessProcesses-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K 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 BusinessProcesses-PT-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589250227897

[2020-05-12 02:23:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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-12 02:23:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:23:51] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-05-12 02:23:51] [INFO ] Transformed 274 places.
[2020-05-12 02:23:51] [INFO ] Transformed 237 transitions.
[2020-05-12 02:23:51] [INFO ] Found NUPN structural information;
[2020-05-12 02:23:51] [INFO ] Parsed PT model containing 274 places and 237 transitions in 97 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 94 ms.
Incomplete random walk after 100000 steps, including 1197 resets, run finished after 320 ms. (steps per millisecond=312 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:23:52] [INFO ] Computed 43 place invariants in 30 ms
[2020-05-12 02:23:52] [INFO ] [Real]Absence check using 31 positive place invariants in 30 ms returned sat
[2020-05-12 02:23:52] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:52] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2020-05-12 02:23:52] [INFO ] Deduced a trap composed of 8 places in 279 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 22 places in 320 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 12 places in 200 ms
[2020-05-12 02:23:53] [INFO ] Deduced a trap composed of 26 places in 219 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 15 places in 302 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 33 places in 175 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 68 places in 87 ms
[2020-05-12 02:23:54] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2020-05-12 02:23:56] [INFO ] Deduced a trap composed of 14 places in 2272 ms
[2020-05-12 02:23:57] [INFO ] Deduced a trap composed of 38 places in 201 ms
[2020-05-12 02:23:57] [INFO ] Deduced a trap composed of 73 places in 130 ms
[2020-05-12 02:23:57] [INFO ] Deduced a trap composed of 16 places in 797 ms
[2020-05-12 02:23:58] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-05-12 02:23:58] [INFO ] Deduced a trap composed of 26 places in 100 ms
[2020-05-12 02:23:58] [INFO ] Deduced a trap composed of 33 places in 55 ms
[2020-05-12 02:23:58] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5609 ms
[2020-05-12 02:23:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:23:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 74 ms returned sat
[2020-05-12 02:23:58] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2020-05-12 02:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:23:58] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2020-05-12 02:23:58] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 11 places in 215 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 14 places in 212 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 14 places in 78 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-12 02:23:59] [INFO ] Deduced a trap composed of 74 places in 81 ms
[2020-05-12 02:24:01] [INFO ] Deduced a trap composed of 71 places in 1258 ms
[2020-05-12 02:24:01] [INFO ] Deduced a trap composed of 37 places in 104 ms
[2020-05-12 02:24:01] [INFO ] Deduced a trap composed of 72 places in 94 ms
[2020-05-12 02:24:01] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2020-05-12 02:24:01] [INFO ] Deduced a trap composed of 48 places in 59 ms
[2020-05-12 02:24:02] [INFO ] Deduced a trap composed of 21 places in 1419 ms
[2020-05-12 02:24:03] [INFO ] Deduced a trap composed of 41 places in 85 ms
[2020-05-12 02:24:03] [INFO ] Deduced a trap composed of 29 places in 897 ms
[2020-05-12 02:24:04] [INFO ] Deduced a trap composed of 77 places in 172 ms
[2020-05-12 02:24:04] [INFO ] Deduced a trap composed of 74 places in 185 ms
[2020-05-12 02:24:04] [INFO ] Deduced a trap composed of 31 places in 96 ms
[2020-05-12 02:24:04] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5761 ms
[2020-05-12 02:24:04] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 21 ms.
[2020-05-12 02:24:06] [INFO ] Added : 193 causal constraints over 39 iterations in 1626 ms. Result :sat
[2020-05-12 02:24:07] [INFO ] Deduced a trap composed of 68 places in 1020 ms
[2020-05-12 02:24:08] [INFO ] Deduced a trap composed of 69 places in 1596 ms
[2020-05-12 02:24:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2721 ms
[2020-05-12 02:24:08] [INFO ] [Real]Absence check using 31 positive place invariants in 50 ms returned sat
[2020-05-12 02:24:08] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-05-12 02:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:09] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-05-12 02:24:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:24:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2020-05-12 02:24:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 18 ms returned sat
[2020-05-12 02:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:10] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2020-05-12 02:24:11] [INFO ] Deduced a trap composed of 13 places in 1509 ms
[2020-05-12 02:24:11] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2020-05-12 02:24:12] [INFO ] Deduced a trap composed of 21 places in 101 ms
[2020-05-12 02:24:12] [INFO ] Deduced a trap composed of 15 places in 87 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 14 places in 1270 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 24 places in 158 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 38 places in 50 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 31 places in 77 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-05-12 02:24:13] [INFO ] Deduced a trap composed of 38 places in 66 ms
[2020-05-12 02:24:14] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-05-12 02:24:14] [INFO ] Deduced a trap composed of 40 places in 460 ms
[2020-05-12 02:24:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4362 ms
[2020-05-12 02:24:14] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 29 ms.
[2020-05-12 02:24:15] [INFO ] Added : 156 causal constraints over 32 iterations in 1254 ms. Result :sat
[2020-05-12 02:24:16] [INFO ] [Real]Absence check using 31 positive place invariants in 154 ms returned sat
[2020-05-12 02:24:16] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 68 ms returned sat
[2020-05-12 02:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:16] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-05-12 02:24:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:24:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2020-05-12 02:24:16] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2020-05-12 02:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:24:16] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2020-05-12 02:24:16] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2020-05-12 02:24:16] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 35 places in 94 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 40 places in 70 ms
[2020-05-12 02:24:17] [INFO ] Deduced a trap composed of 33 places in 59 ms
[2020-05-12 02:24:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 900 ms
[2020-05-12 02:24:17] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2020-05-12 02:24:18] [INFO ] Added : 132 causal constraints over 27 iterations in 727 ms. Result :sat
[2020-05-12 02:24:18] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:24:18] [INFO ] Flatten gal took : 98 ms
[2020-05-12 02:24:18] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:24:18] [INFO ] Flatten gal took : 29 ms
FORMULA BusinessProcesses-PT-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:24:18] [INFO ] Applying decomposition
[2020-05-12 02:24:18] [INFO ] Flatten gal took : 13 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/graph14660831145929475897.txt, -o, /tmp/graph14660831145929475897.bin, -w, /tmp/graph14660831145929475897.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/graph14660831145929475897.bin, -l, -1, -v, -w, /tmp/graph14660831145929475897.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:24:19] [INFO ] Decomposing Gal with order
[2020-05-12 02:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:24:19] [INFO ] Removed a total of 48 redundant transitions.
[2020-05-12 02:24:19] [INFO ] Flatten gal took : 93 ms
[2020-05-12 02:24:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2020-05-12 02:24:19] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 6 ms
[2020-05-12 02:24:19] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 0 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/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.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/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 45 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 37 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4794e+13,0.338386,18152,2549,27,24260,526,611,47616,49,903,0


Converting to forward existential form...Done !
original formula: !(E(((((i2.i1.u6.p14==0)||(i4.i0.u23.p55==1))||(i6.i3.u63.p157==0))||(i15.i0.u26.p62==1)) U ((i2.i0.u9.p21!=0)&&(i8.i1.u53.p135!=1))))
=> equivalent forward existential formula: [(FwdU(Init,((((i2.i1.u6.p14==0)||(i4.i0.u23.p55==1))||(i6.i3.u63.p157==0))||(i15.i0.u26.p62==1))) * ((i2.i0.u9.p21!=0)&&(i8.i1.u53.p135!=1)))] = FALSE
(forward)formula 0,0,1.23583,48368,1,0,74464,526,1270,134575,95,903,185540
FORMULA BusinessProcesses-PT-03-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((i10.u60.p149==0)||(i1.u105.p258==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i10.u60.p149==0)||(i1.u105.p258==1))))] = FALSE
(forward)formula 1,0,1.24099,48632,1,0,74654,526,1277,135100,96,903,187414
FORMULA BusinessProcesses-PT-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(!(AG(((i18.u88.p222==0)||(i8.i0.u16.p39==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((i18.u88.p222==0)||(i8.i0.u16.p39==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t137, t157, t163, t169, t179, i0.t141, i0.u31.t148, i0.u33.t144, i1.u27.t156, i1.u29.t152, i2.i0.t195, i2.i0.u9.t191, i2.i1.t187, i2.i1.u8.t193, i2.i1.u10.t190, i3.t186, i3.t184, i3.u14.t182, i3.u15.t180, i4.i0.t166, i4.i0.u21.t168, i4.i1.t87, i4.i1.u70.t88, i5.i0.u37.t136, i5.i1.u35.t140, i6.i1.t111, i6.i1.u57.t112, i6.i2.t103, i6.i2.u62.t104, i6.i3.t99, i6.i3.u64.t100, i7.i0.t130, i7.i0.u48.t131, i7.i1.t127, i7.i1.u49.t128, i7.i2.t123, i7.i2.u52.t124, i8.i0.u16.t178, i8.i1.t119, i8.i1.u53.t120, i9.t115, i9.u55.t116, i10.t107, i10.u60.t108, i11.t172, i11.u18.t174, i12.t95, i12.u66.t96, i13.i1.t91, i13.i1.u67.t92, i13.i2.t79, i13.i2.u74.t80, i13.i3.t71, i13.i3.u78.t72, i14.t83, i14.u72.t84, i15.i0.t162, i15.i0.u25.t160, i15.i1.t75, i15.i1.u76.t76, i16.t55, i16.t51, i16.t47, i16.t40, i16.t36, i16.t33, i16.t31, i16.t28, i16.t26, i16.t23, i16.t21, i16.t18, i16.t15, i16.t12, i16.t9, i16.t6, i16.t3, i16.u79.t1, i17.t49, i17.u82.t53, i18.t44, i18.t42, i18.u90.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/153/83/236
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 a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 2,1,5.8553,208880,1,0,467840,847,4331,546688,281,1660,990753
FORMULA BusinessProcesses-PT-03-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(TRUE)
=> equivalent forward existential formula: [FwdG(Init,TRUE)] != FALSE
(forward)formula 3,1,6.68602,233432,1,0,512887,859,4521,616953,281,1682,1084534
FORMULA BusinessProcesses-PT-03-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((i13.i2.u74.p183==0)||(i12.u28.p67==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i13.i2.u74.p183==0)||(i12.u28.p67==1))))] = FALSE
(forward)formula 4,0,6.71092,233960,1,0,513009,859,4527,617230,281,1682,1085205
FORMULA BusinessProcesses-PT-03-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 5,1,6.711,233960,1,0,513009,859,4527,617237,281,1682,1085205
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AX(FALSE) + (((i18.u90.p227==0)||(i6.i0.u44.p109==1))&&((i2.i0.u7.p17==0)||(i16.u99.p245==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((((i18.u90.p227==0)||(i6.i0.u44.p109==1))&&((i2.i0.u7.p17==0)||(i16.u99.p245==1)))))) * !(FALSE))] = FALSE
(forward)formula 6,0,6.74218,233960,1,0,513346,859,4541,617873,281,1682,1088532
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG((((i0.u34.p87==0)||(i6.i2.u61.p152==1))&&(((i13.i3.u78.p194==0)||(i15.i1.u76.p189==1))||(i7.i2.u52.p128==1)))) * E(((i16.u99.p246!=0)&&(i16.u110.p268!=1)) U ((i5.i0.u37.p95==0)||(i12.u28.p67==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((((i0.u34.p87==0)||(i6.i2.u61.p152==1))&&(((i13.i3.u78.p194==0)||(i15.i1.u76.p189==1))||(i7.i2.u52.p128==1)))))] = FALSE * [(Init * !(E(((i16.u99.p246!=0)&&(i16.u110.p268!=1)) U ((i5.i0.u37.p95==0)||(i12.u28.p67==1)))))] = FALSE)
(forward)formula 7,0,7.11796,241880,1,0,525469,859,4610,653729,284,1685,1108733
FORMULA BusinessProcesses-PT-03-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((i18.u90.p227==0)||(i13.i1.u67.p168==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i18.u90.p227==0)||(i13.i1.u67.p168==1))))] = FALSE
(forward)formula 8,0,7.14068,241880,1,0,525501,859,4614,653782,284,1685,1108966
FORMULA BusinessProcesses-PT-03-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((i16.u99.p245==0)||(i8.i0.u5.p11==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i16.u99.p245==0)||(i8.i0.u5.p11==1))))] = FALSE
(forward)formula 9,0,7.16492,242144,1,0,525617,859,4620,653993,284,1685,1110305
FORMULA BusinessProcesses-PT-03-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589250267582

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BusinessProcesses-PT-03"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;