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

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

=== Now, execution of the tool begins

BK_START 1589249888849

[2020-05-12 02:18:11] [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-12 02:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:18:11] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-12 02:18:11] [INFO ] Transformed 200 places.
[2020-05-12 02:18:11] [INFO ] Transformed 178 transitions.
[2020-05-12 02:18:11] [INFO ] Found NUPN structural information;
[2020-05-12 02:18:11] [INFO ] Parsed PT model containing 200 places and 178 transitions in 105 ms.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 40 ms.
Incomplete random walk after 100000 steps, including 1167 resets, run finished after 276 ms. (steps per millisecond=362 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 177 rows 199 cols
[2020-05-12 02:18:12] [INFO ] Computed 30 place invariants in 8 ms
[2020-05-12 02:18:12] [INFO ] [Real]Absence check using 20 positive place invariants in 46 ms returned sat
[2020-05-12 02:18:12] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:12] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-05-12 02:18:12] [INFO ] Deduced a trap composed of 9 places in 175 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 8 places in 315 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 23 places in 189 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 56 places in 70 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 63 places in 64 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 14 places in 21 ms
[2020-05-12 02:18:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 941 ms
[2020-05-12 02:18:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:18:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 43 ms returned sat
[2020-05-12 02:18:13] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2020-05-12 02:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:13] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 8 places in 92 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2020-05-12 02:18:13] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2020-05-12 02:18:14] [INFO ] Deduced a trap composed of 56 places in 88 ms
[2020-05-12 02:18:14] [INFO ] Deduced a trap composed of 56 places in 52 ms
[2020-05-12 02:18:14] [INFO ] Deduced a trap composed of 54 places in 46 ms
[2020-05-12 02:18:14] [INFO ] Deduced a trap composed of 14 places in 15 ms
[2020-05-12 02:18:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 477 ms
[2020-05-12 02:18:14] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 8 ms.
[2020-05-12 02:18:14] [INFO ] Added : 144 causal constraints over 29 iterations in 555 ms. Result :sat
[2020-05-12 02:18:14] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned unsat
[2020-05-12 02:18:14] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned unsat
[2020-05-12 02:18:14] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-12 02:18:14] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-12 02:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:15] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 24 places in 48 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 15 places in 21 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 23 places in 20 ms
[2020-05-12 02:18:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 323 ms
[2020-05-12 02:18:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:18:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-05-12 02:18:15] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 39 ms returned sat
[2020-05-12 02:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:15] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 13 places in 47 ms
[2020-05-12 02:18:15] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 28 places in 96 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 14 places in 54 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 23 places in 50 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 49 places in 164 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2020-05-12 02:18:16] [INFO ] Deduced a trap composed of 53 places in 93 ms
[2020-05-12 02:18:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 946 ms
[2020-05-12 02:18:16] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 12 ms.
[2020-05-12 02:18:16] [INFO ] Added : 120 causal constraints over 25 iterations in 370 ms. Result :sat
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 55 places in 82 ms
[2020-05-12 02:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2020-05-12 02:18:17] [INFO ] [Real]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-12 02:18:17] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 5 ms returned sat
[2020-05-12 02:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:17] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 14 places in 34 ms
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 8 places in 35 ms
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 11 places in 33 ms
[2020-05-12 02:18:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 139 ms
[2020-05-12 02:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:18:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2020-05-12 02:18:17] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 6 ms returned sat
[2020-05-12 02:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:17] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 14 places in 99 ms
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-12 02:18:17] [INFO ] Deduced a trap composed of 10 places in 51 ms
[2020-05-12 02:18:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2020-05-12 02:18:17] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 8 ms.
[2020-05-12 02:18:18] [INFO ] Added : 138 causal constraints over 29 iterations in 576 ms. Result :sat
[2020-05-12 02:18:18] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-05-12 02:18:18] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 6 ms returned sat
[2020-05-12 02:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:18] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-05-12 02:18:18] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-05-12 02:18:18] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-12 02:18:19] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2020-05-12 02:18:19] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-05-12 02:18:19] [INFO ] Deduced a trap composed of 24 places in 871 ms
[2020-05-12 02:18:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1226 ms
[2020-05-12 02:18:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:18:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2020-05-12 02:18:20] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:20] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 55 places in 38 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 57 places in 47 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 51 places in 157 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-05-12 02:18:20] [INFO ] Deduced a trap composed of 57 places in 89 ms
[2020-05-12 02:18:21] [INFO ] Deduced a trap composed of 53 places in 258 ms
[2020-05-12 02:18:21] [INFO ] Deduced a trap composed of 55 places in 51 ms
[2020-05-12 02:18:21] [INFO ] Deduced a trap composed of 45 places in 113 ms
[2020-05-12 02:18:21] [INFO ] Deduced a trap composed of 24 places in 53 ms
[2020-05-12 02:18:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1166 ms
[2020-05-12 02:18:21] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 8 ms.
[2020-05-12 02:18:22] [INFO ] Added : 145 causal constraints over 29 iterations in 654 ms. Result :sat
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 58 places in 144 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 58 places in 125 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 59 places in 61 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 57 places in 44 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 55 places in 53 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 52 places in 55 ms
[2020-05-12 02:18:22] [INFO ] Deduced a trap composed of 58 places in 81 ms
[2020-05-12 02:18:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 747 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-12 02:18:23] [INFO ] Flatten gal took : 56 ms
[2020-05-12 02:18:23] [INFO ] Flatten gal took : 26 ms
[2020-05-12 02:18:23] [INFO ] Applying decomposition
[2020-05-12 02:18:23] [INFO ] Flatten gal took : 25 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/graph10145202691448314442.txt, -o, /tmp/graph10145202691448314442.bin, -w, /tmp/graph10145202691448314442.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/graph10145202691448314442.bin, -l, -1, -v, -w, /tmp/graph10145202691448314442.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:18:23] [INFO ] Decomposing Gal with order
[2020-05-12 02:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:18:23] [INFO ] Removed a total of 53 redundant transitions.
[2020-05-12 02:18:23] [INFO ] Flatten gal took : 69 ms
[2020-05-12 02:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-12 02:18:23] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-12 02:18:23] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 27 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 30 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 20 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
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.4161e+10,0.294496,17028,2177,34,23441,309,537,40650,62,600,0


Converting to forward existential form...Done !
original formula: (EF((AX((i11.u58.p193==1)) + AG((i11.u58.p193==1)))) + (EF((i3.i0.u12.p24==1)) * AF(((i4.i1.u28.p66==1)&&(i4.i1.u78.p189==1)))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U (!(EX(!((i11.u58.p193==1)))) + !(E(TRUE U !((i11.u58.p193==1)))))))) * !(E(TRUE U (i3.i0.u12.p24==1))))] = FALSE * [FwdG((Init * !(E(TRUE U (!(EX(!((i11.u58.p193==1)))) + !(E(TRUE U !((i11.u58.p193==1)))))))),!(((i4.i1.u28.p66==1)&&(i4.i1.u78.p189==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t10, t106, t114, t134, i0.t110, i0.u18.t117, i0.u20.t113, i1.t140, i1.u5.t142, i2.u8.t137, i3.t122, i3.i0.t120, i3.i0.t133, i3.i1.t125, i3.i1.t127, i3.i1.t129, i4.i0.t99, i4.i0.t101, i4.i0.u24.t105, i4.i2.t66, i4.i2.u51.t67, i4.i3.t62, i4.i3.u52.t63, i5.i0.u31.t95, i5.i1.u22.t109, i6.i2.t74, i6.i2.u47.t75, i6.i3.t58, i6.i3.u54.t59, i7.i0.t86, i7.i0.u40.t87, i7.i1.t82, i7.i1.u42.t83, i8.t78, i8.u45.t79, i9.t70, i9.u49.t71, i10.t54, i10.u56.t55, i11.t42, i11.t37, i11.t35, i11.t33, i11.t30, i11.t27, i11.t25, i11.t23, i11.t20, i11.t17, i11.t8, i11.t5, i11.u58.t3, i11.u58.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/120/53/177
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an 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 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
(forward)formula 0,1,5.33451,182348,1,0,314799,475,3367,642958,324,946,533468
FORMULA BusinessProcesses-PT-01-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EG(EF((i11.u68.p168==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i11.u68.p168==1)))] = FALSE
(forward)formula 1,0,10.2612,301676,1,0,582626,570,3393,990353,325,1573,836630
FORMULA BusinessProcesses-PT-01-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(EF(((i7.i1.u43.p105==1)&&(i3.i0.u10.p23==1)))) * EX((i11.u58.p144!=1)))
=> equivalent forward existential formula: [(EY((Init * EX(E(TRUE U ((i7.i1.u43.p105==1)&&(i3.i0.u10.p23==1)))))) * (i11.u58.p144!=1))] != FALSE
(forward)formula 2,1,10.4047,306428,1,0,590852,573,3404,1.00168e+06,326,1580,854145
FORMULA BusinessProcesses-PT-01-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((i8.u45.p107==1)&&(i4.i3.u52.p127==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i8.u45.p107==1)&&(i4.i3.u52.p127==1)))] != FALSE
(forward)formula 3,1,10.4072,306692,1,0,590967,573,3411,1.00195e+06,326,1580,854681
FORMULA BusinessProcesses-PT-01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i5.i1.u22.p51==1)&&(i10.u56.p138==1))&&(i11.u58.p193==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i5.i1.u22.p51==1)&&(i10.u56.p138==1))&&(i11.u58.p193==1)))] != FALSE
(forward)formula 4,1,10.4079,306692,1,0,590970,573,3419,1.00198e+06,326,1580,854805
FORMULA BusinessProcesses-PT-01-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 5,1,10.408,306692,1,0,590970,573,3419,1.00198e+06,326,1580,854805
FORMULA BusinessProcesses-PT-01-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(E((i5.i1.u2.p4!=1) U (i6.i3.u54.p132==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),(i5.i1.u2.p4!=1)) * (i6.i3.u54.p132==1))] != FALSE
(forward)formula 6,0,10.417,306692,1,0,591363,660,3866,1.00232e+06,352,1752,857467
FORMULA BusinessProcesses-PT-01-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i2.u8.p18==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i2.u8.p18==1))] != FALSE
(forward)formula 7,1,10.4197,307220,1,0,591371,660,3868,1.00245e+06,352,1752,858839
FORMULA BusinessProcesses-PT-01-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EX(((i11.u77.p187==1)&&(i3.i0.u11.p37==1))) * (i4.i0.u24.p58==1)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (i4.i0.u24.p58==1))) * ((i11.u77.p187==1)&&(i3.i0.u11.p37==1)))] != FALSE
(forward)formula 8,0,10.4475,307748,1,0,593869,660,3876,1.00874e+06,352,1752,863418
FORMULA BusinessProcesses-PT-01-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AG((i1.u6.p13!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i1.u6.p13!=1))))))] = FALSE
(forward)formula 9,0,15.4578,427076,1,0,858035,666,3882,1.30424e+06,352,1814,1133589
FORMULA BusinessProcesses-PT-01-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(((i11.u77.p187!=1) * EF((i0.u18.p40==1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * (i11.u77.p187!=1)),TRUE) * (i0.u18.p40==1))] != FALSE
(forward)formula 10,1,15.724,434996,1,0,871266,684,3945,1.32998e+06,353,1913,1177890
FORMULA BusinessProcesses-PT-01-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((((i4.i1.u28.p65==1)&&(i4.i3.u52.p129==1))&&(i4.i1.u28.p188==1))||((i4.i0.u29.p69==1)&&(i4.i0.u30.p72==1))) U EF(((i4.i0.u26.p60==1)&&(i2.u8.p18==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((i4.i0.u26.p60==1)&&(i2.u8.p18==1))))))) * !(E(!(E(TRUE U ((i4.i0.u26.p60==1)&&(i2.u8.p18==1)))) U (!(((((i4.i1.u28.p65==1)&&(i4.i3.u52.p129==1))&&(i4.i1.u28.p188==1))||((i4.i0.u29.p69==1)&&(i4.i0.u30.p72==1)))) * !(E(TRUE U ((i4.i0.u26.p60==1)&&(i2.u8.p18==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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an 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 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
(forward)formula 11,1,40.0201,862944,1,0,1.50974e+06,783,4160,2.63228e+06,373,2126,1698599
FORMULA BusinessProcesses-PT-01-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF((((i4.i0.u29.p69==1)&&(i4.i0.u30.p72==1))&&(i9.u48.p116==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i4.i0.u29.p69==1)&&(i4.i0.u30.p72==1))&&(i9.u48.p116==1)))] = FALSE
(forward)formula 12,0,40.022,863208,1,0,1.50975e+06,783,4163,2.63241e+06,373,2126,1699055
FORMULA BusinessProcesses-PT-01-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((AF((((i10.u56.p137==1)||(((i4.i1.u25.p71==1)&&(i4.i3.u52.p129==1))&&(i4.i1.u28.p188==1)))&&((i4.i2.u51.p122==1)||(((i1.u5.p10==1)&&(i9.u49.p118==1))&&(i11.u58.p193==1))))) * EG((((i3.i1.u16.p30!=1)||(i6.i0.u35.p83==1))||(i6.i3.u55.p135==1)))) + !(EF((i11.u69.p169==1))))
=> equivalent forward existential formula: [(FwdU((Init * !((!(EG(!((((i10.u56.p137==1)||(((i4.i1.u25.p71==1)&&(i4.i3.u52.p129==1))&&(i4.i1.u28.p188==1)))&&((i4.i2.u51.p122==1)||(((i1.u5.p10==1)&&(i9.u49.p118==1))&&(i11.u58.p193==1))))))) * EG((((i3.i1.u16.p30!=1)||(i6.i0.u35.p83==1))||(i6.i3.u55.p135==1)))))),TRUE) * (i11.u69.p169==1))] = FALSE
(forward)formula 13,0,65.2044,1433004,1,0,2.32082e+06,833,4256,4.24218e+06,373,2417,2520925
FORMULA BusinessProcesses-PT-01-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((i4.i1.u81.p196!=1) U EF(((i1.u6.p14==1)||(i4.i0.u27.p64==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(i4.i1.u81.p196!=1)),TRUE) * ((i1.u6.p14==1)||(i4.i0.u27.p64==1)))] != FALSE
(forward)formula 14,1,65.3399,1437228,1,0,2.32752e+06,833,4278,4.25459e+06,373,2417,2538826
FORMULA BusinessProcesses-PT-01-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AF(((((i3.i1.u13.p26!=1)||(i7.i1.u42.p104!=1))||(i3.i1.u14.p149!=1))&&(i4.i1.u76.p184==1)))) * EF(((((((i5.i1.u22.p51==1)&&(i10.u56.p138==1))&&(i11.u58.p193==1))||(((i5.i1.u23.p54==1)&&(i6.i3.u54.p134==1))&&(i5.i1.u74.p179==1)))||(i4.i1.u82.p199==1)) + EX((i2.u8.p18==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EG(!(((((i3.i1.u13.p26!=1)||(i7.i1.u42.p104!=1))||(i3.i1.u14.p149!=1))&&(i4.i1.u76.p184==1))))))),TRUE) * (((((i5.i1.u22.p51==1)&&(i10.u56.p138==1))&&(i11.u58.p193==1))||(((i5.i1.u23.p54==1)&&(i6.i3.u54.p134==1))&&(i5.i1.u74.p179==1)))||(i4.i1.u82.p199==1)))] != FALSE + [(EY(FwdU((Init * !(!(EG(!(((((i3.i1.u13.p26!=1)||(i7.i1.u42.p104!=1))||(i3.i1.u14.p149!=1))&&(i4.i1.u76.p184==1))))))),TRUE)) * (i2.u8.p18==1))] != FALSE)
(forward)formula 15,1,71.7169,1567908,1,0,2.5258e+06,833,4341,4.62838e+06,374,2419,2708275
FORMULA BusinessProcesses-PT-01-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589249975737

--------------------
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="BusinessProcesses-PT-01"
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 BusinessProcesses-PT-01, 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 r021-oct2-158897699100452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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