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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 17K 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.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.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 59K 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-02-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589250063343

[2020-05-12 02:21:04] [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:21:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:21:04] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-05-12 02:21:04] [INFO ] Transformed 262 places.
[2020-05-12 02:21:04] [INFO ] Transformed 219 transitions.
[2020-05-12 02:21:04] [INFO ] Found NUPN structural information;
[2020-05-12 02:21:04] [INFO ] Parsed PT model containing 262 places and 219 transitions in 93 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Incomplete random walk after 100000 steps, including 1359 resets, run finished after 206 ms. (steps per millisecond=485 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:21:04] [INFO ] Computed 43 place invariants in 18 ms
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using state equation in 94 ms returned unsat
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:05] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 13 places in 36 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 19 places in 19 ms
[2020-05-12 02:21:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 254 ms
[2020-05-12 02:21:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 30 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:05] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 11 places in 28 ms
[2020-05-12 02:21:05] [INFO ] Deduced a trap composed of 13 places in 26 ms
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 19 places in 18 ms
[2020-05-12 02:21:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 210 ms
[2020-05-12 02:21:06] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:21:06] [INFO ] Added : 152 causal constraints over 31 iterations in 492 ms. Result :sat
[2020-05-12 02:21:06] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:21:06] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:06] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 14 places in 48 ms
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-05-12 02:21:06] [INFO ] Deduced a trap composed of 13 places in 73 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 21 places in 40 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 17 places in 38 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 16 places in 23 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-05-12 02:21:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 472 ms
[2020-05-12 02:21:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:07] [INFO ] [Nat]Absence check using 30 positive place invariants in 37 ms returned sat
[2020-05-12 02:21:07] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:07] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 14 places in 52 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 13 places in 61 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 21 places in 46 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-05-12 02:21:07] [INFO ] Deduced a trap composed of 18 places in 22 ms
[2020-05-12 02:21:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 484 ms
[2020-05-12 02:21:07] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 11 ms.
[2020-05-12 02:21:08] [INFO ] Added : 150 causal constraints over 31 iterations in 520 ms. Result :sat
[2020-05-12 02:21:08] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:21:08] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:08] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 19 places in 43 ms
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 11 places in 39 ms
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 15 places in 26 ms
[2020-05-12 02:21:08] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 18 places in 39 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 26 places in 39 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 19 places in 43 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 28 places in 39 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 29 places in 32 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 30 places in 38 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-05-12 02:21:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 763 ms
[2020-05-12 02:21:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:21:09] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:09] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-12 02:21:09] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 19 places in 36 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 26 places in 37 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 28 places in 31 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 29 places in 31 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 21 places in 32 ms
[2020-05-12 02:21:10] [INFO ] Deduced a trap composed of 37 places in 33 ms
[2020-05-12 02:21:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 687 ms
[2020-05-12 02:21:10] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:21:10] [INFO ] Added : 165 causal constraints over 34 iterations in 622 ms. Result :sat
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 52 places in 47 ms
[2020-05-12 02:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2020-05-12 02:21:11] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned unsat
[2020-05-12 02:21:11] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-12 02:21:11] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:11] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 13 places in 130 ms
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-12 02:21:11] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 23 places in 377 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 33 places in 39 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 57 places in 45 ms
[2020-05-12 02:21:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 964 ms
[2020-05-12 02:21:12] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:21:12] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:12] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 8 places in 51 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 30 places in 51 ms
[2020-05-12 02:21:12] [INFO ] Deduced a trap composed of 15 places in 104 ms
[2020-05-12 02:21:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 527 ms
[2020-05-12 02:21:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-05-12 02:21:12] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:13] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 15 places in 80 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 20 places in 38 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 30 places in 39 ms
[2020-05-12 02:21:13] [INFO ] Deduced a trap composed of 15 places in 23 ms
[2020-05-12 02:21:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 431 ms
[2020-05-12 02:21:13] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-05-12 02:21:14] [INFO ] Added : 138 causal constraints over 28 iterations in 518 ms. Result :sat
[2020-05-12 02:21:14] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:21:14] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:14] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 15 places in 30 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 8 places in 20 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 18 places in 22 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 17 places in 23 ms
[2020-05-12 02:21:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 137 ms
[2020-05-12 02:21:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:14] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:21:14] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:14] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 17 places in 21 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-05-12 02:21:14] [INFO ] Deduced a trap composed of 11 places in 17 ms
[2020-05-12 02:21:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 190 ms
[2020-05-12 02:21:14] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-05-12 02:21:15] [INFO ] Added : 139 causal constraints over 29 iterations in 455 ms. Result :sat
[2020-05-12 02:21:15] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-05-12 02:21:15] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2020-05-12 02:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:15] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 8 places in 27 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 28 places in 44 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 16 places in 29 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 19 places in 25 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 31 places in 23 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 22 places in 23 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 18 places in 31 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2020-05-12 02:21:15] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2020-05-12 02:21:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 416 ms
[2020-05-12 02:21:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:15] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2020-05-12 02:21:15] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:16] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 28 places in 29 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 16 places in 27 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 19 places in 24 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 31 places in 24 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 22 places in 22 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 18 places in 22 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 35 places in 21 ms
[2020-05-12 02:21:16] [INFO ] Deduced a trap composed of 34 places in 22 ms
[2020-05-12 02:21:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 382 ms
[2020-05-12 02:21:16] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-05-12 02:21:16] [INFO ] Added : 155 causal constraints over 31 iterations in 462 ms. Result :sat
[2020-05-12 02:21:17] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-12 02:21:17] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2020-05-12 02:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:17] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 19 places in 30 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 11 places in 26 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 15 places in 24 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 20 places in 25 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 23 places in 27 ms
[2020-05-12 02:21:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 247 ms
[2020-05-12 02:21:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2020-05-12 02:21:17] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:17] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 19 places in 33 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 12 places in 28 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 11 places in 25 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 20 places in 25 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 16 places in 25 ms
[2020-05-12 02:21:17] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2020-05-12 02:21:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 211 ms
[2020-05-12 02:21:17] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 6 ms.
[2020-05-12 02:21:18] [INFO ] Added : 143 causal constraints over 29 iterations in 394 ms. Result :sat
[2020-05-12 02:21:18] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-12 02:21:18] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:18] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 10 places in 43 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 14 places in 29 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 13 places in 27 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 26 places in 28 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 29 places in 25 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 35 places in 24 ms
[2020-05-12 02:21:18] [INFO ] Deduced a trap composed of 31 places in 25 ms
[2020-05-12 02:21:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 383 ms
[2020-05-12 02:21:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-05-12 02:21:18] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:19] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 10 places in 45 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 28 places in 25 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 18 places in 25 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 29 places in 38 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 36 places in 23 ms
[2020-05-12 02:21:19] [INFO ] Deduced a trap composed of 31 places in 24 ms
[2020-05-12 02:21:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 451 ms
[2020-05-12 02:21:19] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-05-12 02:21:19] [INFO ] Added : 156 causal constraints over 32 iterations in 474 ms. Result :sat
[2020-05-12 02:21:20] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2020-05-12 02:21:20] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:20] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 11 places in 106 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 15 places in 39 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 35 places in 38 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 10 places in 41 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 31 places in 24 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2020-05-12 02:21:20] [INFO ] Deduced a trap composed of 33 places in 24 ms
[2020-05-12 02:21:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 595 ms
[2020-05-12 02:21:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:20] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-12 02:21:20] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-05-12 02:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:20] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 8 places in 47 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 10 places in 43 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 14 places in 37 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 21 places in 30 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 17 places in 27 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 12 places in 33 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 28 places in 32 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 27 places in 28 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 37 places in 32 ms
[2020-05-12 02:21:21] [INFO ] Deduced a trap composed of 33 places in 29 ms
[2020-05-12 02:21:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 543 ms
[2020-05-12 02:21:21] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 12 ms.
[2020-05-12 02:21:21] [INFO ] Added : 147 causal constraints over 30 iterations in 469 ms. Result :sat
[2020-05-12 02:21:22] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2020-05-12 02:21:22] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2020-05-12 02:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:22] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 12 places in 42 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 16 places in 45 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 19 places in 40 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 55 places in 40 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 33 places in 40 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 56 places in 38 ms
[2020-05-12 02:21:22] [INFO ] Deduced a trap composed of 58 places in 36 ms
[2020-05-12 02:21:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 707 ms
[2020-05-12 02:21:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:21:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-12 02:21:22] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 9 ms returned sat
[2020-05-12 02:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:21:23] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 12 places in 39 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 13 places in 18 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 11 places in 20 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 15 places in 31 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2020-05-12 02:21:23] [INFO ] Deduced a trap composed of 19 places in 21 ms
[2020-05-12 02:21:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 288 ms
[2020-05-12 02:21:23] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 7 ms.
[2020-05-12 02:21:23] [INFO ] Added : 142 causal constraints over 29 iterations in 405 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 02:21:23] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:21:23] [INFO ] Flatten gal took : 48 ms
[2020-05-12 02:21:23] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:21:23] [INFO ] Flatten gal took : 22 ms
FORMULA BusinessProcesses-PT-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:21:24] [INFO ] Applying decomposition
[2020-05-12 02:21:24] [INFO ] Flatten gal took : 15 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/graph16303366628436097045.txt, -o, /tmp/graph16303366628436097045.bin, -w, /tmp/graph16303366628436097045.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/graph16303366628436097045.bin, -l, -1, -v, -w, /tmp/graph16303366628436097045.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:21:24] [INFO ] Decomposing Gal with order
[2020-05-12 02:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:21:24] [INFO ] Removed a total of 36 redundant transitions.
[2020-05-12 02:21:24] [INFO ] Flatten gal took : 45 ms
[2020-05-12 02:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-12 02:21:24] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 8 ms
[2020-05-12 02:21:24] [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 10 CTL formulae.
built 40 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 36 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 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,3.14315e+12,0.096771,8748,1256,29,8549,320,559,9759,46,736,0


Converting to forward existential form...Done !
original formula: E((i3.u15.p41!=1) U (((i1.u23.p63==1)&&(i7.i1.u63.p178==1))&&(i16.u96.p255==1)))
=> equivalent forward existential formula: [(FwdU(Init,(i3.u15.p41!=1)) * (((i1.u23.p63==1)&&(i7.i1.u63.p178==1))&&(i16.u96.p255==1)))] != FALSE
(forward)formula 0,1,0.117054,8748,1,0,8549,320,1226,9759,83,736,14552
FORMULA BusinessProcesses-PT-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((i2.u5.p12==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i2.u5.p12==1))] != FALSE
(forward)formula 1,1,0.117563,8748,1,0,8549,320,1229,9759,84,736,14830
FORMULA BusinessProcesses-PT-02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((i9.i0.u42.p116==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i9.i0.u42.p116==1))] != FALSE
(forward)formula 2,1,0.118107,8748,1,0,8549,320,1231,9759,84,736,15018
FORMULA BusinessProcesses-PT-02-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EF((i16.u87.p237==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i16.u87.p237==1))] = FALSE
(forward)formula 3,0,0.118646,8748,1,0,8549,320,1233,9759,84,736,15445
FORMULA BusinessProcesses-PT-02-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((i13.u24.p68==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i13.u24.p68==1))] != FALSE
(forward)formula 4,1,0.119177,8748,1,0,8549,320,1234,9759,84,736,15842
FORMULA BusinessProcesses-PT-02-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(EX((i1.u3.p6==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EX((i1.u3.p6==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t156, t168, t174, i0.u27.t135, i0.u29.t131, i1.u23.t149, i1.u25.t141, i2.t162, i2.u6.t182, i2.u14.t167, i4.u17.t161, i5.t150, i5.u21.t153, i6.i1.u31.t127, i7.i1.t74, i7.i1.u63.t75, i7.i2.t70, i7.i2.u65.t71, i7.i3.t66, i7.i3.u67.t67, i8.i1.t90, i8.i1.u54.t91, i8.i2.t86, i8.i2.u57.t87, i9.i1.t114, i9.i1.u45.t115, i10.i1.t110, i10.i1.u47.t111, i11.i0.t171, i11.i0.u11.t173, i11.i1.t94, i11.i1.u53.t95, i12.i0.t177, i12.i0.u8.t179, i12.i1.t98, i12.i1.u51.t99, i13.t82, i13.u58.t83, i14.t78, i14.u60.t79, i15.t62, i15.u68.t63, i16.t56, i16.t45, i16.t43, i16.t40, i16.t38, i16.t35, i16.t33, i16.t30, i16.t28, i16.t21, i16.t18, i16.t15, i16.t12, i16.t9, i16.t6, i16.u96.t4, i16.u96.t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/145/59/204
(forward)formula 5,0,0.49227,30252,1,0,56158,356,3691,69995,234,1050,180980
FORMULA BusinessProcesses-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((EX(((i8.i0.u38.p108==1)||(i2.u5.p12==1))) * (i1.u26.p76==1)) * (i10.i0.u48.p139==1)) * (i1.u90.p243==1)))
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * (i1.u90.p243==1)) * (i10.i0.u48.p139==1)) * (i1.u26.p76==1))) * ((i8.i0.u38.p108==1)||(i2.u5.p12==1)))] != FALSE
(forward)formula 6,1,0.497385,30516,1,0,56345,356,3752,70461,235,1058,182787
FORMULA BusinessProcesses-PT-02-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i16.u91.p246==1)&&(i9.i0.u43.p121==1))||((i16.u93.p249==1)&&(i16.u93.p250==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i16.u91.p246==1)&&(i9.i0.u43.p121==1))||((i16.u93.p249==1)&&(i16.u93.p250==1))))] != FALSE
(forward)formula 7,1,0.49916,30516,1,0,56353,356,3772,70478,237,1058,183591
FORMULA BusinessProcesses-PT-02-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(!(EF((i16.u83.p229==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U (i16.u83.p229==1))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
(forward)formula 8,0,0.634432,35796,1,0,71161,364,3955,92906,255,1109,213490
FORMULA BusinessProcesses-PT-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((i10.i0.u40.p113==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i10.i0.u40.p113==1))] = FALSE
(forward)formula 9,0,0.635049,36060,1,0,71174,364,3957,92964,255,1109,213626
FORMULA BusinessProcesses-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589250085131

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

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