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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.8K 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 85K 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-06-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589250904940

[2020-05-12 02:35:09] [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:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:35:09] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2020-05-12 02:35:09] [INFO ] Transformed 376 places.
[2020-05-12 02:35:09] [INFO ] Transformed 297 transitions.
[2020-05-12 02:35:09] [INFO ] Found NUPN structural information;
[2020-05-12 02:35:09] [INFO ] Parsed PT model containing 376 places and 297 transitions in 127 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 89 ms.
Incomplete random walk after 100000 steps, including 1021 resets, run finished after 411 ms. (steps per millisecond=243 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 296 rows 375 cols
[2020-05-12 02:35:10] [INFO ] Computed 81 place invariants in 35 ms
[2020-05-12 02:35:10] [INFO ] [Real]Absence check using 42 positive place invariants in 42 ms returned sat
[2020-05-12 02:35:10] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 19 ms returned sat
[2020-05-12 02:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:11] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-05-12 02:35:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:11] [INFO ] [Nat]Absence check using 42 positive place invariants in 118 ms returned sat
[2020-05-12 02:35:11] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 49 ms returned sat
[2020-05-12 02:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:12] [INFO ] [Nat]Absence check using state equation in 1194 ms returned sat
[2020-05-12 02:35:13] [INFO ] Deduced a trap composed of 10 places in 496 ms
[2020-05-12 02:35:13] [INFO ] Deduced a trap composed of 8 places in 584 ms
[2020-05-12 02:35:14] [INFO ] Deduced a trap composed of 12 places in 282 ms
[2020-05-12 02:35:15] [INFO ] Deduced a trap composed of 16 places in 717 ms
[2020-05-12 02:35:16] [INFO ] Deduced a trap composed of 22 places in 1500 ms
[2020-05-12 02:35:16] [INFO ] Deduced a trap composed of 13 places in 92 ms
[2020-05-12 02:35:17] [INFO ] Deduced a trap composed of 25 places in 912 ms
[2020-05-12 02:35:17] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-05-12 02:35:17] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2020-05-12 02:35:17] [INFO ] Deduced a trap composed of 23 places in 77 ms
[2020-05-12 02:35:18] [INFO ] Deduced a trap composed of 11 places in 39 ms
[2020-05-12 02:35:18] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-05-12 02:35:18] [INFO ] Deduced a trap composed of 25 places in 127 ms
[2020-05-12 02:35:20] [INFO ] Deduced a trap composed of 17 places in 2046 ms
[2020-05-12 02:35:20] [INFO ] Deduced a trap composed of 77 places in 229 ms
[2020-05-12 02:35:20] [INFO ] Deduced a trap composed of 21 places in 200 ms
[2020-05-12 02:35:21] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2020-05-12 02:35:21] [INFO ] Deduced a trap composed of 16 places in 185 ms
[2020-05-12 02:35:21] [INFO ] Deduced a trap composed of 19 places in 185 ms
[2020-05-12 02:35:21] [INFO ] Deduced a trap composed of 78 places in 183 ms
[2020-05-12 02:35:21] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8865 ms
[2020-05-12 02:35:21] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 18 ms.
[2020-05-12 02:35:23] [INFO ] Added : 292 causal constraints over 59 iterations in 1864 ms. Result :sat
[2020-05-12 02:35:24] [INFO ] Deduced a trap composed of 90 places in 1107 ms
[2020-05-12 02:35:24] [INFO ] Deduced a trap composed of 89 places in 171 ms
[2020-05-12 02:35:25] [INFO ] Deduced a trap composed of 82 places in 208 ms
[2020-05-12 02:35:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1668 ms
[2020-05-12 02:35:25] [INFO ] [Real]Absence check using 42 positive place invariants in 55 ms returned sat
[2020-05-12 02:35:25] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 29 ms returned sat
[2020-05-12 02:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:25] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2020-05-12 02:35:26] [INFO ] Deduced a trap composed of 22 places in 92 ms
[2020-05-12 02:35:26] [INFO ] Deduced a trap composed of 8 places in 165 ms
[2020-05-12 02:35:27] [INFO ] Deduced a trap composed of 11 places in 1634 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 23 places in 2352 ms
[2020-05-12 02:35:30] [INFO ] Deduced a trap composed of 18 places in 546 ms
[2020-05-12 02:35:31] [INFO ] Deduced a trap composed of 16 places in 1000 ms
[2020-05-12 02:35:32] [INFO ] Deduced a trap composed of 14 places in 191 ms
[2020-05-12 02:35:32] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-12 02:35:34] [INFO ] Deduced a trap composed of 20 places in 2149 ms
[2020-05-12 02:35:34] [INFO ] Deduced a trap composed of 24 places in 59 ms
[2020-05-12 02:35:34] [INFO ] Deduced a trap composed of 23 places in 51 ms
[2020-05-12 02:35:34] [INFO ] Deduced a trap composed of 19 places in 57 ms
[2020-05-12 02:35:35] [INFO ] Deduced a trap composed of 21 places in 406 ms
[2020-05-12 02:35:35] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-12 02:35:35] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2020-05-12 02:35:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 9247 ms
[2020-05-12 02:35:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:35:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 142 ms returned sat
[2020-05-12 02:35:35] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 55 ms returned sat
[2020-05-12 02:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:35:37] [INFO ] [Nat]Absence check using state equation in 1649 ms returned sat
[2020-05-12 02:35:37] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-05-12 02:35:38] [INFO ] Deduced a trap composed of 8 places in 1617 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 13 places in 1570 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 21 places in 108 ms
[2020-05-12 02:35:40] [INFO ] Deduced a trap composed of 19 places in 109 ms
[2020-05-12 02:35:42] [INFO ] Deduced a trap composed of 20 places in 1271 ms
[2020-05-12 02:35:42] [INFO ] Deduced a trap composed of 17 places in 595 ms
[2020-05-12 02:35:42] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2020-05-12 02:35:43] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2020-05-12 02:35:45] [INFO ] Deduced a trap composed of 24 places in 1982 ms
[2020-05-12 02:35:49] [INFO ] Deduced a trap composed of 19 places in 4375 ms
[2020-05-12 02:35:49] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 77 places in 83 ms
[2020-05-12 02:35:50] [INFO ] Deduced a trap composed of 80 places in 82 ms
[2020-05-12 02:35:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 13026 ms
[2020-05-12 02:35:50] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 32 ms.
[2020-05-12 02:35:52] [INFO ] Added : 275 causal constraints over 56 iterations in 2106 ms. Result :sat
[2020-05-12 02:35:53] [INFO ] Deduced a trap composed of 73 places in 704 ms
[2020-05-12 02:35:55] [INFO ] Deduced a trap composed of 81 places in 1868 ms
[2020-05-12 02:35:55] [INFO ] Deduced a trap composed of 80 places in 176 ms
[2020-05-12 02:35:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 02:35:58] [INFO ] Deduced a trap composed of 9 places in 2702 ms
[2020-05-12 02:35:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s137 s266 s267 s268) 0)") while checking expression at index 1
[2020-05-12 02:35:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 02:35:58] [INFO ] Flatten gal took : 113 ms
[2020-05-12 02:35:58] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 02:35:58] [INFO ] Flatten gal took : 28 ms
FORMULA BusinessProcesses-PT-06-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:35:58] [INFO ] Applying decomposition
[2020-05-12 02:35:58] [INFO ] Flatten gal took : 27 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/graph13402020446523518563.txt, -o, /tmp/graph13402020446523518563.bin, -w, /tmp/graph13402020446523518563.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/graph13402020446523518563.bin, -l, -1, -v, -w, /tmp/graph13402020446523518563.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:35:58] [INFO ] Decomposing Gal with order
[2020-05-12 02:35:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:35:58] [INFO ] Removed a total of 42 redundant transitions.
[2020-05-12 02:35:58] [INFO ] Flatten gal took : 106 ms
[2020-05-12 02:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2020-05-12 02:35:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2020-05-12 02:35:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.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/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 13 CTL formulae.
built 46 ordering constraints for composite.
built 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 22 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 47 ordering constraints for composite.
built 24 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 25 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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,2.91565e+18,17.0909,440684,74167,31,1.04273e+06,436,850,885472,54,812,0


Converting to forward existential form...Done !
original formula: EF((i14.i0.u38.p128==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i14.i0.u38.p128==1))] != FALSE
(forward)formula 0,1,17.2171,440684,1,0,1.04273e+06,436,855,885472,57,812,112
FORMULA BusinessProcesses-PT-06-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AG(((i4.i1.u39.p103==0)||(i15.u135.p328==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((i4.i1.u39.p103==0)||(i15.u135.p328==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t218, t226, i0.t214, i0.t178, i0.u18.t221, i0.u20.t217, i0.u37.t195, i1.t222, i1.i0.u16.t225, i1.i1.u14.t229, i2.t238, i2.t234, i2.t230, i2.u6.t244, i2.u8.t241, i2.u10.t237, i2.u12.t233, i3.i0.u22.t213, i4.i2.t140, i4.i2.u81.t141, i5.i0.t170, i5.i0.u53.t177, i5.i0.u55.t173, i5.i1.u57.t169, i6.i1.t92, i6.i1.u105.t93, i6.i2.t88, i6.i2.u108.t89, i7.i1.t112, i7.i1.u96.t113, i7.i2.t104, i7.i2.u100.t105, i8.i1.t152, i8.i1.u76.t153, i8.i2.t136, i8.i2.u83.t137, i8.i3.t132, i8.i3.u85.t133, i8.i4.t128, i8.i4.u87.t129, i9.i0.t163, i9.i0.u69.t164, i9.i1.t160, i9.i1.u72.t161, i9.i2.t156, i9.i2.u74.t157, i10.t148, i10.u77.t149, i11.i0.t124, i11.i0.u90.t125, i11.i1.t120, i11.i1.u91.t121, i12.t116, i12.u94.t117, i13.t108, i13.u98.t109, i14.i1.t96, i14.i1.u104.t97, i15.t82, i15.t71, i15.t69, i15.t66, i15.t63, i15.t60, i15.t57, i15.t54, i15.t51, i15.t48, i15.t45, i15.t43, i15.t41, i15.t39, i15.t37, i15.t35, i15.t33, i15.t31, i15.t12, i15.t9, i15.t6, i15.u110.t4, i15.u110.t29, i16.t144, i16.u79.t145, i17.i0.t100, i17.i0.u102.t101, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/211/85/296
(forward)formula 1,0,92.951,2298332,1,0,5.57772e+06,436,2765,4.72355e+06,152,812,25097
FORMULA BusinessProcesses-PT-06-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(AG(((i2.u6.p16==0)||(i15.u110.p332==1))) U AX((i5.i0.u1.p4==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((i2.u6.p16==0)||(i15.u110.p332==1)))))) * !(EX(!((i5.i0.u1.p4==1)))))] != FALSE
(forward)formula 2,0,112.262,2298332,1,0,5.57772e+06,476,2873,4.72355e+06,160,812,5791430
FORMULA BusinessProcesses-PT-06-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AX(FALSE) * EX(((i14.i0.u156.p375==0)||(i5.i0.u53.p133==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(EX(!(FALSE))))) * ((i14.i0.u156.p375==0)||(i5.i0.u53.p133==1)))] != FALSE
(forward)formula 3,0,112.39,2298332,1,0,5.57772e+06,478,2892,4.72355e+06,161,812,5908507
FORMULA BusinessProcesses-PT-06-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((i5.i1.u58.p145==0)||(i11.i0.u90.p221==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i5.i1.u58.p145==0)||(i11.i0.u90.p221==1))))] = FALSE
(forward)formula 4,0,112.651,2298332,1,0,5.57772e+06,478,2900,4.72355e+06,161,812,5982198
FORMULA BusinessProcesses-PT-06-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AF(((i6.i1.u105.p263==0)||(i1.i1.u122.p303==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((i6.i1.u105.p263==0)||(i1.i1.u122.p303==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
Fast SCC detection found a local 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 an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
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
(forward)formula 5,0,239.773,4536848,1,0,1.0946e+07,658,4468,9.69007e+06,259,1275,19276316
FORMULA BusinessProcesses-PT-06-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i2.u6.p17==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i2.u6.p17==1))] != FALSE
(forward)formula 6,1,240.043,4548992,1,0,1.09815e+07,658,4470,9.72668e+06,259,1275,19346057
FORMULA BusinessProcesses-PT-06-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(EX(((i10.u77.p191==0)||(i8.i1.u76.p187==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((i10.u77.p191==0)||(i8.i1.u76.p187==1)))))] != FALSE
(forward)formula 7,1,240.519,4570376,1,0,1.10315e+07,658,4475,9.7846e+06,259,1275,19456773
FORMULA BusinessProcesses-PT-06-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(((i4.i0.u41.p106==0)||(i8.i4.u87.p217==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((i4.i0.u41.p106==0)||(i8.i4.u87.p217==1))))] = FALSE
(forward)formula 8,0,279.363,4571960,1,0,1.10328e+07,681,2561,9.78628e+06,153,1341,3330832
FORMULA BusinessProcesses-PT-06-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((EF(((i15.u119.p296==0)||(i9.i0.u70.p170==1))) * ((i11.i1.u91.p227==0)||(i7.i1.u21.p62==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((i15.u119.p296==0)||(i9.i0.u70.p170==1)))))] = FALSE * [(FwdU(Init,TRUE) * !(((i11.i1.u91.p227==0)||(i7.i1.u21.p62==1))))] = FALSE)
(forward)formula 9,0,279.391,4571960,1,0,1.10328e+07,681,2571,9.78628e+06,155,1341,3333675
FORMULA BusinessProcesses-PT-06-CTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG((i8.i4.u87.p217==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i8.i4.u87.p217==1))] != FALSE
(forward)formula 10,1,279.513,4571960,1,0,1.10328e+07,681,2693,9.78628e+06,160,1341,3366738
FORMULA BusinessProcesses-PT-06-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EX((((i7.i2.u99.p245==0)||(i8.i2.u13.p38==1))&&((i5.i0.u56.p142==0)||(i5.i0.u56.p142==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((i7.i2.u99.p245==0)||(i8.i2.u13.p38==1))&&((i5.i0.u56.p142==0)||(i5.i0.u56.p142==1))))))] = FALSE
(forward)formula 11,0,285.319,4571960,1,0,1.10328e+07,681,3062,9.78628e+06,172,1341,5206316
FORMULA BusinessProcesses-PT-06-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E(((i7.i1.u96.p236==0)||(i17.i2.u154.p370==1)) U (i11.i0.u64.p160==1)))
=> equivalent forward existential formula: [FwdG(Init,E(((i7.i1.u96.p236==0)||(i17.i2.u154.p370==1)) U (i11.i0.u64.p160==1)))] != FALSE
(forward)formula 12,1,286.413,4571960,1,0,1.10328e+07,681,3737,9.78628e+06,192,1341,5343728
FORMULA BusinessProcesses-PT-06-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589251246546

--------------------
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-06"
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-06, 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-158897699100491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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